/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_b3_o2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:14:24,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:14:24,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:14:24,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:14:24,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:14:24,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:14:24,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:14:24,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:14:24,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:14:24,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:14:24,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:14:24,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:14:24,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:14:24,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:14:24,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:14:24,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:14:24,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:14:24,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:14:24,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:14:24,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:14:24,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:14:24,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:14:24,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:14:24,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:14:24,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:14:24,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:14:24,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:14:24,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:14:24,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:14:24,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:14:24,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:14:24,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:14:24,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:14:24,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:14:24,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:14:24,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:14:24,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:14:24,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:14:24,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:14:24,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:14:24,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:14:24,444 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:14:24,453 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:14:24,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:14:24,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:14:24,457 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:14:24,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:14:24,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:14:24,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:14:24,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:14:24,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:14:24,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:14:24,458 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:14:24,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:14:24,458 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:14:24,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:14:24,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:14:24,459 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:14:24,459 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:14:24,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:14:24,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:14:24,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:14:24,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:14:24,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:14:24,462 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:14:24,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:14:24,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:14:24,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:14:24,772 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:14:24,772 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:14:24,773 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b3_o2-2.c [2020-07-18 00:14:24,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178163e5d/ecb13b0f1dc5464296c59277bfb7d6c7/FLAGfbc3f98d1 [2020-07-18 00:14:25,291 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:14:25,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b3_o2-2.c [2020-07-18 00:14:25,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178163e5d/ecb13b0f1dc5464296c59277bfb7d6c7/FLAGfbc3f98d1 [2020-07-18 00:14:25,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178163e5d/ecb13b0f1dc5464296c59277bfb7d6c7 [2020-07-18 00:14:25,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:14:25,727 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:14:25,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:25,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:14:25,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:14:25,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:25" (1/1) ... [2020-07-18 00:14:25,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@febc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:25, skipping insertion in model container [2020-07-18 00:14:25,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:25" (1/1) ... [2020-07-18 00:14:25,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:14:25,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:14:25,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:25,986 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:14:26,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:26,019 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:14:26,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26 WrapperNode [2020-07-18 00:14:26,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:26,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:14:26,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:14:26,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:14:26,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26" (1/1) ... [2020-07-18 00:14:26,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26" (1/1) ... [2020-07-18 00:14:26,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26" (1/1) ... [2020-07-18 00:14:26,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26" (1/1) ... [2020-07-18 00:14:26,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26" (1/1) ... [2020-07-18 00:14:26,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26" (1/1) ... [2020-07-18 00:14:26,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26" (1/1) ... [2020-07-18 00:14:26,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:14:26,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:14:26,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:14:26,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:14:26,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26" (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-18 00:14:26,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:14:26,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:14:26,203 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-18 00:14:26,203 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:14:26,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:14:26,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:14:26,203 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-18 00:14:26,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:14:26,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:14:26,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:14:26,586 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:14:26,586 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:14:26,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:26 BoogieIcfgContainer [2020-07-18 00:14:26,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:14:26,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:14:26,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:14:26,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:14:26,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:14:25" (1/3) ... [2020-07-18 00:14:26,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53994c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:26, skipping insertion in model container [2020-07-18 00:14:26,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26" (2/3) ... [2020-07-18 00:14:26,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53994c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:26, skipping insertion in model container [2020-07-18 00:14:26,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:26" (3/3) ... [2020-07-18 00:14:26,598 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o2-2.c [2020-07-18 00:14:26,609 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:14:26,616 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:14:26,629 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:14:26,650 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:14:26,650 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:14:26,650 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:14:26,650 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:14:26,651 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:14:26,651 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:14:26,651 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:14:26,651 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:14:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-18 00:14:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 00:14:26,674 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:26,675 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:26,675 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:26,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:26,681 INFO L82 PathProgramCache]: Analyzing trace with hash 856871792, now seen corresponding path program 1 times [2020-07-18 00:14:26,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:26,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [108956879] [2020-07-18 00:14:26,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:26,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 00:14:26,921 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-18 00:14:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:26,966 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-18 00:14:26,967 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-18 00:14:26,968 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:26,970 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:26,972 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-18 00:14:26,973 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-18 00:14:26,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 00:14:26,974 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-18 00:14:26,975 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-18 00:14:26,975 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33#true} is VALID [2020-07-18 00:14:26,975 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~input~0 := #t~nondet1; {33#true} is VALID [2020-07-18 00:14:26,976 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc #t~nondet1; {33#true} is VALID [2020-07-18 00:14:26,976 INFO L263 TraceCheckUtils]: 7: Hoare triple {33#true} call #t~ret2 := id(~input~0); {33#true} is VALID [2020-07-18 00:14:26,977 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-18 00:14:26,977 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-18 00:14:26,979 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:26,982 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:26,985 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-18 00:14:26,987 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#(<= |main_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-18 00:14:26,989 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#(<= |main_#t~ret2| 0)} ~result~0 := #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-18 00:14:26,990 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#(<= main_~result~0 0)} havoc #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-18 00:14:26,993 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= main_~result~0 0)} assume 2 == ~result~0; {34#false} is VALID [2020-07-18 00:14:26,994 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-18 00:14:26,996 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-18 00:14:27,008 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:27,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [108956879] [2020-07-18 00:14:27,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:27,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:14:27,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730467414] [2020-07-18 00:14:27,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 00:14:27,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:27,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:14:27,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:27,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:14:27,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:27,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:14:27,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:14:27,080 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-07-18 00:14:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:27,395 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-18 00:14:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:14:27,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 00:14:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:27,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-18 00:14:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:27,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-18 00:14:27,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2020-07-18 00:14:27,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:27,504 INFO L225 Difference]: With dead ends: 44 [2020-07-18 00:14:27,504 INFO L226 Difference]: Without dead ends: 28 [2020-07-18 00:14:27,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:14:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-18 00:14:27,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-18 00:14:27,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:27,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,570 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,570 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:27,577 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-18 00:14:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 00:14:27,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:27,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:27,579 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,579 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:27,584 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-18 00:14:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 00:14:27,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:27,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:27,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:27,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 00:14:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-18 00:14:27,592 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2020-07-18 00:14:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:27,593 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-18 00:14:27,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:14:27,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-18 00:14:27,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 00:14:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 00:14:27,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:27,654 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:27,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:14:27,655 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:27,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609951, now seen corresponding path program 1 times [2020-07-18 00:14:27,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:27,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517771233] [2020-07-18 00:14:27,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:27,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-18 00:14:27,949 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-18 00:14:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:27,990 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 00:14:27,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-18 00:14:27,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {249#true} #res := 0; {261#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:27,993 INFO L280 TraceCheckUtils]: 3: Hoare triple {261#(= 0 |id_#res|)} [47] idFINAL-->idEXIT_primed: Formula: (let ((.cse8 (* 2 |v_oct_id_#res_out_1|)) (.cse5 (* 2 v_oct_id_~ret~0_out_1)) (.cse6 (* 2 |v_oct_id_#res_in_1|))) (let ((.cse3 (<= 6 .cse6)) (.cse4 (<= .cse5 8)) (.cse0 (<= .cse8 6)) (.cse1 (<= 6 .cse8)) (.cse2 (<= 8 .cse5))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 (+ .cse5 4294967294)) (<= .cse6 4294967294) (<= .cse5 4294967296)) (and (<= .cse5 4294967296) (<= .cse6 4294967294) (<= 0 (+ .cse5 4294967294)) .cse0 .cse1 .cse2 .cse3 .cse4) (let ((.cse7 (+ |v_oct_id_#res_in_1| 1))) (and (<= v_oct_id_~ret~0_out_1 .cse7) (<= .cse7 v_oct_id_~ret~0_out_1) .cse0 .cse1 .cse2 (<= .cse5 4294967296)))))) InVars {id_#res=|v_oct_id_#res_in_1|} OutVars{id_#res=|v_oct_id_#res_out_1|, id_#t~ret0=|v_oct_id_#t~ret0_out_1|, id_~ret~0=v_oct_id_~ret~0_out_1} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {262#(<= 3 |id_#res|)} is VALID [2020-07-18 00:14:27,994 INFO L280 TraceCheckUtils]: 4: Hoare triple {262#(<= 3 |id_#res|)} [46] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#(<= 3 |id_#res|)} is VALID [2020-07-18 00:14:27,996 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {262#(<= 3 |id_#res|)} {249#true} #43#return; {259#(<= 3 |main_#t~ret2|)} is VALID [2020-07-18 00:14:27,997 INFO L263 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2020-07-18 00:14:27,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-18 00:14:27,998 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-18 00:14:27,998 INFO L263 TraceCheckUtils]: 3: Hoare triple {249#true} call #t~ret3 := main(); {249#true} is VALID [2020-07-18 00:14:27,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {249#true} is VALID [2020-07-18 00:14:27,999 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} ~input~0 := #t~nondet1; {249#true} is VALID [2020-07-18 00:14:27,999 INFO L280 TraceCheckUtils]: 6: Hoare triple {249#true} havoc #t~nondet1; {249#true} is VALID [2020-07-18 00:14:27,999 INFO L263 TraceCheckUtils]: 7: Hoare triple {249#true} call #t~ret2 := id(~input~0); {249#true} is VALID [2020-07-18 00:14:28,000 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 00:14:28,000 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-18 00:14:28,000 INFO L263 TraceCheckUtils]: 10: Hoare triple {249#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {249#true} is VALID [2020-07-18 00:14:28,001 INFO L280 TraceCheckUtils]: 11: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 00:14:28,001 INFO L280 TraceCheckUtils]: 12: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-18 00:14:28,002 INFO L280 TraceCheckUtils]: 13: Hoare triple {249#true} #res := 0; {261#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:28,004 INFO L280 TraceCheckUtils]: 14: Hoare triple {261#(= 0 |id_#res|)} [47] idFINAL-->idEXIT_primed: Formula: (let ((.cse8 (* 2 |v_oct_id_#res_out_1|)) (.cse5 (* 2 v_oct_id_~ret~0_out_1)) (.cse6 (* 2 |v_oct_id_#res_in_1|))) (let ((.cse3 (<= 6 .cse6)) (.cse4 (<= .cse5 8)) (.cse0 (<= .cse8 6)) (.cse1 (<= 6 .cse8)) (.cse2 (<= 8 .cse5))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 (+ .cse5 4294967294)) (<= .cse6 4294967294) (<= .cse5 4294967296)) (and (<= .cse5 4294967296) (<= .cse6 4294967294) (<= 0 (+ .cse5 4294967294)) .cse0 .cse1 .cse2 .cse3 .cse4) (let ((.cse7 (+ |v_oct_id_#res_in_1| 1))) (and (<= v_oct_id_~ret~0_out_1 .cse7) (<= .cse7 v_oct_id_~ret~0_out_1) .cse0 .cse1 .cse2 (<= .cse5 4294967296)))))) InVars {id_#res=|v_oct_id_#res_in_1|} OutVars{id_#res=|v_oct_id_#res_out_1|, id_#t~ret0=|v_oct_id_#t~ret0_out_1|, id_~ret~0=v_oct_id_~ret~0_out_1} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {262#(<= 3 |id_#res|)} is VALID [2020-07-18 00:14:28,005 INFO L280 TraceCheckUtils]: 15: Hoare triple {262#(<= 3 |id_#res|)} [46] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#(<= 3 |id_#res|)} is VALID [2020-07-18 00:14:28,006 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {262#(<= 3 |id_#res|)} {249#true} #43#return; {259#(<= 3 |main_#t~ret2|)} is VALID [2020-07-18 00:14:28,007 INFO L280 TraceCheckUtils]: 17: Hoare triple {259#(<= 3 |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {259#(<= 3 |main_#t~ret2|)} is VALID [2020-07-18 00:14:28,008 INFO L280 TraceCheckUtils]: 18: Hoare triple {259#(<= 3 |main_#t~ret2|)} ~result~0 := #t~ret2; {260#(<= 3 main_~result~0)} is VALID [2020-07-18 00:14:28,009 INFO L280 TraceCheckUtils]: 19: Hoare triple {260#(<= 3 main_~result~0)} havoc #t~ret2; {260#(<= 3 main_~result~0)} is VALID [2020-07-18 00:14:28,010 INFO L280 TraceCheckUtils]: 20: Hoare triple {260#(<= 3 main_~result~0)} assume 2 == ~result~0; {250#false} is VALID [2020-07-18 00:14:28,010 INFO L280 TraceCheckUtils]: 21: Hoare triple {250#false} assume !false; {250#false} is VALID [2020-07-18 00:14:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 00:14:28,069 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:28,070 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517771233] [2020-07-18 00:14:28,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:28,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 00:14:28,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493052497] [2020-07-18 00:14:28,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-18 00:14:28,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:28,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 00:14:28,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:28,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 00:14:28,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:28,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 00:14:28,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:14:28,106 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 9 states. [2020-07-18 00:14:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:28,454 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-18 00:14:28,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:14:28,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-18 00:14:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:14:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2020-07-18 00:14:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:14:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2020-07-18 00:14:28,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2020-07-18 00:14:28,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:28,550 INFO L225 Difference]: With dead ends: 55 [2020-07-18 00:14:28,550 INFO L226 Difference]: Without dead ends: 37 [2020-07-18 00:14:28,552 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:14:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-18 00:14:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-07-18 00:14:28,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:28,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2020-07-18 00:14:28,579 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2020-07-18 00:14:28,580 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2020-07-18 00:14:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:28,584 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-18 00:14:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-18 00:14:28,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:28,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:28,586 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2020-07-18 00:14:28,586 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2020-07-18 00:14:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:28,591 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-18 00:14:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-18 00:14:28,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:28,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:28,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:28,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:28,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-18 00:14:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2020-07-18 00:14:28,596 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 28 [2020-07-18 00:14:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:28,597 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-07-18 00:14:28,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 00:14:28,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2020-07-18 00:14:28,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-18 00:14:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 00:14:28,653 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:28,653 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:28,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:14:28,654 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:28,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:28,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1645321695, now seen corresponding path program 1 times [2020-07-18 00:14:28,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:28,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1724579504] [2020-07-18 00:14:28,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:28,770 INFO L280 TraceCheckUtils]: 0: Hoare triple {522#true} assume true; {522#true} is VALID [2020-07-18 00:14:28,771 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {522#true} {522#true} #39#return; {522#true} is VALID [2020-07-18 00:14:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:28,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {522#true} ~x := #in~x; {522#true} is VALID [2020-07-18 00:14:28,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {522#true} assume 0 == ~x; {522#true} is VALID [2020-07-18 00:14:28,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {522#true} #res := 0; {534#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:28,806 INFO L280 TraceCheckUtils]: 3: Hoare triple {534#(= 0 |id_#res|)} [49] idFINAL-->idEXIT_primed: Formula: (let ((.cse0 (+ |v_oct_id_#res_in_2| 1))) (and (<= |v_oct_id_#res_out_2| v_oct_id_~ret~0_out_2) (<= (* 2 v_oct_id_~ret~0_out_2) 6) (<= 0 (+ (* 2 |v_oct_id_#res_in_2|) 4294967296)) (<= v_oct_id_~ret~0_out_2 .cse0) (<= v_oct_id_~ret~0_out_2 |v_oct_id_#res_out_2|) (<= .cse0 v_oct_id_~ret~0_out_2))) InVars {id_#res=|v_oct_id_#res_in_2|} OutVars{id_#res=|v_oct_id_#res_out_2|, id_#t~ret0=|v_oct_id_#t~ret0_out_2|, id_~ret~0=v_oct_id_~ret~0_out_2} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {535#(<= |id_#res| 1)} is VALID [2020-07-18 00:14:28,807 INFO L280 TraceCheckUtils]: 4: Hoare triple {535#(<= |id_#res| 1)} [48] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {535#(<= |id_#res| 1)} is VALID [2020-07-18 00:14:28,808 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {535#(<= |id_#res| 1)} {522#true} #43#return; {532#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 00:14:28,808 INFO L263 TraceCheckUtils]: 0: Hoare triple {522#true} call ULTIMATE.init(); {522#true} is VALID [2020-07-18 00:14:28,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {522#true} assume true; {522#true} is VALID [2020-07-18 00:14:28,809 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {522#true} {522#true} #39#return; {522#true} is VALID [2020-07-18 00:14:28,809 INFO L263 TraceCheckUtils]: 3: Hoare triple {522#true} call #t~ret3 := main(); {522#true} is VALID [2020-07-18 00:14:28,809 INFO L280 TraceCheckUtils]: 4: Hoare triple {522#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {522#true} is VALID [2020-07-18 00:14:28,810 INFO L280 TraceCheckUtils]: 5: Hoare triple {522#true} ~input~0 := #t~nondet1; {522#true} is VALID [2020-07-18 00:14:28,810 INFO L280 TraceCheckUtils]: 6: Hoare triple {522#true} havoc #t~nondet1; {522#true} is VALID [2020-07-18 00:14:28,810 INFO L263 TraceCheckUtils]: 7: Hoare triple {522#true} call #t~ret2 := id(~input~0); {522#true} is VALID [2020-07-18 00:14:28,811 INFO L280 TraceCheckUtils]: 8: Hoare triple {522#true} ~x := #in~x; {522#true} is VALID [2020-07-18 00:14:28,811 INFO L280 TraceCheckUtils]: 9: Hoare triple {522#true} assume !(0 == ~x); {522#true} is VALID [2020-07-18 00:14:28,811 INFO L263 TraceCheckUtils]: 10: Hoare triple {522#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {522#true} is VALID [2020-07-18 00:14:28,811 INFO L280 TraceCheckUtils]: 11: Hoare triple {522#true} ~x := #in~x; {522#true} is VALID [2020-07-18 00:14:28,812 INFO L280 TraceCheckUtils]: 12: Hoare triple {522#true} assume 0 == ~x; {522#true} is VALID [2020-07-18 00:14:28,813 INFO L280 TraceCheckUtils]: 13: Hoare triple {522#true} #res := 0; {534#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:28,814 INFO L280 TraceCheckUtils]: 14: Hoare triple {534#(= 0 |id_#res|)} [49] idFINAL-->idEXIT_primed: Formula: (let ((.cse0 (+ |v_oct_id_#res_in_2| 1))) (and (<= |v_oct_id_#res_out_2| v_oct_id_~ret~0_out_2) (<= (* 2 v_oct_id_~ret~0_out_2) 6) (<= 0 (+ (* 2 |v_oct_id_#res_in_2|) 4294967296)) (<= v_oct_id_~ret~0_out_2 .cse0) (<= v_oct_id_~ret~0_out_2 |v_oct_id_#res_out_2|) (<= .cse0 v_oct_id_~ret~0_out_2))) InVars {id_#res=|v_oct_id_#res_in_2|} OutVars{id_#res=|v_oct_id_#res_out_2|, id_#t~ret0=|v_oct_id_#t~ret0_out_2|, id_~ret~0=v_oct_id_~ret~0_out_2} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {535#(<= |id_#res| 1)} is VALID [2020-07-18 00:14:28,814 INFO L280 TraceCheckUtils]: 15: Hoare triple {535#(<= |id_#res| 1)} [48] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {535#(<= |id_#res| 1)} is VALID [2020-07-18 00:14:28,815 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {535#(<= |id_#res| 1)} {522#true} #43#return; {532#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 00:14:28,816 INFO L280 TraceCheckUtils]: 17: Hoare triple {532#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {532#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 00:14:28,817 INFO L280 TraceCheckUtils]: 18: Hoare triple {532#(<= |main_#t~ret2| 1)} ~result~0 := #t~ret2; {533#(<= main_~result~0 1)} is VALID [2020-07-18 00:14:28,817 INFO L280 TraceCheckUtils]: 19: Hoare triple {533#(<= main_~result~0 1)} havoc #t~ret2; {533#(<= main_~result~0 1)} is VALID [2020-07-18 00:14:28,818 INFO L280 TraceCheckUtils]: 20: Hoare triple {533#(<= main_~result~0 1)} assume 2 == ~result~0; {523#false} is VALID [2020-07-18 00:14:28,819 INFO L280 TraceCheckUtils]: 21: Hoare triple {523#false} assume !false; {523#false} is VALID [2020-07-18 00:14:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 00:14:28,904 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:28,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1724579504] [2020-07-18 00:14:28,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:28,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 00:14:28,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130192655] [2020-07-18 00:14:28,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-18 00:14:28,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:28,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 00:14:28,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:28,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 00:14:28,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:28,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 00:14:28,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:14:28,938 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 10 states. [2020-07-18 00:14:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:29,221 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-18 00:14:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:14:29,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-18 00:14:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:14:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-18 00:14:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:14:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-18 00:14:29,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2020-07-18 00:14:29,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:29,277 INFO L225 Difference]: With dead ends: 43 [2020-07-18 00:14:29,277 INFO L226 Difference]: Without dead ends: 37 [2020-07-18 00:14:29,278 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-18 00:14:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-18 00:14:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-18 00:14:29,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:29,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2020-07-18 00:14:29,305 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2020-07-18 00:14:29,305 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2020-07-18 00:14:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:29,309 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-18 00:14:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-18 00:14:29,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:29,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:29,310 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2020-07-18 00:14:29,310 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2020-07-18 00:14:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:29,316 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-18 00:14:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-18 00:14:29,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:29,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:29,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:29,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 00:14:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-18 00:14:29,321 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2020-07-18 00:14:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:29,321 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-18 00:14:29,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 00:14:29,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-18 00:14:29,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 00:14:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 00:14:29,378 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:29,378 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:29,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:14:29,378 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:29,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:29,379 INFO L82 PathProgramCache]: Analyzing trace with hash 41013968, now seen corresponding path program 2 times [2020-07-18 00:14:29,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:29,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1988040631] [2020-07-18 00:14:29,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:29,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {774#true} assume true; {774#true} is VALID [2020-07-18 00:14:29,591 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {774#true} {774#true} #39#return; {774#true} is VALID [2020-07-18 00:14:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:29,637 INFO L280 TraceCheckUtils]: 0: Hoare triple {774#true} ~x := #in~x; {774#true} is VALID [2020-07-18 00:14:29,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {774#true} assume 0 == ~x; {774#true} is VALID [2020-07-18 00:14:29,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {774#true} #res := 0; {786#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:29,639 INFO L280 TraceCheckUtils]: 3: Hoare triple {786#(= 0 |id_#res|)} [51] idFINAL-->idEXIT_primed: Formula: (let ((.cse0 (+ |v_oct_id_#res_in_3| 1)) (.cse1 (* 2 v_oct_id_~ret~0_out_3))) (and (<= |v_oct_id_#res_out_3| v_oct_id_~ret~0_out_3) (<= v_oct_id_~ret~0_out_3 .cse0) (<= 0 (+ .cse1 4294967294)) (<= v_oct_id_~ret~0_out_3 |v_oct_id_#res_out_3|) (<= .cse0 v_oct_id_~ret~0_out_3) (<= .cse1 6))) InVars {id_#res=|v_oct_id_#res_in_3|} OutVars{id_#res=|v_oct_id_#res_out_3|, id_#t~ret0=|v_oct_id_#t~ret0_out_3|, id_~ret~0=v_oct_id_~ret~0_out_3} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {787#(<= |id_#res| 1)} is VALID [2020-07-18 00:14:29,640 INFO L280 TraceCheckUtils]: 4: Hoare triple {787#(<= |id_#res| 1)} [50] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#(<= |id_#res| 1)} is VALID [2020-07-18 00:14:29,648 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {787#(<= |id_#res| 1)} {774#true} #43#return; {784#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 00:14:29,649 INFO L263 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2020-07-18 00:14:29,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2020-07-18 00:14:29,649 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #39#return; {774#true} is VALID [2020-07-18 00:14:29,649 INFO L263 TraceCheckUtils]: 3: Hoare triple {774#true} call #t~ret3 := main(); {774#true} is VALID [2020-07-18 00:14:29,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {774#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {774#true} is VALID [2020-07-18 00:14:29,650 INFO L280 TraceCheckUtils]: 5: Hoare triple {774#true} ~input~0 := #t~nondet1; {774#true} is VALID [2020-07-18 00:14:29,650 INFO L280 TraceCheckUtils]: 6: Hoare triple {774#true} havoc #t~nondet1; {774#true} is VALID [2020-07-18 00:14:29,651 INFO L263 TraceCheckUtils]: 7: Hoare triple {774#true} call #t~ret2 := id(~input~0); {774#true} is VALID [2020-07-18 00:14:29,651 INFO L280 TraceCheckUtils]: 8: Hoare triple {774#true} ~x := #in~x; {774#true} is VALID [2020-07-18 00:14:29,651 INFO L280 TraceCheckUtils]: 9: Hoare triple {774#true} assume !(0 == ~x); {774#true} is VALID [2020-07-18 00:14:29,652 INFO L263 TraceCheckUtils]: 10: Hoare triple {774#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {774#true} is VALID [2020-07-18 00:14:29,652 INFO L280 TraceCheckUtils]: 11: Hoare triple {774#true} ~x := #in~x; {774#true} is VALID [2020-07-18 00:14:29,652 INFO L280 TraceCheckUtils]: 12: Hoare triple {774#true} assume !(0 == ~x); {774#true} is VALID [2020-07-18 00:14:29,652 INFO L263 TraceCheckUtils]: 13: Hoare triple {774#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {774#true} is VALID [2020-07-18 00:14:29,653 INFO L280 TraceCheckUtils]: 14: Hoare triple {774#true} ~x := #in~x; {774#true} is VALID [2020-07-18 00:14:29,653 INFO L280 TraceCheckUtils]: 15: Hoare triple {774#true} assume 0 == ~x; {774#true} is VALID [2020-07-18 00:14:29,654 INFO L280 TraceCheckUtils]: 16: Hoare triple {774#true} #res := 0; {786#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:29,656 INFO L280 TraceCheckUtils]: 17: Hoare triple {786#(= 0 |id_#res|)} [51] idFINAL-->idEXIT_primed: Formula: (let ((.cse0 (+ |v_oct_id_#res_in_3| 1)) (.cse1 (* 2 v_oct_id_~ret~0_out_3))) (and (<= |v_oct_id_#res_out_3| v_oct_id_~ret~0_out_3) (<= v_oct_id_~ret~0_out_3 .cse0) (<= 0 (+ .cse1 4294967294)) (<= v_oct_id_~ret~0_out_3 |v_oct_id_#res_out_3|) (<= .cse0 v_oct_id_~ret~0_out_3) (<= .cse1 6))) InVars {id_#res=|v_oct_id_#res_in_3|} OutVars{id_#res=|v_oct_id_#res_out_3|, id_#t~ret0=|v_oct_id_#t~ret0_out_3|, id_~ret~0=v_oct_id_~ret~0_out_3} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {787#(<= |id_#res| 1)} is VALID [2020-07-18 00:14:29,657 INFO L280 TraceCheckUtils]: 18: Hoare triple {787#(<= |id_#res| 1)} [50] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#(<= |id_#res| 1)} is VALID [2020-07-18 00:14:29,659 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {787#(<= |id_#res| 1)} {774#true} #43#return; {784#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 00:14:29,659 INFO L280 TraceCheckUtils]: 20: Hoare triple {784#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {784#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 00:14:29,660 INFO L280 TraceCheckUtils]: 21: Hoare triple {784#(<= |main_#t~ret2| 1)} ~result~0 := #t~ret2; {785#(<= main_~result~0 1)} is VALID [2020-07-18 00:14:29,660 INFO L280 TraceCheckUtils]: 22: Hoare triple {785#(<= main_~result~0 1)} havoc #t~ret2; {785#(<= main_~result~0 1)} is VALID [2020-07-18 00:14:29,661 INFO L280 TraceCheckUtils]: 23: Hoare triple {785#(<= main_~result~0 1)} assume 2 == ~result~0; {775#false} is VALID [2020-07-18 00:14:29,661 INFO L280 TraceCheckUtils]: 24: Hoare triple {775#false} assume !false; {775#false} is VALID [2020-07-18 00:14:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-18 00:14:29,856 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:29,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1988040631] [2020-07-18 00:14:29,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:29,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-18 00:14:29,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245899202] [2020-07-18 00:14:29,858 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2020-07-18 00:14:29,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:29,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 00:14:29,890 WARN L140 InductivityCheck]: Transition 791#(and (= id_~ret~0 |id_#res|) (= 1 id_~ret~0)) ( _ , 774#true , #45#return; , 792#(and (= 1 id_~ret~0) (= |id_#t~ret0| id_~ret~0)) ) not inductive [2020-07-18 00:14:29,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:14:29,891 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:14:29,898 INFO L168 Benchmark]: Toolchain (without parser) took 4171.59 ms. Allocated memory was 144.7 MB in the beginning and 248.5 MB in the end (delta: 103.8 MB). Free memory was 102.8 MB in the beginning and 177.4 MB in the end (delta: -74.6 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,899 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.45 ms. Allocated memory is still 144.7 MB. Free memory was 102.4 MB in the beginning and 92.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,900 INFO L168 Benchmark]: Boogie Preprocessor took 31.32 ms. Allocated memory is still 144.7 MB. Free memory was 92.9 MB in the beginning and 91.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,901 INFO L168 Benchmark]: RCFGBuilder took 537.78 ms. Allocated memory was 144.7 MB in the beginning and 200.8 MB in the end (delta: 56.1 MB). Free memory was 91.6 MB in the beginning and 163.4 MB in the end (delta: -71.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,903 INFO L168 Benchmark]: TraceAbstraction took 3302.99 ms. Allocated memory was 200.8 MB in the beginning and 248.5 MB in the end (delta: 47.7 MB). Free memory was 162.8 MB in the beginning and 177.4 MB in the end (delta: -14.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,907 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.17 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.45 ms. Allocated memory is still 144.7 MB. Free memory was 102.4 MB in the beginning and 92.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.32 ms. Allocated memory is still 144.7 MB. Free memory was 92.9 MB in the beginning and 91.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 537.78 ms. Allocated memory was 144.7 MB in the beginning and 200.8 MB in the end (delta: 56.1 MB). Free memory was 91.6 MB in the beginning and 163.4 MB in the end (delta: -71.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3302.99 ms. Allocated memory was 200.8 MB in the beginning and 248.5 MB in the end (delta: 47.7 MB). Free memory was 162.8 MB in the beginning and 177.4 MB in the end (delta: -14.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...