/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/matrix-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:45:40,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:45:40,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:45:40,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:45:40,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:45:40,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:45:40,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:45:40,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:45:40,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:45:40,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:45:40,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:45:40,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:45:40,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:45:40,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:45:40,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:45:40,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:45:40,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:45:40,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:45:40,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:45:40,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:45:40,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:45:40,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:45:40,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:45:40,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:45:40,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:45:40,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:45:40,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:45:40,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:45:40,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:45:40,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:45:40,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:45:40,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:45:40,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:45:40,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:45:40,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:45:40,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:45:40,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:45:40,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:45:40,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:45:40,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:45:40,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:45:40,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:45:40,684 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:45:40,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:45:40,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:45:40,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:45:40,686 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:45:40,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:45:40,687 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:45:40,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:45:40,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:45:40,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:45:40,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:45:40,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:45:40,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:45:40,690 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:45:40,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:45:40,690 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:45:40,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:45:40,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:45:40,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:45:40,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:45:40,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:45:40,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:45:40,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:45:40,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:45:40,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:45:40,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:45:40,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:45:40,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:45:40,693 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:45:40,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:45:40,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:45:40,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:45:40,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:45:40,987 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:45:40,988 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:45:40,988 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix-2.c [2020-07-08 12:45:41,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e278eaa9b/1b58e9c8a8ab4b7086c1ad37984bd14e/FLAG1cc9a2f8e [2020-07-08 12:45:41,542 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:45:41,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-2.c [2020-07-08 12:45:41,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e278eaa9b/1b58e9c8a8ab4b7086c1ad37984bd14e/FLAG1cc9a2f8e [2020-07-08 12:45:41,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e278eaa9b/1b58e9c8a8ab4b7086c1ad37984bd14e [2020-07-08 12:45:41,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:45:41,948 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:45:41,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:41,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:45:41,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:45:41,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:41" (1/1) ... [2020-07-08 12:45:41,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de36573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:41, skipping insertion in model container [2020-07-08 12:45:41,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:41" (1/1) ... [2020-07-08 12:45:41,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:45:41,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:45:42,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:42,207 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:45:42,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:42,271 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:45:42,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:42 WrapperNode [2020-07-08 12:45:42,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:42,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:45:42,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:45:42,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:45:42,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:42" (1/1) ... [2020-07-08 12:45:42,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:42" (1/1) ... [2020-07-08 12:45:42,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:42" (1/1) ... [2020-07-08 12:45:42,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:42" (1/1) ... [2020-07-08 12:45:42,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:42" (1/1) ... [2020-07-08 12:45:42,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:42" (1/1) ... [2020-07-08 12:45:42,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:42" (1/1) ... [2020-07-08 12:45:42,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:45:42,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:45:42,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:45:42,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:45:42,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:45:42,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:45:42,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:45:42,486 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:45:42,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:45:42,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:45:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:45:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-08 12:45:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:45:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:45:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:45:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:45:42,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:45:42,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:45:42,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:45:42,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:45:43,034 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:45:43,035 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-08 12:45:43,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:43 BoogieIcfgContainer [2020-07-08 12:45:43,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:45:43,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:45:43,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:45:43,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:45:43,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:45:41" (1/3) ... [2020-07-08 12:45:43,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e39847f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:43, skipping insertion in model container [2020-07-08 12:45:43,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:42" (2/3) ... [2020-07-08 12:45:43,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e39847f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:43, skipping insertion in model container [2020-07-08 12:45:43,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:43" (3/3) ... [2020-07-08 12:45:43,050 INFO L109 eAbstractionObserver]: Analyzing ICFG matrix-2.c [2020-07-08 12:45:43,062 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:45:43,071 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:45:43,085 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:45:43,106 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:45:43,107 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:45:43,107 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:45:43,107 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:45:43,107 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:45:43,107 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:45:43,108 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:45:43,108 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:45:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-08 12:45:43,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:45:43,133 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:43,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:43,134 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:43,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2125374060, now seen corresponding path program 1 times [2020-07-08 12:45:43,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:43,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105721428] [2020-07-08 12:45:43,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:43,258 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:45:43,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530289610] [2020-07-08 12:45:43,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:43,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-08 12:45:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:43,346 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:43,399 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-08 12:45:43,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {32#true} is VALID [2020-07-08 12:45:43,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-08 12:45:43,401 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #78#return; {32#true} is VALID [2020-07-08 12:45:43,401 INFO L263 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret11 := main(); {32#true} is VALID [2020-07-08 12:45:43,402 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} ~N_LIN~0 := #t~nondet0;havoc #t~nondet0;~N_COL~0 := #t~nondet1;havoc #t~nondet1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {32#true} is VALID [2020-07-08 12:45:43,404 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2020-07-08 12:45:43,404 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#false} ~j~0 := 0; {33#false} is VALID [2020-07-08 12:45:43,405 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#false} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {33#false} is VALID [2020-07-08 12:45:43,405 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {33#false} is VALID [2020-07-08 12:45:43,406 INFO L263 TraceCheckUtils]: 10: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); {33#false} is VALID [2020-07-08 12:45:43,406 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-08 12:45:43,407 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-08 12:45:43,407 INFO L280 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-08 12:45:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:43,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105721428] [2020-07-08 12:45:43,412 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:45:43,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530289610] [2020-07-08 12:45:43,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:43,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:45:43,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647253140] [2020-07-08 12:45:43,425 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-08 12:45:43,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:43,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:45:43,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:43,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:45:43,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:43,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:45:43,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:45:43,514 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-07-08 12:45:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:43,644 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2020-07-08 12:45:43,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:45:43,645 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-08 12:45:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:45:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2020-07-08 12:45:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:45:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2020-07-08 12:45:43,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2020-07-08 12:45:43,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:43,800 INFO L225 Difference]: With dead ends: 52 [2020-07-08 12:45:43,800 INFO L226 Difference]: Without dead ends: 24 [2020-07-08 12:45:43,805 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:45:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-08 12:45:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-08 12:45:43,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:43,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-08 12:45:43,857 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 12:45:43,857 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 12:45:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:43,862 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-08 12:45:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-08 12:45:43,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:43,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:43,864 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 12:45:43,864 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 12:45:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:43,869 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-08 12:45:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-08 12:45:43,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:43,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:43,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:43,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:45:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-08 12:45:43,876 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2020-07-08 12:45:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:43,877 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-08 12:45:43,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:45:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-08 12:45:43,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:45:43,878 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:43,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:44,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-08 12:45:44,093 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash 739661195, now seen corresponding path program 1 times [2020-07-08 12:45:44,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:44,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038671540] [2020-07-08 12:45:44,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:44,111 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:45:44,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371233400] [2020-07-08 12:45:44,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:44,167 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:45:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:44,190 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:44,286 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2020-07-08 12:45:44,286 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {225#true} is VALID [2020-07-08 12:45:44,287 INFO L280 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-08 12:45:44,287 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #78#return; {225#true} is VALID [2020-07-08 12:45:44,287 INFO L263 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret11 := main(); {225#true} is VALID [2020-07-08 12:45:44,290 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#true} ~N_LIN~0 := #t~nondet0;havoc #t~nondet0;~N_COL~0 := #t~nondet1;havoc #t~nondet1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {245#(= 0 main_~j~0)} is VALID [2020-07-08 12:45:44,292 INFO L280 TraceCheckUtils]: 6: Hoare triple {245#(= 0 main_~j~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {249#(<= (mod main_~N_COL~0 4294967296) 0)} is VALID [2020-07-08 12:45:44,292 INFO L280 TraceCheckUtils]: 7: Hoare triple {249#(<= (mod main_~N_COL~0 4294967296) 0)} ~j~0 := 0; {249#(<= (mod main_~N_COL~0 4294967296) 0)} is VALID [2020-07-08 12:45:44,297 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#(<= (mod main_~N_COL~0 4294967296) 0)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {226#false} is VALID [2020-07-08 12:45:44,298 INFO L280 TraceCheckUtils]: 9: Hoare triple {226#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {226#false} is VALID [2020-07-08 12:45:44,298 INFO L263 TraceCheckUtils]: 10: Hoare triple {226#false} call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); {226#false} is VALID [2020-07-08 12:45:44,298 INFO L280 TraceCheckUtils]: 11: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2020-07-08 12:45:44,299 INFO L280 TraceCheckUtils]: 12: Hoare triple {226#false} assume 0 == ~cond; {226#false} is VALID [2020-07-08 12:45:44,299 INFO L280 TraceCheckUtils]: 13: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-08 12:45:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:44,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038671540] [2020-07-08 12:45:44,301 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:45:44,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371233400] [2020-07-08 12:45:44,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:44,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:45:44,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850407789] [2020-07-08 12:45:44,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-08 12:45:44,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:44,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:45:44,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:44,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:45:44,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:44,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:45:44,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:45:44,332 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 4 states. [2020-07-08 12:45:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:44,559 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-08 12:45:44,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:45:44,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-08 12:45:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:45:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2020-07-08 12:45:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:45:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2020-07-08 12:45:44,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2020-07-08 12:45:44,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:44,671 INFO L225 Difference]: With dead ends: 49 [2020-07-08 12:45:44,671 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:45:44,673 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:44,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:45:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2020-07-08 12:45:44,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:44,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 25 states. [2020-07-08 12:45:44,696 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 25 states. [2020-07-08 12:45:44,696 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 25 states. [2020-07-08 12:45:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:44,705 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-07-08 12:45:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2020-07-08 12:45:44,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:44,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:44,708 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 35 states. [2020-07-08 12:45:44,708 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 35 states. [2020-07-08 12:45:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:44,720 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-07-08 12:45:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2020-07-08 12:45:44,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:44,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:44,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:44,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 12:45:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-08 12:45:44,731 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2020-07-08 12:45:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:44,732 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-08 12:45:44,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:45:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-08 12:45:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 12:45:44,733 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:44,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:44,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:44,934 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1656958391, now seen corresponding path program 1 times [2020-07-08 12:45:44,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:44,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4731493] [2020-07-08 12:45:44,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:44,960 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:45:44,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [786227361] [2020-07-08 12:45:44,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:45,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:45:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:45,011 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:45,057 INFO L263 TraceCheckUtils]: 0: Hoare triple {447#true} call ULTIMATE.init(); {447#true} is VALID [2020-07-08 12:45:45,057 INFO L280 TraceCheckUtils]: 1: Hoare triple {447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {447#true} is VALID [2020-07-08 12:45:45,058 INFO L280 TraceCheckUtils]: 2: Hoare triple {447#true} assume true; {447#true} is VALID [2020-07-08 12:45:45,058 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {447#true} {447#true} #78#return; {447#true} is VALID [2020-07-08 12:45:45,058 INFO L263 TraceCheckUtils]: 4: Hoare triple {447#true} call #t~ret11 := main(); {447#true} is VALID [2020-07-08 12:45:45,059 INFO L280 TraceCheckUtils]: 5: Hoare triple {447#true} ~N_LIN~0 := #t~nondet0;havoc #t~nondet0;~N_COL~0 := #t~nondet1;havoc #t~nondet1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {447#true} is VALID [2020-07-08 12:45:45,060 INFO L280 TraceCheckUtils]: 6: Hoare triple {447#true} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {470#(= 0 main_~k~0)} is VALID [2020-07-08 12:45:45,061 INFO L280 TraceCheckUtils]: 7: Hoare triple {470#(= 0 main_~k~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {474#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2020-07-08 12:45:45,061 INFO L280 TraceCheckUtils]: 8: Hoare triple {474#(<= (mod main_~N_LIN~0 4294967296) 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {474#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2020-07-08 12:45:45,062 INFO L280 TraceCheckUtils]: 9: Hoare triple {474#(<= (mod main_~N_LIN~0 4294967296) 0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {474#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2020-07-08 12:45:45,063 INFO L280 TraceCheckUtils]: 10: Hoare triple {474#(<= (mod main_~N_LIN~0 4294967296) 0)} ~j~0 := 0; {474#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2020-07-08 12:45:45,064 INFO L280 TraceCheckUtils]: 11: Hoare triple {474#(<= (mod main_~N_LIN~0 4294967296) 0)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {474#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2020-07-08 12:45:45,065 INFO L280 TraceCheckUtils]: 12: Hoare triple {474#(<= (mod main_~N_LIN~0 4294967296) 0)} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {448#false} is VALID [2020-07-08 12:45:45,066 INFO L263 TraceCheckUtils]: 13: Hoare triple {448#false} call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); {448#false} is VALID [2020-07-08 12:45:45,066 INFO L280 TraceCheckUtils]: 14: Hoare triple {448#false} ~cond := #in~cond; {448#false} is VALID [2020-07-08 12:45:45,066 INFO L280 TraceCheckUtils]: 15: Hoare triple {448#false} assume 0 == ~cond; {448#false} is VALID [2020-07-08 12:45:45,067 INFO L280 TraceCheckUtils]: 16: Hoare triple {448#false} assume !false; {448#false} is VALID [2020-07-08 12:45:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:45,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4731493] [2020-07-08 12:45:45,069 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:45:45,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786227361] [2020-07-08 12:45:45,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:45,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:45:45,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327503471] [2020-07-08 12:45:45,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-08 12:45:45,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:45,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:45:45,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:45,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:45:45,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:45,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:45:45,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:45:45,096 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 4 states. [2020-07-08 12:45:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:45,356 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2020-07-08 12:45:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:45:45,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-08 12:45:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:45:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2020-07-08 12:45:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:45:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2020-07-08 12:45:45,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2020-07-08 12:45:45,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:45,511 INFO L225 Difference]: With dead ends: 57 [2020-07-08 12:45:45,512 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 12:45:45,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 12:45:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2020-07-08 12:45:45,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:45,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 27 states. [2020-07-08 12:45:45,526 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 27 states. [2020-07-08 12:45:45,526 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 27 states. [2020-07-08 12:45:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:45,529 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-08 12:45:45,530 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-08 12:45:45,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:45,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:45,531 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 32 states. [2020-07-08 12:45:45,531 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 32 states. [2020-07-08 12:45:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:45,534 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-08 12:45:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-08 12:45:45,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:45,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:45,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:45,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:45:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-07-08 12:45:45,538 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2020-07-08 12:45:45,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:45,539 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-08 12:45:45,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:45:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-08 12:45:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:45:45,540 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:45,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:45,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:45,756 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:45,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:45,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1471852900, now seen corresponding path program 1 times [2020-07-08 12:45:45,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:45,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718143636] [2020-07-08 12:45:45,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:45,778 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:45:45,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1963748267] [2020-07-08 12:45:45,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:45,900 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:45:45,901 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:45:46,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:46,153 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:45:46,153 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:46,153 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:46,153 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:45:46,154 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:45:46,154 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:45:46,154 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:46,154 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:46,154 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 12:45:46,154 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 12:45:46,155 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 12:45:46,155 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:45:46,155 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:45:46,155 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:45:46,155 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:45:46,155 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2020-07-08 12:45:46,155 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-08 12:45:46,155 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-08 12:45:46,156 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-08 12:45:46,156 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:45:46,156 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:45:46,156 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:45:46,156 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-08 12:45:46,156 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-08 12:45:46,157 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-08 12:45:46,157 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 12:45:46,157 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-08 12:45:46,157 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-08 12:45:46,157 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:45:46,157 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-08 12:45:46,157 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:45:46,157 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:45:46,158 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:45:46,158 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-08 12:45:46,158 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-08 12:45:46,158 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:45:46,158 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-08 12:45:46,158 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 12:45:46,158 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 12:45:46,159 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 12:45:46,159 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:45:46,159 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:45:46,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:45:46 BoogieIcfgContainer [2020-07-08 12:45:46,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:45:46,165 INFO L168 Benchmark]: Toolchain (without parser) took 4216.33 ms. Allocated memory was 145.8 MB in the beginning and 243.8 MB in the end (delta: 98.0 MB). Free memory was 102.1 MB in the beginning and 200.7 MB in the end (delta: -98.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:45:46,166 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-08 12:45:46,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.41 ms. Allocated memory is still 145.8 MB. Free memory was 101.7 MB in the beginning and 90.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:46,168 INFO L168 Benchmark]: Boogie Preprocessor took 148.70 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 90.9 MB in the beginning and 180.1 MB in the end (delta: -89.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:46,169 INFO L168 Benchmark]: RCFGBuilder took 618.27 ms. Allocated memory is still 202.9 MB. Free memory was 180.1 MB in the beginning and 154.2 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:46,169 INFO L168 Benchmark]: TraceAbstraction took 3121.32 ms. Allocated memory was 202.9 MB in the beginning and 243.8 MB in the end (delta: 40.9 MB). Free memory was 153.5 MB in the beginning and 200.7 MB in the end (delta: -47.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:45:46,173 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.41 ms. Allocated memory is still 145.8 MB. Free memory was 101.7 MB in the beginning and 90.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.70 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 90.9 MB in the beginning and 180.1 MB in the end (delta: -89.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 618.27 ms. Allocated memory is still 202.9 MB. Free memory was 180.1 MB in the beginning and 154.2 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3121.32 ms. Allocated memory was 202.9 MB in the beginning and 243.8 MB in the end (delta: 40.9 MB). Free memory was 153.5 MB in the beginning and 200.7 MB in the end (delta: -47.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] unsigned int N_LIN=__VERIFIER_nondet_uint(); [L15] unsigned int N_COL=__VERIFIER_nondet_uint(); [L16] unsigned int j,k; [L17] int matriz[N_COL][N_LIN], maior; [L19] maior = __VERIFIER_nondet_int() [L20] j=0 VAL [j=0, maior=-1, matriz={2:0}, N_COL=1, N_LIN=1] [L20] COND TRUE jmaior [L26] EXPR matriz[j][k] [L26] maior = matriz[j][k] [L21] k++ VAL [j=0, k=1, maior=0, matriz={2:0}, N_COL=1, N_LIN=1] [L21] COND FALSE !(k