YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:48:54,321 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:48:54,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:48:54,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:48:54,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:48:54,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:48:54,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:48:54,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:48:54,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:48:54,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:48:54,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:48:54,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:48:54,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:48:54,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:48:54,344 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:48:54,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:48:54,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:48:54,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:48:54,349 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:48:54,351 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:48:54,352 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:48:54,353 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:48:54,355 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:48:54,355 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:48:54,355 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:48:54,356 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:48:54,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:48:54,357 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:48:54,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:48:54,358 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:48:54,359 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:48:54,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:48:54,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:48:54,361 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:48:54,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:48:54,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:48:54,362 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:48:54,363 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:48:54,363 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:48:54,363 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:48:54,377 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:48:54,378 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:48:54,379 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:48:54,379 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:48:54,379 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:48:54,379 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:48:54,379 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:48:54,379 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:48:54,380 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:48:54,380 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:48:54,380 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:48:54,380 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:48:54,380 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:48:54,380 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:48:54,381 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:48:54,381 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:48:54,381 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:48:54,381 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:48:54,381 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:48:54,381 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:48:54,382 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:48:54,382 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:48:54,382 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:48:54,382 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:48:54,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:48:54,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:48:54,382 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:48:54,383 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:48:54,383 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:48:54,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:48:54,421 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:48:54,425 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:48:54,426 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:48:54,427 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:48:54,427 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:48:54,493 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/1f41424f17504765b5c17148732e2a89/FLAG5ba52de2e !SESSION 2020-06-22 09:48:51.987 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-06-22 09:48:54.762 !MESSAGE Indexed 'FLAG5ba52de2e' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-22 09:48:54,847 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:48:54,847 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:48:54,848 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:48:54,854 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/1f41424f17504765b5c17148732e2a89/FLAG5ba52de2e [2020-06-22 09:48:55,282 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/1f41424f17504765b5c17148732e2a89 [2020-06-22 09:48:55,294 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:48:55,295 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:48:55,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:48:55,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:48:55,300 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:48:55,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:48:55" (1/1) ... [2020-06-22 09:48:55,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@abcbaa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55, skipping insertion in model container [2020-06-22 09:48:55,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:48:55" (1/1) ... [2020-06-22 09:48:55,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:48:55,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:48:55,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:48:55,551 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:48:55,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:48:55,582 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:48:55,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55 WrapperNode [2020-06-22 09:48:55,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:48:55,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:48:55,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:48:55,584 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:48:55,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55" (1/1) ... [2020-06-22 09:48:55,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55" (1/1) ... [2020-06-22 09:48:55,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:48:55,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:48:55,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:48:55,622 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:48:55,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55" (1/1) ... [2020-06-22 09:48:55,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55" (1/1) ... [2020-06-22 09:48:55,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55" (1/1) ... [2020-06-22 09:48:55,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55" (1/1) ... [2020-06-22 09:48:55,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55" (1/1) ... [2020-06-22 09:48:55,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55" (1/1) ... [2020-06-22 09:48:55,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55" (1/1) ... [2020-06-22 09:48:55,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:48:55,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:48:55,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:48:55,644 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:48:55,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:48:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:48:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:48:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:48:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:48:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:48:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:48:55,928 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:48:55,928 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 09:48:55,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:48:55 BoogieIcfgContainer [2020-06-22 09:48:55,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:48:55,930 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:48:55,930 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:48:55,933 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:48:55,933 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:48:55" (1/1) ... [2020-06-22 09:48:55,949 INFO L313 BlockEncoder]: Initial Icfg 36 locations, 38 edges [2020-06-22 09:48:55,951 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:48:55,951 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:48:55,952 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:48:55,952 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:48:55,954 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:48:55,955 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:48:55,955 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:48:55,976 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:48:56,006 INFO L200 BlockEncoder]: SBE split 17 edges [2020-06-22 09:48:56,011 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 09:48:56,015 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:48:56,051 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 09:48:56,055 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:48:56,056 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:48:56,057 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:48:56,057 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:48:56,058 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:48:56,058 INFO L313 BlockEncoder]: Encoded RCFG 28 locations, 47 edges [2020-06-22 09:48:56,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:48:56 BasicIcfg [2020-06-22 09:48:56,059 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:48:56,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:48:56,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:48:56,063 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:48:56,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:48:55" (1/4) ... [2020-06-22 09:48:56,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663c7741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:48:56, skipping insertion in model container [2020-06-22 09:48:56,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55" (2/4) ... [2020-06-22 09:48:56,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663c7741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:48:56, skipping insertion in model container [2020-06-22 09:48:56,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:48:55" (3/4) ... [2020-06-22 09:48:56,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663c7741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:48:56, skipping insertion in model container [2020-06-22 09:48:56,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:48:56" (4/4) ... [2020-06-22 09:48:56,067 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:48:56,077 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:48:56,085 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-06-22 09:48:56,101 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-06-22 09:48:56,130 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:48:56,131 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:48:56,131 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:48:56,131 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:48:56,131 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:48:56,131 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:48:56,131 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:48:56,131 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:48:56,132 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:48:56,147 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-06-22 09:48:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:48:56,153 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:48:56,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:48:56,154 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:48:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:48:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash 115897, now seen corresponding path program 1 times [2020-06-22 09:48:56,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:48:56,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:48:56,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:56,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:48:56,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:48:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:48:56,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:48:56,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:48:56,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:48:56,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:48:56,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:48:56,354 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-06-22 09:48:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:48:56,477 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. [2020-06-22 09:48:56,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:48:56,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:48:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:48:56,491 INFO L225 Difference]: With dead ends: 28 [2020-06-22 09:48:56,492 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 09:48:56,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:48:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 09:48:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 09:48:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 09:48:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-06-22 09:48:56,531 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 3 [2020-06-22 09:48:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:48:56,532 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-06-22 09:48:56,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:48:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-06-22 09:48:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:48:56,533 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:48:56,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:48:56,533 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:48:56,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:48:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash 115899, now seen corresponding path program 1 times [2020-06-22 09:48:56,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:48:56,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:48:56,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:56,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:48:56,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:48:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:48:56,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:48:56,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:48:56,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:48:56,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:48:56,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:48:56,559 INFO L87 Difference]: Start difference. First operand 24 states and 39 transitions. Second operand 3 states. [2020-06-22 09:48:56,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:48:56,631 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2020-06-22 09:48:56,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:48:56,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:48:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:48:56,632 INFO L225 Difference]: With dead ends: 28 [2020-06-22 09:48:56,632 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 09:48:56,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:48:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 09:48:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 09:48:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 09:48:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2020-06-22 09:48:56,638 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 3 [2020-06-22 09:48:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:48:56,638 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-06-22 09:48:56,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:48:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2020-06-22 09:48:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:48:56,639 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:48:56,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:48:56,639 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:48:56,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:48:56,639 INFO L82 PathProgramCache]: Analyzing trace with hash 115900, now seen corresponding path program 1 times [2020-06-22 09:48:56,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:48:56,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:48:56,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:56,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:48:56,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:48:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:48:56,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:48:56,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:48:56,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:48:56,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:48:56,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:48:56,681 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2020-06-22 09:48:56,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:48:56,734 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-06-22 09:48:56,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:48:56,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:48:56,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:48:56,736 INFO L225 Difference]: With dead ends: 24 [2020-06-22 09:48:56,736 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 09:48:56,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:48:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 09:48:56,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 09:48:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:48:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-06-22 09:48:56,742 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 3 [2020-06-22 09:48:56,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:48:56,742 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-06-22 09:48:56,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:48:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2020-06-22 09:48:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:48:56,743 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:48:56,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:48:56,743 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:48:56,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:48:56,744 INFO L82 PathProgramCache]: Analyzing trace with hash 3591156, now seen corresponding path program 1 times [2020-06-22 09:48:56,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:48:56,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:48:56,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:56,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:48:56,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:48:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:48:56,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:48:56,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:48:56,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:48:56,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:48:56,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:48:56,771 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2020-06-22 09:48:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:48:56,819 INFO L93 Difference]: Finished difference Result 20 states and 31 transitions. [2020-06-22 09:48:56,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:48:56,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:48:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:48:56,821 INFO L225 Difference]: With dead ends: 20 [2020-06-22 09:48:56,821 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 09:48:56,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:48:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 09:48:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 09:48:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 09:48:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2020-06-22 09:48:56,824 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 4 [2020-06-22 09:48:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:48:56,825 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-06-22 09:48:56,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:48:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2020-06-22 09:48:56,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:48:56,825 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:48:56,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:48:56,826 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:48:56,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:48:56,826 INFO L82 PathProgramCache]: Analyzing trace with hash 3591158, now seen corresponding path program 1 times [2020-06-22 09:48:56,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:48:56,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:48:56,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:56,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:48:56,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:48:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:48:56,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:48:56,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:48:56,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:48:56,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:48:56,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:48:56,852 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. [2020-06-22 09:48:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:48:56,882 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-06-22 09:48:56,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:48:56,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:48:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:48:56,883 INFO L225 Difference]: With dead ends: 20 [2020-06-22 09:48:56,883 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 09:48:56,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:48:56,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 09:48:56,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 09:48:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 09:48:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-06-22 09:48:56,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 4 [2020-06-22 09:48:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:48:56,887 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-06-22 09:48:56,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:48:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-06-22 09:48:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:48:56,887 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:48:56,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:48:56,888 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:48:56,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:48:56,888 INFO L82 PathProgramCache]: Analyzing trace with hash 3591159, now seen corresponding path program 1 times [2020-06-22 09:48:56,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:48:56,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:48:56,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:56,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:48:56,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:48:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:48:56,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:48:56,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:48:56,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:48:56,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:48:56,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:48:56,918 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 3 states. [2020-06-22 09:48:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:48:56,945 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-06-22 09:48:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:48:56,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:48:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:48:56,946 INFO L225 Difference]: With dead ends: 16 [2020-06-22 09:48:56,946 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:48:56,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:48:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:48:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:48:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:48:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:48:56,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-06-22 09:48:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:48:56,947 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:48:56,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:48:56,948 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:48:56,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:48:56,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:48:56,975 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 09:48:56,976 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-06-22 09:48:56,976 INFO L444 ceAbstractionStarter]: At program point L9-1(lines 8 13) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~c~0.base)) (= ULTIMATE.start_main_~c~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base))) [2020-06-22 09:48:56,976 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2020-06-22 09:48:56,976 INFO L448 ceAbstractionStarter]: For program point L9-2(lines 9 13) no Hoare annotation was computed. [2020-06-22 09:48:56,976 INFO L448 ceAbstractionStarter]: For program point L7-1(line 7) no Hoare annotation was computed. [2020-06-22 09:48:56,976 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 09:48:56,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:48:56,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:48:56,977 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 09:48:56,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:48:56,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:48:56,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:48:56,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 09:48:56,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 09:48:56,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 09:48:56,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:48:56,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:48:56,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:48:56,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:48:56,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:48:56,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:48:56,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:48:56,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:48:56,979 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 09:48:56,979 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 09:48:56,979 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-06-22 09:48:56,979 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 09:48:56,979 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:48:56,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:48:56,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:48:56,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:48:56,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:48:56,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:48:56 BasicIcfg [2020-06-22 09:48:56,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:48:56,997 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:48:56,997 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:48:57,000 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:48:57,001 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:48:57,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:48:55" (1/5) ... [2020-06-22 09:48:57,001 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@639ddfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:48:57, skipping insertion in model container [2020-06-22 09:48:57,002 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:48:57,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:48:55" (2/5) ... [2020-06-22 09:48:57,002 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@639ddfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:48:57, skipping insertion in model container [2020-06-22 09:48:57,002 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:48:57,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:48:55" (3/5) ... [2020-06-22 09:48:57,003 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@639ddfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:48:57, skipping insertion in model container [2020-06-22 09:48:57,003 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:48:57,003 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:48:56" (4/5) ... [2020-06-22 09:48:57,003 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@639ddfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:48:57, skipping insertion in model container [2020-06-22 09:48:57,003 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:48:57,003 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:48:56" (5/5) ... [2020-06-22 09:48:57,005 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:48:57,025 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:48:57,025 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:48:57,025 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:48:57,025 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:48:57,025 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:48:57,025 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:48:57,025 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:48:57,026 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:48:57,026 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:48:57,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-06-22 09:48:57,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 09:48:57,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:48:57,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:48:57,040 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:48:57,040 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:48:57,040 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:48:57,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-06-22 09:48:57,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 09:48:57,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:48:57,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:48:57,043 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:48:57,043 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:48:57,048 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue [86] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [111] L-1-->L7: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 7#L7true [55] L7-->L7-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~i~0.base_4)) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~i~0.base_4)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~i~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4 0)))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 5#L7-1true [52] L7-1-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~c~0.base_4)) (= (select |v_#valid_8| v_ULTIMATE.start_main_~c~0.base_4) 1) (= (store |v_#memory_int_4| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 0)) |v_#memory_int_3|) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 10#L9-1true [2020-06-22 09:48:57,049 INFO L796 eck$LassoCheckResult]: Loop: 10#L9-1true [63] L9-1-->L10: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13#L10true [69] L10-->L10-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~i~0.base_7) 1) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 23#L10-1true [99] L10-1-->L11: Formula: (>= 10 |v_ULTIMATE.start_main_#t~mem2_6|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 26#L11true [145] L11-->L11-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem3_5| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (= 1 (select |v_#valid_27| v_ULTIMATE.start_main_~i~0.base_16)) (= |v_ULTIMATE.start_main_#t~post4_5| |v_ULTIMATE.start_main_#t~mem3_5|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_21| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_14|, #length=|v_#length_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_14|, #length=|v_#length_21|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~mem3] 11#L11-2true [148] L11-2-->L12: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_17 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_17) v_ULTIMATE.start_main_~i~0.offset_13 (+ |v_ULTIMATE.start_main_#t~post4_7| 1))) |v_#memory_int_17|) (= (select |v_#valid_32| v_ULTIMATE.start_main_~i~0.base_17) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_13) (<= (+ v_ULTIMATE.start_main_~i~0.offset_13 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_17))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_17|, #length=|v_#length_24|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_6|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem3, ULTIMATE.start_main_#t~post4] 15#L12true [149] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_#t~post6_5| |v_ULTIMATE.start_main_#t~mem5_5|) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~c~0.base_19)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_15) (= |v_ULTIMATE.start_main_#t~mem5_5| (select (select |v_#memory_int_19| v_ULTIMATE.start_main_~c~0.base_19) v_ULTIMATE.start_main_~c~0.offset_15)) (<= (+ v_ULTIMATE.start_main_~c~0.offset_15 4) (select |v_#length_25| v_ULTIMATE.start_main_~c~0.base_19))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_19, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_15, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, #length=|v_#length_25|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_19, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_15, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, #length=|v_#length_25|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 14#L12-2true [150] L12-2-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_16 4) (select |v_#length_26| v_ULTIMATE.start_main_~c~0.base_20)) (= (select |v_#valid_34| v_ULTIMATE.start_main_~c~0.base_20) 1) (<= 0 v_ULTIMATE.start_main_~c~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~c~0.base_20 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~c~0.base_20) v_ULTIMATE.start_main_~c~0.offset_16 (+ |v_ULTIMATE.start_main_#t~post6_7| 1))) |v_#memory_int_20|)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_20, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_16, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_21|, #length=|v_#length_26|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_7|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_20, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_16, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_20|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post6] 10#L9-1true [2020-06-22 09:48:57,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:48:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash 3593975, now seen corresponding path program 1 times [2020-06-22 09:48:57,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:48:57,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:48:57,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:57,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:48:57,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:48:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:48:57,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:48:57,093 INFO L82 PathProgramCache]: Analyzing trace with hash -402693216, now seen corresponding path program 1 times [2020-06-22 09:48:57,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:48:57,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:48:57,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:57,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:48:57,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:48:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:48:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:48:57,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1827466218, now seen corresponding path program 1 times [2020-06-22 09:48:57,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:48:57,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:48:57,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:57,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:48:57,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:48:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:48:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:48:57,434 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-06-22 09:48:57,534 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:48:57,535 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:48:57,535 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:48:57,535 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:48:57,535 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:48:57,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:48:57,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:48:57,536 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:48:57,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 09:48:57,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:48:57,536 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:48:57,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:48:57,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:48:57,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:48:57,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:48:57,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:48:57,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:48:57,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:48:57,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:48:57,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:48:57,745 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2020-06-22 09:48:57,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:48:57,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:48:57,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:48:58,109 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:48:58,114 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:48:58,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:48:58,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:48:58,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:48:58,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:48:58,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:48:58,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:48:58,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:48:58,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:48:58,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:48:58,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:48:58,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:48:58,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:48:58,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:48:58,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:48:58,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:48:58,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:48:58,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:48:58,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:48:58,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:48:58,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:48:58,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:48:58,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:48:58,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:48:58,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:48:58,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:48:58,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:48:58,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:48:58,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:48:58,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:48:58,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:48:58,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:48:58,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:48:58,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:48:58,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:48:58,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:48:58,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:48:58,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:48:58,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:48:58,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:48:58,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:48:58,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:48:58,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:48:58,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:48:58,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:48:58,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:48:58,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:48:58,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:48:58,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:48:58,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:48:58,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:48:58,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:48:58,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:48:58,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:48:58,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:48:58,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:48:58,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:48:58,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:48:58,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:48:58,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:48:58,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:48:58,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:48:58,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:48:58,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:48:58,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:48:58,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:48:58,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:48:58,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:48:58,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:48:58,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:48:58,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:48:58,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:48:58,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:48:58,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:48:58,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:48:58,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:48:58,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:48:58,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:48:58,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:48:58,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:48:58,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:48:58,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:48:58,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:48:58,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:48:58,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:48:58,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:48:58,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:48:58,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:48:58,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:48:58,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:48:58,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:48:58,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:48:58,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:48:58,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:48:58,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:48:58,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:48:58,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:48:58,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:48:58,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:48:58,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:48:58,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:48:58,208 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:48:58,220 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:48:58,220 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:48:58,223 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:48:58,224 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:48:58,225 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:48:58,225 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 + 21 Supporting invariants [] [2020-06-22 09:48:58,257 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 09:48:58,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:48:58,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:48:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:48:58,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:48:58,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:48:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:48:58,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:48:58,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:48:58,429 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 09:48:58,431 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:48:58,441 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:48:58,442 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:48:58,443 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2020-06-22 09:48:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:48:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:48:58,571 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:48:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:48:58,580 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:48:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:48:58,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:48:58,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:48:58,639 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:48:58,639 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 65 [2020-06-22 09:48:58,649 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:48:58,694 INFO L497 ElimStorePlain]: treesize reduction 18, result has 72.3 percent of original size [2020-06-22 09:48:58,702 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-06-22 09:48:58,702 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:52 [2020-06-22 09:49:10,870 WARN L188 SmtUtils]: Spent 7.61 s on a formula simplification that was a NOOP. DAG size: 37 [2020-06-22 09:49:12,423 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) 1) (select (select |c_#memory_int| v_prenex_1) v_prenex_2))) (exists ((ULTIMATE.start_main_~c~0.base Int) (ULTIMATE.start_main_~c~0.offset Int)) (not (and (= ULTIMATE.start_main_~c~0.offset c_ULTIMATE.start_main_~i~0.offset) (= c_ULTIMATE.start_main_~i~0.base ULTIMATE.start_main_~c~0.base)))) (exists ((v_arrayElimCell_2 Int)) (and (<= (+ v_arrayElimCell_2 1) (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset)) (<= 21 (+ (* 2 v_arrayElimCell_2) c_oldRank0))))) is different from true [2020-06-22 09:49:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:12,454 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:49:12,454 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 09:49:12,458 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-06-22 09:49:12,459 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states. Second operand 8 states. [2020-06-22 09:49:12,660 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states.. Second operand 8 states. Result 49 states and 85 transitions. Complement of second has 12 states. [2020-06-22 09:49:12,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-06-22 09:49:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 09:49:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2020-06-22 09:49:12,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 81 transitions. Stem has 4 letters. Loop has 7 letters. [2020-06-22 09:49:12,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:49:12,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 81 transitions. Stem has 11 letters. Loop has 7 letters. [2020-06-22 09:49:12,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:49:12,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 81 transitions. Stem has 4 letters. Loop has 14 letters. [2020-06-22 09:49:12,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:49:12,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 85 transitions. [2020-06-22 09:49:12,676 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:49:12,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2020-06-22 09:49:12,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:49:12,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:49:12,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:49:12,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:49:12,679 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:49:12,679 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:49:12,679 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:49:12,679 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:49:12,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:49:12,679 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:49:12,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:49:12,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:49:12 BasicIcfg [2020-06-22 09:49:12,685 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:49:12,685 INFO L168 Benchmark]: Toolchain (without parser) took 17391.11 ms. Allocated memory was 649.6 MB in the beginning and 740.8 MB in the end (delta: 91.2 MB). Free memory was 563.1 MB in the beginning and 534.8 MB in the end (delta: 28.2 MB). Peak memory consumption was 119.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,686 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:49:12,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.07 ms. Allocated memory was 649.6 MB in the beginning and 663.2 MB in the end (delta: 13.6 MB). Free memory was 563.1 MB in the beginning and 626.8 MB in the end (delta: -63.8 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.53 ms. Allocated memory is still 663.2 MB. Free memory was 626.8 MB in the beginning and 624.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,688 INFO L168 Benchmark]: Boogie Preprocessor took 21.94 ms. Allocated memory is still 663.2 MB. Free memory was 624.1 MB in the beginning and 622.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,689 INFO L168 Benchmark]: RCFGBuilder took 286.19 ms. Allocated memory is still 663.2 MB. Free memory was 622.8 MB in the beginning and 602.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,689 INFO L168 Benchmark]: BlockEncodingV2 took 128.76 ms. Allocated memory is still 663.2 MB. Free memory was 602.8 MB in the beginning and 593.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,690 INFO L168 Benchmark]: TraceAbstraction took 936.46 ms. Allocated memory is still 663.2 MB. Free memory was 593.4 MB in the beginning and 499.4 MB in the end (delta: 94.0 MB). Peak memory consumption was 94.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,690 INFO L168 Benchmark]: BuchiAutomizer took 15688.12 ms. Allocated memory was 663.2 MB in the beginning and 740.8 MB in the end (delta: 77.6 MB). Free memory was 499.4 MB in the beginning and 534.8 MB in the end (delta: -35.4 MB). Peak memory consumption was 42.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,695 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 36 locations, 38 edges - StatisticsResult: Encoded RCFG 28 locations, 47 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 287.07 ms. Allocated memory was 649.6 MB in the beginning and 663.2 MB in the end (delta: 13.6 MB). Free memory was 563.1 MB in the beginning and 626.8 MB in the end (delta: -63.8 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 37.53 ms. Allocated memory is still 663.2 MB. Free memory was 626.8 MB in the beginning and 624.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 21.94 ms. Allocated memory is still 663.2 MB. Free memory was 624.1 MB in the beginning and 622.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 286.19 ms. Allocated memory is still 663.2 MB. Free memory was 622.8 MB in the beginning and 602.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 128.76 ms. Allocated memory is still 663.2 MB. Free memory was 602.8 MB in the beginning and 593.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 936.46 ms. Allocated memory is still 663.2 MB. Free memory was 593.4 MB in the beginning and 499.4 MB in the end (delta: 94.0 MB). Peak memory consumption was 94.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 15688.12 ms. Allocated memory was 663.2 MB in the beginning and 740.8 MB in the end (delta: 77.6 MB). Free memory was 499.4 MB in the beginning and 534.8 MB in the end (delta: -35.4 MB). Peak memory consumption was 42.2 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-06-22 09:49:12,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:12,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:12,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:12,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((4 == unknown-#length-unknown[c] && c == 0) && 4 == unknown-#length-unknown[i]) && 0 == i) && 1 == \valid[c]) && 1 == \valid[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 16 error locations. SAFE Result, 0.8s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25 SDtfs, 129 SDslu, 4 SDs, 0 SdLazy, 139 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 21 and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 14.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 92 SDslu, 37 SDs, 0 SdLazy, 205 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital212 mio100 ax100 hnf100 lsp94 ukn59 mio100 lsp43 div100 bol100 ite100 ukn100 eq153 hnf91 smp83 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:49:12.927 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check