/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/BallRajamani-SPIN2000-Fig1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:33:47,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:33:47,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:33:47,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:33:47,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:33:47,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:33:47,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:33:47,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:33:47,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:33:47,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:33:47,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:33:47,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:33:47,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:33:47,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:33:47,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:33:47,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:33:47,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:33:47,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:33:47,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:33:47,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:33:47,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:33:47,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:33:47,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:33:47,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:33:47,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:33:47,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:33:47,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:33:47,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:33:47,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:33:47,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:33:47,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:33:47,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:33:47,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:33:47,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:33:47,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:33:47,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:33:47,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:33:47,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:33:47,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:33:47,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:33:47,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:33:47,697 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:33:47,707 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:33:47,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:33:47,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:33:47,708 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:33:47,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:33:47,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:33:47,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:33:47,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:33:47,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:33:47,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:33:47,710 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:33:47,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:33:47,710 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:33:47,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:33:47,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:33:47,711 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:33:47,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:33:47,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:33:47,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:47,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:33:47,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:33:47,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:33:47,712 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:33:48,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:33:48,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:33:48,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:33:48,019 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:33:48,019 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:33:48,020 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/BallRajamani-SPIN2000-Fig1.c [2020-07-11 00:33:48,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7c66d9e/795e9ff7aa4f4d5987e2df86d95b0e03/FLAGe84a0aa7f [2020-07-11 00:33:48,547 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:48,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/BallRajamani-SPIN2000-Fig1.c [2020-07-11 00:33:48,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7c66d9e/795e9ff7aa4f4d5987e2df86d95b0e03/FLAGe84a0aa7f [2020-07-11 00:33:48,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7c66d9e/795e9ff7aa4f4d5987e2df86d95b0e03 [2020-07-11 00:33:48,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:48,966 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:48,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:48,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:48,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:48,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe1278f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48, skipping insertion in model container [2020-07-11 00:33:48,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:49,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:49,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:49,209 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:49,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:49,244 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:49,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:49 WrapperNode [2020-07-11 00:33:49,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:49,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:49,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:49,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:49,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:49" (1/1) ... [2020-07-11 00:33:49,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:49" (1/1) ... [2020-07-11 00:33:49,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:49" (1/1) ... [2020-07-11 00:33:49,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:49" (1/1) ... [2020-07-11 00:33:49,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:49" (1/1) ... [2020-07-11 00:33:49,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:49" (1/1) ... [2020-07-11 00:33:49,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:49" (1/1) ... [2020-07-11 00:33:49,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:49,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:49,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:49,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:49,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:49" (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-11 00:33:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure A [2020-07-11 00:33:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:33:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure A [2020-07-11 00:33:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:49,707 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:49,708 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:33:49,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:49 BoogieIcfgContainer [2020-07-11 00:33:49,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:49,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:49,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:49,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:49,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:48" (1/3) ... [2020-07-11 00:33:49,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88ec43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:49, skipping insertion in model container [2020-07-11 00:33:49,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:49" (2/3) ... [2020-07-11 00:33:49,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88ec43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:49, skipping insertion in model container [2020-07-11 00:33:49,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:49" (3/3) ... [2020-07-11 00:33:49,723 INFO L109 eAbstractionObserver]: Analyzing ICFG BallRajamani-SPIN2000-Fig1.c [2020-07-11 00:33:49,738 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:49,747 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:49,766 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:33:49,793 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:33:49,793 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:33:49,793 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:33:49,794 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:33:49,794 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:33:49,794 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:33:49,794 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:33:49,794 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:33:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-11 00:33:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-11 00:33:49,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:49,857 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:49,858 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:49,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:49,866 INFO L82 PathProgramCache]: Analyzing trace with hash 31169137, now seen corresponding path program 1 times [2020-07-11 00:33:49,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:49,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1539030963] [2020-07-11 00:33:49,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:50,160 INFO L280 TraceCheckUtils]: 0: Hoare triple {52#(= ~g~0 |old(~g~0)|)} ~g~0 := 0; {34#true} is VALID [2020-07-11 00:33:50,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-11 00:33:50,161 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #41#return; {34#true} is VALID [2020-07-11 00:33:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:50,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {52#(= ~g~0 |old(~g~0)|)} ~a1 := #in~a1; {53#(= A_~a1 |A_#in~a1|)} is VALID [2020-07-11 00:33:50,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {53#(= A_~a1 |A_#in~a1|)} ~a2 := #in~a2; {53#(= A_~a1 |A_#in~a1|)} is VALID [2020-07-11 00:33:50,223 INFO L280 TraceCheckUtils]: 2: Hoare triple {53#(= A_~a1 |A_#in~a1|)} assume !(0 != ~a1); {54#(= 0 |A_#in~a1|)} is VALID [2020-07-11 00:33:50,224 INFO L280 TraceCheckUtils]: 3: Hoare triple {54#(= 0 |A_#in~a1|)} ~g~0 := ~a2; {54#(= 0 |A_#in~a1|)} is VALID [2020-07-11 00:33:50,225 INFO L280 TraceCheckUtils]: 4: Hoare triple {54#(= 0 |A_#in~a1|)} assume true; {54#(= 0 |A_#in~a1|)} is VALID [2020-07-11 00:33:50,227 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {54#(= 0 |A_#in~a1|)} {34#true} #45#return; {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} is VALID [2020-07-11 00:33:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:50,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {52#(= ~g~0 |old(~g~0)|)} ~a1 := #in~a1; {34#true} is VALID [2020-07-11 00:33:50,253 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#true} ~a2 := #in~a2; {34#true} is VALID [2020-07-11 00:33:50,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#true} assume !(0 != ~a1); {34#true} is VALID [2020-07-11 00:33:50,254 INFO L280 TraceCheckUtils]: 3: Hoare triple {34#true} ~g~0 := ~a2; {34#true} is VALID [2020-07-11 00:33:50,254 INFO L280 TraceCheckUtils]: 4: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-11 00:33:50,256 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {34#true} {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} #47#return; {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} is VALID [2020-07-11 00:33:50,258 INFO L263 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {52#(= ~g~0 |old(~g~0)|)} is VALID [2020-07-11 00:33:50,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {52#(= ~g~0 |old(~g~0)|)} ~g~0 := 0; {34#true} is VALID [2020-07-11 00:33:50,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-11 00:33:50,260 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #41#return; {34#true} is VALID [2020-07-11 00:33:50,260 INFO L263 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret4 := main(); {34#true} is VALID [2020-07-11 00:33:50,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {34#true} is VALID [2020-07-11 00:33:50,261 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#true} ~g~1 := #t~nondet1; {34#true} is VALID [2020-07-11 00:33:50,262 INFO L280 TraceCheckUtils]: 7: Hoare triple {34#true} havoc #t~nondet1; {34#true} is VALID [2020-07-11 00:33:50,262 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#true} ~h~0 := (if 0 == ~g~1 then 1 else 0); {34#true} is VALID [2020-07-11 00:33:50,264 INFO L263 TraceCheckUtils]: 9: Hoare triple {34#true} call #t~ret2 := A(~g~1, ~h~0); {52#(= ~g~0 |old(~g~0)|)} is VALID [2020-07-11 00:33:50,266 INFO L280 TraceCheckUtils]: 10: Hoare triple {52#(= ~g~0 |old(~g~0)|)} ~a1 := #in~a1; {53#(= A_~a1 |A_#in~a1|)} is VALID [2020-07-11 00:33:50,268 INFO L280 TraceCheckUtils]: 11: Hoare triple {53#(= A_~a1 |A_#in~a1|)} ~a2 := #in~a2; {53#(= A_~a1 |A_#in~a1|)} is VALID [2020-07-11 00:33:50,269 INFO L280 TraceCheckUtils]: 12: Hoare triple {53#(= A_~a1 |A_#in~a1|)} assume !(0 != ~a1); {54#(= 0 |A_#in~a1|)} is VALID [2020-07-11 00:33:50,271 INFO L280 TraceCheckUtils]: 13: Hoare triple {54#(= 0 |A_#in~a1|)} ~g~0 := ~a2; {54#(= 0 |A_#in~a1|)} is VALID [2020-07-11 00:33:50,273 INFO L280 TraceCheckUtils]: 14: Hoare triple {54#(= 0 |A_#in~a1|)} assume true; {54#(= 0 |A_#in~a1|)} is VALID [2020-07-11 00:33:50,275 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {54#(= 0 |A_#in~a1|)} {34#true} #45#return; {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} is VALID [2020-07-11 00:33:50,277 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} is VALID [2020-07-11 00:33:50,279 INFO L280 TraceCheckUtils]: 17: Hoare triple {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} havoc #t~ret2; {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} is VALID [2020-07-11 00:33:50,281 INFO L263 TraceCheckUtils]: 18: Hoare triple {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} call #t~ret3 := A(~g~1, ~h~0); {52#(= ~g~0 |old(~g~0)|)} is VALID [2020-07-11 00:33:50,282 INFO L280 TraceCheckUtils]: 19: Hoare triple {52#(= ~g~0 |old(~g~0)|)} ~a1 := #in~a1; {34#true} is VALID [2020-07-11 00:33:50,282 INFO L280 TraceCheckUtils]: 20: Hoare triple {34#true} ~a2 := #in~a2; {34#true} is VALID [2020-07-11 00:33:50,282 INFO L280 TraceCheckUtils]: 21: Hoare triple {34#true} assume !(0 != ~a1); {34#true} is VALID [2020-07-11 00:33:50,283 INFO L280 TraceCheckUtils]: 22: Hoare triple {34#true} ~g~0 := ~a2; {34#true} is VALID [2020-07-11 00:33:50,283 INFO L280 TraceCheckUtils]: 23: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-11 00:33:50,285 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {34#true} {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} #47#return; {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} is VALID [2020-07-11 00:33:50,287 INFO L280 TraceCheckUtils]: 25: Hoare triple {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} is VALID [2020-07-11 00:33:50,289 INFO L280 TraceCheckUtils]: 26: Hoare triple {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} havoc #t~ret3; {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} is VALID [2020-07-11 00:33:50,291 INFO L280 TraceCheckUtils]: 27: Hoare triple {45#(and (<= main_~g~1 0) (<= 0 main_~g~1))} assume 0 != ~g~1; {35#false} is VALID [2020-07-11 00:33:50,292 INFO L280 TraceCheckUtils]: 28: Hoare triple {35#false} assume !false; {35#false} is VALID [2020-07-11 00:33:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 00:33:50,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1539030963] [2020-07-11 00:33:50,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:33:50,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 00:33:50,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751290347] [2020-07-11 00:33:50,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-11 00:33:50,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:50,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:33:50,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:50,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:33:50,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:50,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:33:50,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:50,388 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 6 states. [2020-07-11 00:33:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:50,865 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2020-07-11 00:33:50,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 00:33:50,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-11 00:33:50,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-11 00:33:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-11 00:33:50,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2020-07-11 00:33:50,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:51,004 INFO L225 Difference]: With dead ends: 60 [2020-07-11 00:33:51,005 INFO L226 Difference]: Without dead ends: 29 [2020-07-11 00:33:51,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:33:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-11 00:33:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-11 00:33:51,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:51,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-11 00:33:51,096 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-11 00:33:51,097 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-11 00:33:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:51,102 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-11 00:33:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-11 00:33:51,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:51,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:51,104 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-11 00:33:51,104 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-11 00:33:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:51,109 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-11 00:33:51,109 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-11 00:33:51,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:51,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:51,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:51,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-11 00:33:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-11 00:33:51,116 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2020-07-11 00:33:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:51,117 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-11 00:33:51,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:51,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2020-07-11 00:33:51,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-11 00:33:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-11 00:33:51,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:51,160 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:51,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:33:51,162 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:51,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:51,162 INFO L82 PathProgramCache]: Analyzing trace with hash 812451921, now seen corresponding path program 1 times [2020-07-11 00:33:51,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:51,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [732639056] [2020-07-11 00:33:51,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:51,255 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 00:33:51,255 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 00:33:51,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:51,309 WARN L170 areAnnotationChecker]: AENTRY has no Hoare annotation [2020-07-11 00:33:51,310 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 00:33:51,310 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:33:51,310 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:33:51,310 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 00:33:51,310 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-11 00:33:51,310 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 00:33:51,311 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:33:51,311 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:33:51,311 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-11 00:33:51,312 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 00:33:51,312 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 00:33:51,312 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 00:33:51,312 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 00:33:51,313 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-11 00:33:51,313 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-11 00:33:51,313 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-11 00:33:51,313 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-11 00:33:51,313 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 00:33:51,313 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-11 00:33:51,313 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-11 00:33:51,314 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-11 00:33:51,314 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-11 00:33:51,314 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-11 00:33:51,314 WARN L170 areAnnotationChecker]: AEXIT has no Hoare annotation [2020-07-11 00:33:51,314 WARN L170 areAnnotationChecker]: AEXIT has no Hoare annotation [2020-07-11 00:33:51,314 WARN L170 areAnnotationChecker]: AEXIT has no Hoare annotation [2020-07-11 00:33:51,315 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-11 00:33:51,315 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-11 00:33:51,315 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-11 00:33:51,315 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-11 00:33:51,315 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 00:33:51,315 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 00:33:51,316 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-11 00:33:51,316 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-11 00:33:51,316 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-11 00:33:51,316 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-11 00:33:51,316 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-11 00:33:51,317 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 00:33:51,317 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-11 00:33:51,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:33:51 BoogieIcfgContainer [2020-07-11 00:33:51,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:33:51,331 INFO L168 Benchmark]: Toolchain (without parser) took 2364.11 ms. Allocated memory was 144.7 MB in the beginning and 235.4 MB in the end (delta: 90.7 MB). Free memory was 101.1 MB in the beginning and 145.1 MB in the end (delta: -44.0 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:51,332 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 144.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 00:33:51,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.08 ms. Allocated memory is still 144.7 MB. Free memory was 100.9 MB in the beginning and 91.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:51,334 INFO L168 Benchmark]: Boogie Preprocessor took 31.63 ms. Allocated memory is still 144.7 MB. Free memory was 91.3 MB in the beginning and 90.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:51,336 INFO L168 Benchmark]: RCFGBuilder took 436.66 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 89.8 MB in the beginning and 165.2 MB in the end (delta: -75.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:51,338 INFO L168 Benchmark]: TraceAbstraction took 1609.98 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 164.5 MB in the beginning and 145.1 MB in the end (delta: 19.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:51,351 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.30 ms. Allocated memory is still 144.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.08 ms. Allocated memory is still 144.7 MB. Free memory was 100.9 MB in the beginning and 91.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.63 ms. Allocated memory is still 144.7 MB. Free memory was 91.3 MB in the beginning and 90.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 436.66 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 89.8 MB in the beginning and 165.2 MB in the end (delta: -75.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1609.98 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 164.5 MB in the beginning and 145.1 MB in the end (delta: 19.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int g; VAL [\old(g)=4, g=0] [L26] int g = __VERIFIER_nondet_int(); VAL [\old(g)=0, __VERIFIER_nondet_int()=3, g=3, g=0] [L27] int h = !g; VAL [\old(g)=0, g=3, g=0, h=0] [L28] CALL A(g,h) VAL [\old(a1)=3, \old(a2)=0, \old(g)=0, g=0] [L17] COND TRUE \read(a1) VAL [\old(a1)=3, \old(a2)=0, \old(g)=0, a1=3, a2=0, g=0] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=3, \old(g)=0, g=0] [L17] COND FALSE !(\read(a1)) VAL [\old(a1)=0, \old(a2)=3, \old(g)=0, a1=0, a2=3, g=0] [L20] g = a2 VAL [\old(a1)=0, \old(a2)=3, \old(g)=0, a1=0, a2=3, g=3] [L18] RET A(a2,a1) VAL [\old(a1)=3, \old(a2)=0, \old(g)=0, A(a2,a1)=1, a1=3, a2=0, g=3] [L28] RET A(g,h) VAL [\old(g)=0, A(g,h)=-1, g=3, g=3, h=0] [L29] CALL A(g,h) VAL [\old(a1)=3, \old(a2)=0, \old(g)=3, g=3] [L17] COND TRUE \read(a1) VAL [\old(a1)=3, \old(a2)=0, \old(g)=3, a1=3, a2=0, g=3] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=3, \old(g)=3, g=3] [L17] COND FALSE !(\read(a1)) VAL [\old(a1)=0, \old(a2)=3, \old(g)=3, a1=0, a2=3, g=3] [L20] g = a2 VAL [\old(a1)=0, \old(a2)=3, \old(g)=3, a1=0, a2=3, g=3] [L18] RET A(a2,a1) VAL [\old(a1)=3, \old(a2)=0, \old(g)=3, A(a2,a1)=2, a1=3, a2=0, g=3] [L29] RET A(g,h) VAL [\old(g)=0, A(g,h)=-2, g=3, g=3, h=0] [L30] COND TRUE \read(g) VAL [\old(g)=0, g=3, g=3, h=0] [L31] __VERIFIER_error() VAL [\old(g)=0, g=3, g=3, h=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 4, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28 SDtfs, 19 SDslu, 77 SDs, 0 SdLazy, 44 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 2240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 0 PerfectInterpolantSequences, 1/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...