/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-simple/id_b5_o10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 04:57:41,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:57:41,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:57:41,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:57:41,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:57:41,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:57:41,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:57:41,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:57:41,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:57:41,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:57:41,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:57:41,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:57:41,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:57:41,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:57:41,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:57:41,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:57:41,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:57:41,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:57:41,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:57:41,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:57:41,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:57:41,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:57:41,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:57:41,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:57:41,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:57:41,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:57:41,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:57:41,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:57:41,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:57:41,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:57:41,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:57:41,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:57:41,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:57:41,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:57:41,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:57:41,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:57:41,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:57:41,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:57:41,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:57:41,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:57:41,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:57:41,423 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 04:57:41,433 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:57:41,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:57:41,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:57:41,434 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:57:41,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:57:41,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:57:41,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:57:41,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:57:41,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:57:41,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:57:41,436 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:57:41,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:57:41,436 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:57:41,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:57:41,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:57:41,437 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:57:41,437 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:57:41,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:57:41,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:57:41,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:57:41,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:57:41,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:57:41,438 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-18 04:57:41,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:57:41,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:57:41,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:57:41,796 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:57:41,796 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:57:41,797 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c [2020-07-18 04:57:41,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13bb6c665/7e40355bb65d445ab6962a2da0b73a8e/FLAG3666d070b [2020-07-18 04:57:42,249 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:57:42,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c [2020-07-18 04:57:42,255 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13bb6c665/7e40355bb65d445ab6962a2da0b73a8e/FLAG3666d070b [2020-07-18 04:57:42,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13bb6c665/7e40355bb65d445ab6962a2da0b73a8e [2020-07-18 04:57:42,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:57:42,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:57:42,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:57:42,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:57:42,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:57:42,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:57:42" (1/1) ... [2020-07-18 04:57:42,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d0515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:42, skipping insertion in model container [2020-07-18 04:57:42,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:57:42" (1/1) ... [2020-07-18 04:57:42,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:57:42,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:57:42,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:57:42,939 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:57:42,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:57:42,982 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:57:42,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:42 WrapperNode [2020-07-18 04:57:42,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:57:42,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:57:42,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:57:42,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:57:43,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:42" (1/1) ... [2020-07-18 04:57:43,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:42" (1/1) ... [2020-07-18 04:57:43,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:42" (1/1) ... [2020-07-18 04:57:43,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:42" (1/1) ... [2020-07-18 04:57:43,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:42" (1/1) ... [2020-07-18 04:57:43,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:42" (1/1) ... [2020-07-18 04:57:43,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:42" (1/1) ... [2020-07-18 04:57:43,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:57:43,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:57:43,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:57:43,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:57:43,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:57:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:57:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:57:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-18 04:57:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:57:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 04:57:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:57:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-18 04:57:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:57:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:57:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:57:43,584 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:57:43,585 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 04:57:43,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:57:43 BoogieIcfgContainer [2020-07-18 04:57:43,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:57:43,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:57:43,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:57:43,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:57:43,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:57:42" (1/3) ... [2020-07-18 04:57:43,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12db6756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:57:43, skipping insertion in model container [2020-07-18 04:57:43,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:42" (2/3) ... [2020-07-18 04:57:43,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12db6756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:57:43, skipping insertion in model container [2020-07-18 04:57:43,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:57:43" (3/3) ... [2020-07-18 04:57:43,604 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b5_o10-2.c [2020-07-18 04:57:43,614 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:57:43,622 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:57:43,634 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:57:43,657 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:57:43,658 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:57:43,658 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:57:43,658 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:57:43,658 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:57:43,659 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:57:43,659 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:57:43,659 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:57:43,675 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-18 04:57:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 04:57:43,686 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:43,688 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 04:57:43,688 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:43,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash 856871792, now seen corresponding path program 1 times [2020-07-18 04:57:43,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:43,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [920153107] [2020-07-18 04:57:43,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:43,909 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 04:57:43,910 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-18 04:57:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:43,959 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-18 04:57:43,960 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-18 04:57:43,961 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:43,962 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:43,964 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-18 04:57:43,965 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-18 04:57:43,966 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 04:57:43,966 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-18 04:57:43,966 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-18 04:57:43,967 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33#true} is VALID [2020-07-18 04:57:43,967 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~input~0 := #t~nondet1; {33#true} is VALID [2020-07-18 04:57:43,968 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc #t~nondet1; {33#true} is VALID [2020-07-18 04:57:43,968 INFO L263 TraceCheckUtils]: 7: Hoare triple {33#true} call #t~ret2 := id(~input~0); {33#true} is VALID [2020-07-18 04:57:43,969 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-18 04:57:43,969 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-18 04:57:43,971 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:43,972 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:43,974 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-18 04:57:43,976 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 04:57:43,978 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 04:57:43,980 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#(<= main_~result~0 0)} havoc #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-18 04:57:43,981 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= main_~result~0 0)} assume 10 == ~result~0; {34#false} is VALID [2020-07-18 04:57:43,982 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-18 04:57:43,984 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 04:57:43,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [920153107] [2020-07-18 04:57:43,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:57:43,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:57:43,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816472728] [2020-07-18 04:57:43,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 04:57:43,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:44,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:57:44,048 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 04:57:44,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:57:44,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:44,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:57:44,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:57:44,062 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-07-18 04:57:44,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:44,320 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-18 04:57:44,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:57:44,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 04:57:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-18 04:57:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-18 04:57:44,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2020-07-18 04:57:44,412 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 04:57:44,425 INFO L225 Difference]: With dead ends: 44 [2020-07-18 04:57:44,425 INFO L226 Difference]: Without dead ends: 28 [2020-07-18 04:57:44,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 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 04:57:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-18 04:57:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-18 04:57:44,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:44,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-18 04:57:44,500 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 04:57:44,500 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 04:57:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:44,509 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-18 04:57:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 04:57:44,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:44,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:44,514 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 04:57:44,514 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 04:57:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:44,525 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-18 04:57:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 04:57:44,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:44,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:44,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:44,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 04:57:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-18 04:57:44,536 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2020-07-18 04:57:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:44,537 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-18 04:57:44,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:57:44,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-18 04:57:44,592 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 04:57:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 04:57:44,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 04:57:44,603 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:44,603 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 04:57:44,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:57:44,604 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:44,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:44,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609951, now seen corresponding path program 1 times [2020-07-18 04:57:44,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:44,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1063961902] [2020-07-18 04:57:44,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:44,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-18 04:57:44,684 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-18 04:57:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:44,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 04:57:44,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-18 04:57:44,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:44,787 INFO L280 TraceCheckUtils]: 3: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:44,789 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:44,789 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 04:57:44,790 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-18 04:57:44,790 INFO L263 TraceCheckUtils]: 2: 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 04:57:44,791 INFO L280 TraceCheckUtils]: 3: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 04:57:44,791 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-18 04:57:44,792 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:44,793 INFO L280 TraceCheckUtils]: 6: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:44,794 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:44,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {273#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:44,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {273#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:44,797 INFO L280 TraceCheckUtils]: 10: Hoare triple {274#(<= id_~ret~0 1)} havoc #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:44,798 INFO L280 TraceCheckUtils]: 11: Hoare triple {274#(<= id_~ret~0 1)} assume ~ret~0 > 5; {250#false} is VALID [2020-07-18 04:57:44,798 INFO L280 TraceCheckUtils]: 12: Hoare triple {250#false} #res := 5; {250#false} is VALID [2020-07-18 04:57:44,799 INFO L280 TraceCheckUtils]: 13: Hoare triple {250#false} assume true; {250#false} is VALID [2020-07-18 04:57:44,799 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {250#false} {249#true} #43#return; {250#false} is VALID [2020-07-18 04:57:44,800 INFO L263 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2020-07-18 04:57:44,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-18 04:57:44,801 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-18 04:57:44,801 INFO L263 TraceCheckUtils]: 3: Hoare triple {249#true} call #t~ret3 := main(); {249#true} is VALID [2020-07-18 04:57:44,801 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {249#true} is VALID [2020-07-18 04:57:44,802 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} ~input~0 := #t~nondet1; {249#true} is VALID [2020-07-18 04:57:44,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {249#true} havoc #t~nondet1; {249#true} is VALID [2020-07-18 04:57:44,802 INFO L263 TraceCheckUtils]: 7: Hoare triple {249#true} call #t~ret2 := id(~input~0); {249#true} is VALID [2020-07-18 04:57:44,802 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 04:57:44,803 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-18 04:57:44,803 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 04:57:44,803 INFO L280 TraceCheckUtils]: 11: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 04:57:44,804 INFO L280 TraceCheckUtils]: 12: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-18 04:57:44,805 INFO L280 TraceCheckUtils]: 13: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:44,806 INFO L280 TraceCheckUtils]: 14: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:44,807 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:44,808 INFO L280 TraceCheckUtils]: 16: Hoare triple {273#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:44,809 INFO L280 TraceCheckUtils]: 17: Hoare triple {273#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:44,810 INFO L280 TraceCheckUtils]: 18: Hoare triple {274#(<= id_~ret~0 1)} havoc #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:44,811 INFO L280 TraceCheckUtils]: 19: Hoare triple {274#(<= id_~ret~0 1)} assume ~ret~0 > 5; {250#false} is VALID [2020-07-18 04:57:44,811 INFO L280 TraceCheckUtils]: 20: Hoare triple {250#false} #res := 5; {250#false} is VALID [2020-07-18 04:57:44,812 INFO L280 TraceCheckUtils]: 21: Hoare triple {250#false} assume true; {250#false} is VALID [2020-07-18 04:57:44,812 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {250#false} {249#true} #43#return; {250#false} is VALID [2020-07-18 04:57:44,812 INFO L280 TraceCheckUtils]: 23: Hoare triple {250#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {250#false} is VALID [2020-07-18 04:57:44,813 INFO L280 TraceCheckUtils]: 24: Hoare triple {250#false} ~result~0 := #t~ret2; {250#false} is VALID [2020-07-18 04:57:44,813 INFO L280 TraceCheckUtils]: 25: Hoare triple {250#false} havoc #t~ret2; {250#false} is VALID [2020-07-18 04:57:44,813 INFO L280 TraceCheckUtils]: 26: Hoare triple {250#false} assume 10 == ~result~0; {250#false} is VALID [2020-07-18 04:57:44,813 INFO L280 TraceCheckUtils]: 27: Hoare triple {250#false} assume !false; {250#false} is VALID [2020-07-18 04:57:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 04:57:44,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1063961902] [2020-07-18 04:57:44,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:57:44,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:57:44,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187005316] [2020-07-18 04:57:44,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-18 04:57:44,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:44,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:57:44,859 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 04:57:44,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:57:44,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:44,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:57:44,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:57:44,861 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2020-07-18 04:57:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:45,032 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-18 04:57:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:57:45,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-18 04:57:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-18 04:57:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-18 04:57:45,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2020-07-18 04:57:45,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:45,113 INFO L225 Difference]: With dead ends: 49 [2020-07-18 04:57:45,114 INFO L226 Difference]: Without dead ends: 35 [2020-07-18 04:57:45,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 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 04:57:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-18 04:57:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-18 04:57:45,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:45,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2020-07-18 04:57:45,144 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2020-07-18 04:57:45,144 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2020-07-18 04:57:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:45,148 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-18 04:57:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-18 04:57:45,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:45,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:45,150 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2020-07-18 04:57:45,150 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2020-07-18 04:57:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:45,154 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-18 04:57:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-18 04:57:45,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:45,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:45,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:45,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-18 04:57:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-18 04:57:45,159 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2020-07-18 04:57:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:45,159 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-18 04:57:45,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:57:45,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-18 04:57:45,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-18 04:57:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 04:57:45,203 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:45,203 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 04:57:45,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:57:45,204 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:45,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:45,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1645321695, now seen corresponding path program 1 times [2020-07-18 04:57:45,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:45,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [974594466] [2020-07-18 04:57:45,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:45,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-18 04:57:45,259 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {512#true} {512#true} #39#return; {512#true} is VALID [2020-07-18 04:57:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:45,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-18 04:57:45,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-18 04:57:45,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:45,350 INFO L280 TraceCheckUtils]: 3: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:45,351 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:45,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-18 04:57:45,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume !(0 == ~x); {512#true} is VALID [2020-07-18 04:57:45,353 INFO L263 TraceCheckUtils]: 2: Hoare triple {512#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {512#true} is VALID [2020-07-18 04:57:45,353 INFO L280 TraceCheckUtils]: 3: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-18 04:57:45,353 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-18 04:57:45,354 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:45,355 INFO L280 TraceCheckUtils]: 6: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:45,357 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:45,358 INFO L280 TraceCheckUtils]: 8: Hoare triple {538#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:45,359 INFO L280 TraceCheckUtils]: 9: Hoare triple {538#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:45,359 INFO L280 TraceCheckUtils]: 10: Hoare triple {539#(<= id_~ret~0 1)} havoc #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:45,360 INFO L280 TraceCheckUtils]: 11: Hoare triple {539#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {539#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:45,361 INFO L280 TraceCheckUtils]: 12: Hoare triple {539#(<= id_~ret~0 1)} #res := ~ret~0; {540#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:45,362 INFO L280 TraceCheckUtils]: 13: Hoare triple {540#(<= |id_#res| 1)} assume true; {540#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:45,363 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {540#(<= |id_#res| 1)} {512#true} #43#return; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 04:57:45,364 INFO L263 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2020-07-18 04:57:45,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-18 04:57:45,365 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {512#true} {512#true} #39#return; {512#true} is VALID [2020-07-18 04:57:45,365 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#true} call #t~ret3 := main(); {512#true} is VALID [2020-07-18 04:57:45,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {512#true} is VALID [2020-07-18 04:57:45,366 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} ~input~0 := #t~nondet1; {512#true} is VALID [2020-07-18 04:57:45,366 INFO L280 TraceCheckUtils]: 6: Hoare triple {512#true} havoc #t~nondet1; {512#true} is VALID [2020-07-18 04:57:45,367 INFO L263 TraceCheckUtils]: 7: Hoare triple {512#true} call #t~ret2 := id(~input~0); {512#true} is VALID [2020-07-18 04:57:45,367 INFO L280 TraceCheckUtils]: 8: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-18 04:57:45,367 INFO L280 TraceCheckUtils]: 9: Hoare triple {512#true} assume !(0 == ~x); {512#true} is VALID [2020-07-18 04:57:45,367 INFO L263 TraceCheckUtils]: 10: Hoare triple {512#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {512#true} is VALID [2020-07-18 04:57:45,368 INFO L280 TraceCheckUtils]: 11: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-18 04:57:45,368 INFO L280 TraceCheckUtils]: 12: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-18 04:57:45,369 INFO L280 TraceCheckUtils]: 13: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:45,370 INFO L280 TraceCheckUtils]: 14: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:45,371 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:45,372 INFO L280 TraceCheckUtils]: 16: Hoare triple {538#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:45,373 INFO L280 TraceCheckUtils]: 17: Hoare triple {538#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:45,373 INFO L280 TraceCheckUtils]: 18: Hoare triple {539#(<= id_~ret~0 1)} havoc #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:45,374 INFO L280 TraceCheckUtils]: 19: Hoare triple {539#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {539#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:45,375 INFO L280 TraceCheckUtils]: 20: Hoare triple {539#(<= id_~ret~0 1)} #res := ~ret~0; {540#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:45,376 INFO L280 TraceCheckUtils]: 21: Hoare triple {540#(<= |id_#res| 1)} assume true; {540#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:45,377 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {540#(<= |id_#res| 1)} {512#true} #43#return; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 04:57:45,378 INFO L280 TraceCheckUtils]: 23: Hoare triple {531#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 04:57:45,379 INFO L280 TraceCheckUtils]: 24: Hoare triple {531#(<= |main_#t~ret2| 1)} ~result~0 := #t~ret2; {532#(<= main_~result~0 1)} is VALID [2020-07-18 04:57:45,380 INFO L280 TraceCheckUtils]: 25: Hoare triple {532#(<= main_~result~0 1)} havoc #t~ret2; {532#(<= main_~result~0 1)} is VALID [2020-07-18 04:57:45,381 INFO L280 TraceCheckUtils]: 26: Hoare triple {532#(<= main_~result~0 1)} assume 10 == ~result~0; {513#false} is VALID [2020-07-18 04:57:45,381 INFO L280 TraceCheckUtils]: 27: Hoare triple {513#false} assume !false; {513#false} is VALID [2020-07-18 04:57:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 04:57:45,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [974594466] [2020-07-18 04:57:45,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:57:45,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-18 04:57:45,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102727461] [2020-07-18 04:57:45,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-18 04:57:45,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:45,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 04:57:45,421 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 04:57:45,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 04:57:45,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:45,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 04:57:45,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:57:45,423 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2020-07-18 04:57:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:45,703 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-18 04:57:45,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 04:57:45,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-18 04:57:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:57:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-18 04:57:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:57:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-18 04:57:45,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2020-07-18 04:57:45,765 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 04:57:45,766 INFO L225 Difference]: With dead ends: 41 [2020-07-18 04:57:45,767 INFO L226 Difference]: Without dead ends: 35 [2020-07-18 04:57:45,768 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-18 04:57:45,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-18 04:57:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-18 04:57:45,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:45,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-18 04:57:45,812 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-18 04:57:45,812 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-18 04:57:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:45,815 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 04:57:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 04:57:45,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:45,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:45,816 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-18 04:57:45,817 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-18 04:57:45,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:45,820 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 04:57:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 04:57:45,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:45,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:45,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:45,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 04:57:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-18 04:57:45,824 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2020-07-18 04:57:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:45,824 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-18 04:57:45,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 04:57:45,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-18 04:57:45,867 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 04:57:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 04:57:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 04:57:45,869 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:45,869 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1] [2020-07-18 04:57:45,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:57:45,869 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:45,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:45,870 INFO L82 PathProgramCache]: Analyzing trace with hash 170302224, now seen corresponding path program 1 times [2020-07-18 04:57:45,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:45,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [450978385] [2020-07-18 04:57:45,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:45,936 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:45,936 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {772#true} {772#true} #39#return; {772#true} is VALID [2020-07-18 04:57:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:46,031 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:46,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-18 04:57:46,032 INFO L280 TraceCheckUtils]: 2: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-18 04:57:46,032 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:46,034 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:46,035 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:46,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-18 04:57:46,036 INFO L263 TraceCheckUtils]: 2: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-18 04:57:46,036 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:46,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-18 04:57:46,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-18 04:57:46,037 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:46,037 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:46,037 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-18 04:57:46,038 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-18 04:57:46,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-18 04:57:46,038 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} assume !(~ret~0 > 5); {772#true} is VALID [2020-07-18 04:57:46,039 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-18 04:57:46,039 INFO L280 TraceCheckUtils]: 13: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:46,039 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:46,040 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:46,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-18 04:57:46,040 INFO L263 TraceCheckUtils]: 2: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-18 04:57:46,041 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:46,041 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-18 04:57:46,041 INFO L263 TraceCheckUtils]: 5: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-18 04:57:46,041 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:46,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-18 04:57:46,042 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-18 04:57:46,042 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:46,042 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:46,043 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-18 04:57:46,043 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-18 04:57:46,043 INFO L280 TraceCheckUtils]: 13: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-18 04:57:46,043 INFO L280 TraceCheckUtils]: 14: Hoare triple {772#true} assume !(~ret~0 > 5); {772#true} is VALID [2020-07-18 04:57:46,044 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-18 04:57:46,044 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:46,044 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:46,044 INFO L280 TraceCheckUtils]: 18: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-18 04:57:46,045 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-18 04:57:46,045 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-18 04:57:46,045 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#true} assume ~ret~0 > 5; {772#true} is VALID [2020-07-18 04:57:46,046 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#true} #res := 5; {818#(<= |id_#res| 5)} is VALID [2020-07-18 04:57:46,047 INFO L280 TraceCheckUtils]: 23: Hoare triple {818#(<= |id_#res| 5)} assume true; {818#(<= |id_#res| 5)} is VALID [2020-07-18 04:57:46,048 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {818#(<= |id_#res| 5)} {772#true} #43#return; {801#(<= |main_#t~ret2| 5)} is VALID [2020-07-18 04:57:46,049 INFO L263 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2020-07-18 04:57:46,049 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:46,049 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {772#true} {772#true} #39#return; {772#true} is VALID [2020-07-18 04:57:46,050 INFO L263 TraceCheckUtils]: 3: Hoare triple {772#true} call #t~ret3 := main(); {772#true} is VALID [2020-07-18 04:57:46,050 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {772#true} is VALID [2020-07-18 04:57:46,050 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} ~input~0 := #t~nondet1; {772#true} is VALID [2020-07-18 04:57:46,051 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} havoc #t~nondet1; {772#true} is VALID [2020-07-18 04:57:46,051 INFO L263 TraceCheckUtils]: 7: Hoare triple {772#true} call #t~ret2 := id(~input~0); {772#true} is VALID [2020-07-18 04:57:46,051 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:46,051 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-18 04:57:46,052 INFO L263 TraceCheckUtils]: 10: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-18 04:57:46,052 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:46,052 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-18 04:57:46,052 INFO L263 TraceCheckUtils]: 13: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-18 04:57:46,052 INFO L280 TraceCheckUtils]: 14: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:46,053 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-18 04:57:46,053 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-18 04:57:46,053 INFO L280 TraceCheckUtils]: 17: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:46,053 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:46,054 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-18 04:57:46,054 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-18 04:57:46,054 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-18 04:57:46,054 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#true} assume !(~ret~0 > 5); {772#true} is VALID [2020-07-18 04:57:46,055 INFO L280 TraceCheckUtils]: 23: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-18 04:57:46,055 INFO L280 TraceCheckUtils]: 24: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:46,055 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:46,055 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-18 04:57:46,056 INFO L280 TraceCheckUtils]: 27: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-18 04:57:46,056 INFO L280 TraceCheckUtils]: 28: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-18 04:57:46,056 INFO L280 TraceCheckUtils]: 29: Hoare triple {772#true} assume ~ret~0 > 5; {772#true} is VALID [2020-07-18 04:57:46,057 INFO L280 TraceCheckUtils]: 30: Hoare triple {772#true} #res := 5; {818#(<= |id_#res| 5)} is VALID [2020-07-18 04:57:46,058 INFO L280 TraceCheckUtils]: 31: Hoare triple {818#(<= |id_#res| 5)} assume true; {818#(<= |id_#res| 5)} is VALID [2020-07-18 04:57:46,059 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {818#(<= |id_#res| 5)} {772#true} #43#return; {801#(<= |main_#t~ret2| 5)} is VALID [2020-07-18 04:57:46,060 INFO L280 TraceCheckUtils]: 33: Hoare triple {801#(<= |main_#t~ret2| 5)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {801#(<= |main_#t~ret2| 5)} is VALID [2020-07-18 04:57:46,060 INFO L280 TraceCheckUtils]: 34: Hoare triple {801#(<= |main_#t~ret2| 5)} ~result~0 := #t~ret2; {802#(<= main_~result~0 5)} is VALID [2020-07-18 04:57:46,061 INFO L280 TraceCheckUtils]: 35: Hoare triple {802#(<= main_~result~0 5)} havoc #t~ret2; {802#(<= main_~result~0 5)} is VALID [2020-07-18 04:57:46,061 INFO L280 TraceCheckUtils]: 36: Hoare triple {802#(<= main_~result~0 5)} assume 10 == ~result~0; {773#false} is VALID [2020-07-18 04:57:46,062 INFO L280 TraceCheckUtils]: 37: Hoare triple {773#false} assume !false; {773#false} is VALID [2020-07-18 04:57:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-18 04:57:46,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [450978385] [2020-07-18 04:57:46,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:57:46,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:57:46,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206443166] [2020-07-18 04:57:46,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-18 04:57:46,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:46,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:57:46,095 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-18 04:57:46,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:57:46,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:46,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:57:46,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:57:46,096 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2020-07-18 04:57:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:46,227 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-18 04:57:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:57:46,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-18 04:57:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-18 04:57:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-18 04:57:46,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2020-07-18 04:57:46,289 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 04:57:46,291 INFO L225 Difference]: With dead ends: 43 [2020-07-18 04:57:46,291 INFO L226 Difference]: Without dead ends: 37 [2020-07-18 04:57:46,293 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 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 04:57:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-18 04:57:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-18 04:57:46,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:46,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2020-07-18 04:57:46,326 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2020-07-18 04:57:46,326 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2020-07-18 04:57:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:46,329 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-18 04:57:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-18 04:57:46,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:46,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:46,330 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2020-07-18 04:57:46,330 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2020-07-18 04:57:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:46,333 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-18 04:57:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-18 04:57:46,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:46,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:46,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:46,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 04:57:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-18 04:57:46,337 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 38 [2020-07-18 04:57:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:46,337 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-18 04:57:46,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:57:46,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-18 04:57:46,373 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 04:57:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 04:57:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 04:57:46,375 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:46,375 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 04:57:46,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 04:57:46,376 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:46,376 INFO L82 PathProgramCache]: Analyzing trace with hash 41013968, now seen corresponding path program 2 times [2020-07-18 04:57:46,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:46,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [799258629] [2020-07-18 04:57:46,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:46,457 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} assume true; {1058#true} is VALID [2020-07-18 04:57:46,458 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1058#true} {1058#true} #39#return; {1058#true} is VALID [2020-07-18 04:57:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:46,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:46,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-18 04:57:46,589 INFO L280 TraceCheckUtils]: 2: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:46,590 INFO L280 TraceCheckUtils]: 3: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:46,591 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:46,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:46,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-18 04:57:46,592 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-18 04:57:46,593 INFO L280 TraceCheckUtils]: 3: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:46,593 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-18 04:57:46,594 INFO L280 TraceCheckUtils]: 5: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:46,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:46,595 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:46,596 INFO L280 TraceCheckUtils]: 8: Hoare triple {1112#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:46,597 INFO L280 TraceCheckUtils]: 9: Hoare triple {1112#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:46,597 INFO L280 TraceCheckUtils]: 10: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:46,598 INFO L280 TraceCheckUtils]: 11: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:46,598 INFO L280 TraceCheckUtils]: 12: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:46,599 INFO L280 TraceCheckUtils]: 13: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:46,600 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:46,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:46,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-18 04:57:46,601 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-18 04:57:46,602 INFO L280 TraceCheckUtils]: 3: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:46,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-18 04:57:46,602 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-18 04:57:46,602 INFO L280 TraceCheckUtils]: 6: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:46,603 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-18 04:57:46,603 INFO L280 TraceCheckUtils]: 8: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:46,604 INFO L280 TraceCheckUtils]: 9: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:46,605 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:46,606 INFO L280 TraceCheckUtils]: 11: Hoare triple {1112#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:46,606 INFO L280 TraceCheckUtils]: 12: Hoare triple {1112#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:46,607 INFO L280 TraceCheckUtils]: 13: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:46,608 INFO L280 TraceCheckUtils]: 14: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:46,608 INFO L280 TraceCheckUtils]: 15: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:46,609 INFO L280 TraceCheckUtils]: 16: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:46,610 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:46,611 INFO L280 TraceCheckUtils]: 18: Hoare triple {1104#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:46,612 INFO L280 TraceCheckUtils]: 19: Hoare triple {1104#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:46,612 INFO L280 TraceCheckUtils]: 20: Hoare triple {1105#(<= id_~ret~0 2)} havoc #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:46,613 INFO L280 TraceCheckUtils]: 21: Hoare triple {1105#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {1105#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:46,614 INFO L280 TraceCheckUtils]: 22: Hoare triple {1105#(<= id_~ret~0 2)} #res := ~ret~0; {1106#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:46,614 INFO L280 TraceCheckUtils]: 23: Hoare triple {1106#(<= |id_#res| 2)} assume true; {1106#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:46,615 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1106#(<= |id_#res| 2)} {1058#true} #43#return; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-18 04:57:46,616 INFO L263 TraceCheckUtils]: 0: Hoare triple {1058#true} call ULTIMATE.init(); {1058#true} is VALID [2020-07-18 04:57:46,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume true; {1058#true} is VALID [2020-07-18 04:57:46,617 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1058#true} {1058#true} #39#return; {1058#true} is VALID [2020-07-18 04:57:46,617 INFO L263 TraceCheckUtils]: 3: Hoare triple {1058#true} call #t~ret3 := main(); {1058#true} is VALID [2020-07-18 04:57:46,618 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1058#true} is VALID [2020-07-18 04:57:46,618 INFO L280 TraceCheckUtils]: 5: Hoare triple {1058#true} ~input~0 := #t~nondet1; {1058#true} is VALID [2020-07-18 04:57:46,618 INFO L280 TraceCheckUtils]: 6: Hoare triple {1058#true} havoc #t~nondet1; {1058#true} is VALID [2020-07-18 04:57:46,618 INFO L263 TraceCheckUtils]: 7: Hoare triple {1058#true} call #t~ret2 := id(~input~0); {1058#true} is VALID [2020-07-18 04:57:46,619 INFO L280 TraceCheckUtils]: 8: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:46,619 INFO L280 TraceCheckUtils]: 9: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-18 04:57:46,619 INFO L263 TraceCheckUtils]: 10: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-18 04:57:46,619 INFO L280 TraceCheckUtils]: 11: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:46,620 INFO L280 TraceCheckUtils]: 12: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-18 04:57:46,620 INFO L263 TraceCheckUtils]: 13: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-18 04:57:46,620 INFO L280 TraceCheckUtils]: 14: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:46,620 INFO L280 TraceCheckUtils]: 15: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-18 04:57:46,621 INFO L280 TraceCheckUtils]: 16: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:46,622 INFO L280 TraceCheckUtils]: 17: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:46,623 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:46,623 INFO L280 TraceCheckUtils]: 19: Hoare triple {1112#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:46,624 INFO L280 TraceCheckUtils]: 20: Hoare triple {1112#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:46,625 INFO L280 TraceCheckUtils]: 21: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:46,625 INFO L280 TraceCheckUtils]: 22: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:46,626 INFO L280 TraceCheckUtils]: 23: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:46,626 INFO L280 TraceCheckUtils]: 24: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:46,628 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:46,628 INFO L280 TraceCheckUtils]: 26: Hoare triple {1104#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:46,629 INFO L280 TraceCheckUtils]: 27: Hoare triple {1104#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:46,630 INFO L280 TraceCheckUtils]: 28: Hoare triple {1105#(<= id_~ret~0 2)} havoc #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:46,630 INFO L280 TraceCheckUtils]: 29: Hoare triple {1105#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {1105#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:46,631 INFO L280 TraceCheckUtils]: 30: Hoare triple {1105#(<= id_~ret~0 2)} #res := ~ret~0; {1106#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:46,631 INFO L280 TraceCheckUtils]: 31: Hoare triple {1106#(<= |id_#res| 2)} assume true; {1106#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:46,632 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1106#(<= |id_#res| 2)} {1058#true} #43#return; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-18 04:57:46,633 INFO L280 TraceCheckUtils]: 33: Hoare triple {1087#(<= |main_#t~ret2| 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-18 04:57:46,634 INFO L280 TraceCheckUtils]: 34: Hoare triple {1087#(<= |main_#t~ret2| 2)} ~result~0 := #t~ret2; {1088#(<= main_~result~0 2)} is VALID [2020-07-18 04:57:46,634 INFO L280 TraceCheckUtils]: 35: Hoare triple {1088#(<= main_~result~0 2)} havoc #t~ret2; {1088#(<= main_~result~0 2)} is VALID [2020-07-18 04:57:46,635 INFO L280 TraceCheckUtils]: 36: Hoare triple {1088#(<= main_~result~0 2)} assume 10 == ~result~0; {1059#false} is VALID [2020-07-18 04:57:46,635 INFO L280 TraceCheckUtils]: 37: Hoare triple {1059#false} assume !false; {1059#false} is VALID [2020-07-18 04:57:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-18 04:57:46,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [799258629] [2020-07-18 04:57:46,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:57:46,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 04:57:46,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78288642] [2020-07-18 04:57:46,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-07-18 04:57:46,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:46,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 04:57:46,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:46,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 04:57:46,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:46,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 04:57:46,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-18 04:57:46,678 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 11 states. [2020-07-18 04:57:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:46,975 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2020-07-18 04:57:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-18 04:57:46,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-07-18 04:57:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 04:57:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2020-07-18 04:57:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 04:57:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2020-07-18 04:57:46,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 65 transitions. [2020-07-18 04:57:47,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:47,060 INFO L225 Difference]: With dead ends: 64 [2020-07-18 04:57:47,060 INFO L226 Difference]: Without dead ends: 44 [2020-07-18 04:57:47,062 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-18 04:57:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-18 04:57:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-18 04:57:47,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:47,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-18 04:57:47,119 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-18 04:57:47,120 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-18 04:57:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:47,125 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-18 04:57:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-18 04:57:47,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:47,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:47,126 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-18 04:57:47,126 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-18 04:57:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:47,132 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-18 04:57:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-18 04:57:47,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:47,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:47,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:47,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-18 04:57:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-18 04:57:47,137 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 38 [2020-07-18 04:57:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:47,140 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-18 04:57:47,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 04:57:47,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-18 04:57:47,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-18 04:57:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 04:57:47,201 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:47,201 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:57:47,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 04:57:47,202 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1045014785, now seen corresponding path program 3 times [2020-07-18 04:57:47,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:47,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [153596780] [2020-07-18 04:57:47,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:47,256 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-18 04:57:47,256 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1428#true} {1428#true} #39#return; {1428#true} is VALID [2020-07-18 04:57:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:47,437 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-18 04:57:47,439 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:47,439 INFO L280 TraceCheckUtils]: 3: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:47,440 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:47,441 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:47,441 INFO L263 TraceCheckUtils]: 2: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-18 04:57:47,442 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,442 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-18 04:57:47,443 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:47,443 INFO L280 TraceCheckUtils]: 6: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:47,444 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:47,445 INFO L280 TraceCheckUtils]: 8: Hoare triple {1520#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:47,446 INFO L280 TraceCheckUtils]: 9: Hoare triple {1520#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:47,446 INFO L280 TraceCheckUtils]: 10: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:47,447 INFO L280 TraceCheckUtils]: 11: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:47,447 INFO L280 TraceCheckUtils]: 12: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:47,448 INFO L280 TraceCheckUtils]: 13: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:47,451 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:47,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:47,453 INFO L263 TraceCheckUtils]: 2: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-18 04:57:47,453 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,454 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:47,454 INFO L263 TraceCheckUtils]: 5: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-18 04:57:47,454 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,454 INFO L280 TraceCheckUtils]: 7: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-18 04:57:47,455 INFO L280 TraceCheckUtils]: 8: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:47,457 INFO L280 TraceCheckUtils]: 9: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:47,459 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:47,461 INFO L280 TraceCheckUtils]: 11: Hoare triple {1520#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:47,464 INFO L280 TraceCheckUtils]: 12: Hoare triple {1520#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:47,464 INFO L280 TraceCheckUtils]: 13: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:47,465 INFO L280 TraceCheckUtils]: 14: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:47,466 INFO L280 TraceCheckUtils]: 15: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:47,466 INFO L280 TraceCheckUtils]: 16: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:47,468 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:47,468 INFO L280 TraceCheckUtils]: 18: Hoare triple {1512#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:47,469 INFO L280 TraceCheckUtils]: 19: Hoare triple {1512#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:47,470 INFO L280 TraceCheckUtils]: 20: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:47,470 INFO L280 TraceCheckUtils]: 21: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:47,471 INFO L280 TraceCheckUtils]: 22: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:47,472 INFO L280 TraceCheckUtils]: 23: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:47,473 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:47,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:47,474 INFO L263 TraceCheckUtils]: 2: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-18 04:57:47,475 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:47,475 INFO L263 TraceCheckUtils]: 5: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-18 04:57:47,475 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,475 INFO L280 TraceCheckUtils]: 7: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:47,476 INFO L263 TraceCheckUtils]: 8: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-18 04:57:47,476 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,476 INFO L280 TraceCheckUtils]: 10: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-18 04:57:47,477 INFO L280 TraceCheckUtils]: 11: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:47,478 INFO L280 TraceCheckUtils]: 12: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:47,479 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:47,479 INFO L280 TraceCheckUtils]: 14: Hoare triple {1520#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:47,480 INFO L280 TraceCheckUtils]: 15: Hoare triple {1520#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:47,481 INFO L280 TraceCheckUtils]: 16: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:47,481 INFO L280 TraceCheckUtils]: 17: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:47,482 INFO L280 TraceCheckUtils]: 18: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:47,482 INFO L280 TraceCheckUtils]: 19: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:47,483 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:47,484 INFO L280 TraceCheckUtils]: 21: Hoare triple {1512#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:47,485 INFO L280 TraceCheckUtils]: 22: Hoare triple {1512#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:47,486 INFO L280 TraceCheckUtils]: 23: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:47,486 INFO L280 TraceCheckUtils]: 24: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:47,487 INFO L280 TraceCheckUtils]: 25: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:47,488 INFO L280 TraceCheckUtils]: 26: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:47,489 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:47,489 INFO L280 TraceCheckUtils]: 28: Hoare triple {1494#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:47,490 INFO L280 TraceCheckUtils]: 29: Hoare triple {1494#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:47,491 INFO L280 TraceCheckUtils]: 30: Hoare triple {1495#(<= id_~ret~0 3)} havoc #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:47,492 INFO L280 TraceCheckUtils]: 31: Hoare triple {1495#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {1495#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:47,492 INFO L280 TraceCheckUtils]: 32: Hoare triple {1495#(<= id_~ret~0 3)} #res := ~ret~0; {1496#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:47,493 INFO L280 TraceCheckUtils]: 33: Hoare triple {1496#(<= |id_#res| 3)} assume true; {1496#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:47,494 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1496#(<= |id_#res| 3)} {1428#true} #43#return; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-18 04:57:47,495 INFO L263 TraceCheckUtils]: 0: Hoare triple {1428#true} call ULTIMATE.init(); {1428#true} is VALID [2020-07-18 04:57:47,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-18 04:57:47,496 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1428#true} {1428#true} #39#return; {1428#true} is VALID [2020-07-18 04:57:47,496 INFO L263 TraceCheckUtils]: 3: Hoare triple {1428#true} call #t~ret3 := main(); {1428#true} is VALID [2020-07-18 04:57:47,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1428#true} is VALID [2020-07-18 04:57:47,497 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#true} ~input~0 := #t~nondet1; {1428#true} is VALID [2020-07-18 04:57:47,497 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} havoc #t~nondet1; {1428#true} is VALID [2020-07-18 04:57:47,497 INFO L263 TraceCheckUtils]: 7: Hoare triple {1428#true} call #t~ret2 := id(~input~0); {1428#true} is VALID [2020-07-18 04:57:47,497 INFO L280 TraceCheckUtils]: 8: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,498 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:47,498 INFO L263 TraceCheckUtils]: 10: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-18 04:57:47,498 INFO L280 TraceCheckUtils]: 11: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,498 INFO L280 TraceCheckUtils]: 12: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:47,498 INFO L263 TraceCheckUtils]: 13: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-18 04:57:47,499 INFO L280 TraceCheckUtils]: 14: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,499 INFO L280 TraceCheckUtils]: 15: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:47,499 INFO L263 TraceCheckUtils]: 16: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-18 04:57:47,499 INFO L280 TraceCheckUtils]: 17: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:47,500 INFO L280 TraceCheckUtils]: 18: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-18 04:57:47,501 INFO L280 TraceCheckUtils]: 19: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:47,501 INFO L280 TraceCheckUtils]: 20: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:47,502 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:47,503 INFO L280 TraceCheckUtils]: 22: Hoare triple {1520#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:47,504 INFO L280 TraceCheckUtils]: 23: Hoare triple {1520#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:47,504 INFO L280 TraceCheckUtils]: 24: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:47,505 INFO L280 TraceCheckUtils]: 25: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:47,506 INFO L280 TraceCheckUtils]: 26: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:47,506 INFO L280 TraceCheckUtils]: 27: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:47,507 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:47,508 INFO L280 TraceCheckUtils]: 29: Hoare triple {1512#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:47,509 INFO L280 TraceCheckUtils]: 30: Hoare triple {1512#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:47,509 INFO L280 TraceCheckUtils]: 31: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:47,510 INFO L280 TraceCheckUtils]: 32: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:47,511 INFO L280 TraceCheckUtils]: 33: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:47,511 INFO L280 TraceCheckUtils]: 34: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:47,512 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:47,513 INFO L280 TraceCheckUtils]: 36: Hoare triple {1494#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:47,514 INFO L280 TraceCheckUtils]: 37: Hoare triple {1494#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:47,514 INFO L280 TraceCheckUtils]: 38: Hoare triple {1495#(<= id_~ret~0 3)} havoc #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:47,515 INFO L280 TraceCheckUtils]: 39: Hoare triple {1495#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {1495#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:47,516 INFO L280 TraceCheckUtils]: 40: Hoare triple {1495#(<= id_~ret~0 3)} #res := ~ret~0; {1496#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:47,516 INFO L280 TraceCheckUtils]: 41: Hoare triple {1496#(<= |id_#res| 3)} assume true; {1496#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:47,517 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1496#(<= |id_#res| 3)} {1428#true} #43#return; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-18 04:57:47,518 INFO L280 TraceCheckUtils]: 43: Hoare triple {1467#(<= |main_#t~ret2| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-18 04:57:47,518 INFO L280 TraceCheckUtils]: 44: Hoare triple {1467#(<= |main_#t~ret2| 3)} ~result~0 := #t~ret2; {1468#(<= main_~result~0 3)} is VALID [2020-07-18 04:57:47,519 INFO L280 TraceCheckUtils]: 45: Hoare triple {1468#(<= main_~result~0 3)} havoc #t~ret2; {1468#(<= main_~result~0 3)} is VALID [2020-07-18 04:57:47,520 INFO L280 TraceCheckUtils]: 46: Hoare triple {1468#(<= main_~result~0 3)} assume 10 == ~result~0; {1429#false} is VALID [2020-07-18 04:57:47,520 INFO L280 TraceCheckUtils]: 47: Hoare triple {1429#false} assume !false; {1429#false} is VALID [2020-07-18 04:57:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-18 04:57:47,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [153596780] [2020-07-18 04:57:47,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:57:47,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-18 04:57:47,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320493325] [2020-07-18 04:57:47,524 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2020-07-18 04:57:47,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:47,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 04:57:47,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:47,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 04:57:47,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:47,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 04:57:47,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-07-18 04:57:47,570 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 14 states. [2020-07-18 04:57:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:48,002 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2020-07-18 04:57:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-18 04:57:48,003 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2020-07-18 04:57:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 04:57:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2020-07-18 04:57:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 04:57:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2020-07-18 04:57:48,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 72 transitions. [2020-07-18 04:57:48,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:48,111 INFO L225 Difference]: With dead ends: 71 [2020-07-18 04:57:48,111 INFO L226 Difference]: Without dead ends: 51 [2020-07-18 04:57:48,112 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2020-07-18 04:57:48,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-18 04:57:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-07-18 04:57:48,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:48,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2020-07-18 04:57:48,162 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2020-07-18 04:57:48,162 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2020-07-18 04:57:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:48,166 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-07-18 04:57:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-07-18 04:57:48,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:48,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:48,167 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2020-07-18 04:57:48,167 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2020-07-18 04:57:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:48,170 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-07-18 04:57:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-07-18 04:57:48,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:48,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:48,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:48,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-18 04:57:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-07-18 04:57:48,174 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 48 [2020-07-18 04:57:48,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:48,174 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-07-18 04:57:48,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 04:57:48,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 51 transitions. [2020-07-18 04:57:48,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-18 04:57:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 04:57:48,233 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:48,233 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:57:48,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 04:57:48,233 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:48,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:48,234 INFO L82 PathProgramCache]: Analyzing trace with hash 485800496, now seen corresponding path program 4 times [2020-07-18 04:57:48,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:48,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763533070] [2020-07-18 04:57:48,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:48,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#true} assume true; {1882#true} is VALID [2020-07-18 04:57:48,283 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1882#true} {1882#true} #39#return; {1882#true} is VALID [2020-07-18 04:57:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:48,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#true} assume 0 == ~x; {1882#true} is VALID [2020-07-18 04:57:48,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {1882#true} #res := 0; {2025#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:48,549 INFO L280 TraceCheckUtils]: 3: Hoare triple {2025#(= 0 |id_#res|)} assume true; {2025#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:48,551 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2025#(= 0 |id_#res|)} {1882#true} #45#return; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:48,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,552 INFO L263 TraceCheckUtils]: 2: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,552 INFO L280 TraceCheckUtils]: 3: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,552 INFO L280 TraceCheckUtils]: 4: Hoare triple {1882#true} assume 0 == ~x; {1882#true} is VALID [2020-07-18 04:57:48,553 INFO L280 TraceCheckUtils]: 5: Hoare triple {1882#true} #res := 0; {2025#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:48,554 INFO L280 TraceCheckUtils]: 6: Hoare triple {2025#(= 0 |id_#res|)} assume true; {2025#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:48,555 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2025#(= 0 |id_#res|)} {1882#true} #45#return; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:48,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {2022#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:48,556 INFO L280 TraceCheckUtils]: 9: Hoare triple {2022#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,557 INFO L280 TraceCheckUtils]: 10: Hoare triple {2023#(<= id_~ret~0 1)} havoc #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,558 INFO L280 TraceCheckUtils]: 11: Hoare triple {2023#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,558 INFO L280 TraceCheckUtils]: 12: Hoare triple {2023#(<= id_~ret~0 1)} #res := ~ret~0; {2024#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:48,559 INFO L280 TraceCheckUtils]: 13: Hoare triple {2024#(<= |id_#res| 1)} assume true; {2024#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:48,561 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2024#(<= |id_#res| 1)} {1882#true} #45#return; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:48,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,562 INFO L263 TraceCheckUtils]: 2: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,562 INFO L280 TraceCheckUtils]: 3: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,563 INFO L280 TraceCheckUtils]: 4: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,563 INFO L263 TraceCheckUtils]: 5: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,563 INFO L280 TraceCheckUtils]: 6: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,564 INFO L280 TraceCheckUtils]: 7: Hoare triple {1882#true} assume 0 == ~x; {1882#true} is VALID [2020-07-18 04:57:48,565 INFO L280 TraceCheckUtils]: 8: Hoare triple {1882#true} #res := 0; {2025#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:48,565 INFO L280 TraceCheckUtils]: 9: Hoare triple {2025#(= 0 |id_#res|)} assume true; {2025#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:48,566 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2025#(= 0 |id_#res|)} {1882#true} #45#return; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:48,567 INFO L280 TraceCheckUtils]: 11: Hoare triple {2022#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:48,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {2022#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,568 INFO L280 TraceCheckUtils]: 13: Hoare triple {2023#(<= id_~ret~0 1)} havoc #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,569 INFO L280 TraceCheckUtils]: 14: Hoare triple {2023#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,570 INFO L280 TraceCheckUtils]: 15: Hoare triple {2023#(<= id_~ret~0 1)} #res := ~ret~0; {2024#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:48,570 INFO L280 TraceCheckUtils]: 16: Hoare triple {2024#(<= |id_#res| 1)} assume true; {2024#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:48,572 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2024#(<= |id_#res| 1)} {1882#true} #45#return; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:48,572 INFO L280 TraceCheckUtils]: 18: Hoare triple {2014#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:48,573 INFO L280 TraceCheckUtils]: 19: Hoare triple {2014#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {2015#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:48,574 INFO L280 TraceCheckUtils]: 20: Hoare triple {2015#(<= id_~ret~0 2)} havoc #t~ret0; {2015#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:48,574 INFO L280 TraceCheckUtils]: 21: Hoare triple {2015#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2015#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:48,575 INFO L280 TraceCheckUtils]: 22: Hoare triple {2015#(<= id_~ret~0 2)} #res := ~ret~0; {2016#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:48,575 INFO L280 TraceCheckUtils]: 23: Hoare triple {2016#(<= |id_#res| 2)} assume true; {2016#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:48,576 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2016#(<= |id_#res| 2)} {1882#true} #45#return; {1996#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:48,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,578 INFO L263 TraceCheckUtils]: 2: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,578 INFO L280 TraceCheckUtils]: 3: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,578 INFO L280 TraceCheckUtils]: 4: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,578 INFO L263 TraceCheckUtils]: 5: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,579 INFO L280 TraceCheckUtils]: 6: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,579 INFO L280 TraceCheckUtils]: 7: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,579 INFO L263 TraceCheckUtils]: 8: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,579 INFO L280 TraceCheckUtils]: 9: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,579 INFO L280 TraceCheckUtils]: 10: Hoare triple {1882#true} assume 0 == ~x; {1882#true} is VALID [2020-07-18 04:57:48,580 INFO L280 TraceCheckUtils]: 11: Hoare triple {1882#true} #res := 0; {2025#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:48,581 INFO L280 TraceCheckUtils]: 12: Hoare triple {2025#(= 0 |id_#res|)} assume true; {2025#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:48,582 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2025#(= 0 |id_#res|)} {1882#true} #45#return; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:48,583 INFO L280 TraceCheckUtils]: 14: Hoare triple {2022#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:48,584 INFO L280 TraceCheckUtils]: 15: Hoare triple {2022#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,584 INFO L280 TraceCheckUtils]: 16: Hoare triple {2023#(<= id_~ret~0 1)} havoc #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,585 INFO L280 TraceCheckUtils]: 17: Hoare triple {2023#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,586 INFO L280 TraceCheckUtils]: 18: Hoare triple {2023#(<= id_~ret~0 1)} #res := ~ret~0; {2024#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:48,586 INFO L280 TraceCheckUtils]: 19: Hoare triple {2024#(<= |id_#res| 1)} assume true; {2024#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:48,588 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2024#(<= |id_#res| 1)} {1882#true} #45#return; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:48,588 INFO L280 TraceCheckUtils]: 21: Hoare triple {2014#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:48,589 INFO L280 TraceCheckUtils]: 22: Hoare triple {2014#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {2015#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:48,590 INFO L280 TraceCheckUtils]: 23: Hoare triple {2015#(<= id_~ret~0 2)} havoc #t~ret0; {2015#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:48,591 INFO L280 TraceCheckUtils]: 24: Hoare triple {2015#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2015#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:48,592 INFO L280 TraceCheckUtils]: 25: Hoare triple {2015#(<= id_~ret~0 2)} #res := ~ret~0; {2016#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:48,593 INFO L280 TraceCheckUtils]: 26: Hoare triple {2016#(<= |id_#res| 2)} assume true; {2016#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:48,594 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2016#(<= |id_#res| 2)} {1882#true} #45#return; {1996#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:48,595 INFO L280 TraceCheckUtils]: 28: Hoare triple {1996#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1996#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:48,595 INFO L280 TraceCheckUtils]: 29: Hoare triple {1996#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {1997#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:48,596 INFO L280 TraceCheckUtils]: 30: Hoare triple {1997#(<= id_~ret~0 3)} havoc #t~ret0; {1997#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:48,597 INFO L280 TraceCheckUtils]: 31: Hoare triple {1997#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {1997#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:48,598 INFO L280 TraceCheckUtils]: 32: Hoare triple {1997#(<= id_~ret~0 3)} #res := ~ret~0; {1998#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:48,598 INFO L280 TraceCheckUtils]: 33: Hoare triple {1998#(<= |id_#res| 3)} assume true; {1998#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:48,599 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1998#(<= |id_#res| 3)} {1882#true} #45#return; {1968#(<= |id_#t~ret0| 3)} is VALID [2020-07-18 04:57:48,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,602 INFO L263 TraceCheckUtils]: 2: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,602 INFO L280 TraceCheckUtils]: 3: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,602 INFO L263 TraceCheckUtils]: 5: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,603 INFO L280 TraceCheckUtils]: 7: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,607 INFO L263 TraceCheckUtils]: 8: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,607 INFO L280 TraceCheckUtils]: 10: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,608 INFO L263 TraceCheckUtils]: 11: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,608 INFO L280 TraceCheckUtils]: 12: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,608 INFO L280 TraceCheckUtils]: 13: Hoare triple {1882#true} assume 0 == ~x; {1882#true} is VALID [2020-07-18 04:57:48,610 INFO L280 TraceCheckUtils]: 14: Hoare triple {1882#true} #res := 0; {2025#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:48,610 INFO L280 TraceCheckUtils]: 15: Hoare triple {2025#(= 0 |id_#res|)} assume true; {2025#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:48,611 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2025#(= 0 |id_#res|)} {1882#true} #45#return; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:48,612 INFO L280 TraceCheckUtils]: 17: Hoare triple {2022#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:48,613 INFO L280 TraceCheckUtils]: 18: Hoare triple {2022#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,613 INFO L280 TraceCheckUtils]: 19: Hoare triple {2023#(<= id_~ret~0 1)} havoc #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,614 INFO L280 TraceCheckUtils]: 20: Hoare triple {2023#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,614 INFO L280 TraceCheckUtils]: 21: Hoare triple {2023#(<= id_~ret~0 1)} #res := ~ret~0; {2024#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:48,615 INFO L280 TraceCheckUtils]: 22: Hoare triple {2024#(<= |id_#res| 1)} assume true; {2024#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:48,616 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2024#(<= |id_#res| 1)} {1882#true} #45#return; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:48,617 INFO L280 TraceCheckUtils]: 24: Hoare triple {2014#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:48,617 INFO L280 TraceCheckUtils]: 25: Hoare triple {2014#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {2015#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:48,618 INFO L280 TraceCheckUtils]: 26: Hoare triple {2015#(<= id_~ret~0 2)} havoc #t~ret0; {2015#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:48,619 INFO L280 TraceCheckUtils]: 27: Hoare triple {2015#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2015#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:48,619 INFO L280 TraceCheckUtils]: 28: Hoare triple {2015#(<= id_~ret~0 2)} #res := ~ret~0; {2016#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:48,620 INFO L280 TraceCheckUtils]: 29: Hoare triple {2016#(<= |id_#res| 2)} assume true; {2016#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:48,621 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2016#(<= |id_#res| 2)} {1882#true} #45#return; {1996#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:48,622 INFO L280 TraceCheckUtils]: 31: Hoare triple {1996#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1996#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:48,623 INFO L280 TraceCheckUtils]: 32: Hoare triple {1996#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {1997#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:48,624 INFO L280 TraceCheckUtils]: 33: Hoare triple {1997#(<= id_~ret~0 3)} havoc #t~ret0; {1997#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:48,624 INFO L280 TraceCheckUtils]: 34: Hoare triple {1997#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {1997#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:48,625 INFO L280 TraceCheckUtils]: 35: Hoare triple {1997#(<= id_~ret~0 3)} #res := ~ret~0; {1998#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:48,626 INFO L280 TraceCheckUtils]: 36: Hoare triple {1998#(<= |id_#res| 3)} assume true; {1998#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:48,627 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1998#(<= |id_#res| 3)} {1882#true} #45#return; {1968#(<= |id_#t~ret0| 3)} is VALID [2020-07-18 04:57:48,627 INFO L280 TraceCheckUtils]: 38: Hoare triple {1968#(<= |id_#t~ret0| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1968#(<= |id_#t~ret0| 3)} is VALID [2020-07-18 04:57:48,628 INFO L280 TraceCheckUtils]: 39: Hoare triple {1968#(<= |id_#t~ret0| 3)} ~ret~0 := 1 + #t~ret0; {1969#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:48,629 INFO L280 TraceCheckUtils]: 40: Hoare triple {1969#(<= id_~ret~0 4)} havoc #t~ret0; {1969#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:48,629 INFO L280 TraceCheckUtils]: 41: Hoare triple {1969#(<= id_~ret~0 4)} assume !(~ret~0 > 5); {1969#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:48,630 INFO L280 TraceCheckUtils]: 42: Hoare triple {1969#(<= id_~ret~0 4)} #res := ~ret~0; {1970#(<= |id_#res| 4)} is VALID [2020-07-18 04:57:48,631 INFO L280 TraceCheckUtils]: 43: Hoare triple {1970#(<= |id_#res| 4)} assume true; {1970#(<= |id_#res| 4)} is VALID [2020-07-18 04:57:48,632 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1970#(<= |id_#res| 4)} {1882#true} #43#return; {1931#(<= |main_#t~ret2| 4)} is VALID [2020-07-18 04:57:48,634 INFO L263 TraceCheckUtils]: 0: Hoare triple {1882#true} call ULTIMATE.init(); {1882#true} is VALID [2020-07-18 04:57:48,634 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#true} assume true; {1882#true} is VALID [2020-07-18 04:57:48,635 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1882#true} {1882#true} #39#return; {1882#true} is VALID [2020-07-18 04:57:48,635 INFO L263 TraceCheckUtils]: 3: Hoare triple {1882#true} call #t~ret3 := main(); {1882#true} is VALID [2020-07-18 04:57:48,635 INFO L280 TraceCheckUtils]: 4: Hoare triple {1882#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1882#true} is VALID [2020-07-18 04:57:48,635 INFO L280 TraceCheckUtils]: 5: Hoare triple {1882#true} ~input~0 := #t~nondet1; {1882#true} is VALID [2020-07-18 04:57:48,635 INFO L280 TraceCheckUtils]: 6: Hoare triple {1882#true} havoc #t~nondet1; {1882#true} is VALID [2020-07-18 04:57:48,636 INFO L263 TraceCheckUtils]: 7: Hoare triple {1882#true} call #t~ret2 := id(~input~0); {1882#true} is VALID [2020-07-18 04:57:48,636 INFO L280 TraceCheckUtils]: 8: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,636 INFO L280 TraceCheckUtils]: 9: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,636 INFO L263 TraceCheckUtils]: 10: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,636 INFO L280 TraceCheckUtils]: 11: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,637 INFO L280 TraceCheckUtils]: 12: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,637 INFO L263 TraceCheckUtils]: 13: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,637 INFO L280 TraceCheckUtils]: 14: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,637 INFO L280 TraceCheckUtils]: 15: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,637 INFO L263 TraceCheckUtils]: 16: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,638 INFO L280 TraceCheckUtils]: 17: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,638 INFO L280 TraceCheckUtils]: 18: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-18 04:57:48,638 INFO L263 TraceCheckUtils]: 19: Hoare triple {1882#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1882#true} is VALID [2020-07-18 04:57:48,638 INFO L280 TraceCheckUtils]: 20: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-18 04:57:48,638 INFO L280 TraceCheckUtils]: 21: Hoare triple {1882#true} assume 0 == ~x; {1882#true} is VALID [2020-07-18 04:57:48,640 INFO L280 TraceCheckUtils]: 22: Hoare triple {1882#true} #res := 0; {2025#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:48,640 INFO L280 TraceCheckUtils]: 23: Hoare triple {2025#(= 0 |id_#res|)} assume true; {2025#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:48,641 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2025#(= 0 |id_#res|)} {1882#true} #45#return; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:48,642 INFO L280 TraceCheckUtils]: 25: Hoare triple {2022#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:48,642 INFO L280 TraceCheckUtils]: 26: Hoare triple {2022#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,643 INFO L280 TraceCheckUtils]: 27: Hoare triple {2023#(<= id_~ret~0 1)} havoc #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,643 INFO L280 TraceCheckUtils]: 28: Hoare triple {2023#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2023#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:48,644 INFO L280 TraceCheckUtils]: 29: Hoare triple {2023#(<= id_~ret~0 1)} #res := ~ret~0; {2024#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:48,644 INFO L280 TraceCheckUtils]: 30: Hoare triple {2024#(<= |id_#res| 1)} assume true; {2024#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:48,645 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2024#(<= |id_#res| 1)} {1882#true} #45#return; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:48,646 INFO L280 TraceCheckUtils]: 32: Hoare triple {2014#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:48,647 INFO L280 TraceCheckUtils]: 33: Hoare triple {2014#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {2015#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:48,647 INFO L280 TraceCheckUtils]: 34: Hoare triple {2015#(<= id_~ret~0 2)} havoc #t~ret0; {2015#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:48,648 INFO L280 TraceCheckUtils]: 35: Hoare triple {2015#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2015#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:48,648 INFO L280 TraceCheckUtils]: 36: Hoare triple {2015#(<= id_~ret~0 2)} #res := ~ret~0; {2016#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:48,649 INFO L280 TraceCheckUtils]: 37: Hoare triple {2016#(<= |id_#res| 2)} assume true; {2016#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:48,650 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2016#(<= |id_#res| 2)} {1882#true} #45#return; {1996#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:48,650 INFO L280 TraceCheckUtils]: 39: Hoare triple {1996#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1996#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:48,651 INFO L280 TraceCheckUtils]: 40: Hoare triple {1996#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {1997#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:48,652 INFO L280 TraceCheckUtils]: 41: Hoare triple {1997#(<= id_~ret~0 3)} havoc #t~ret0; {1997#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:48,652 INFO L280 TraceCheckUtils]: 42: Hoare triple {1997#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {1997#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:48,653 INFO L280 TraceCheckUtils]: 43: Hoare triple {1997#(<= id_~ret~0 3)} #res := ~ret~0; {1998#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:48,653 INFO L280 TraceCheckUtils]: 44: Hoare triple {1998#(<= |id_#res| 3)} assume true; {1998#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:48,654 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1998#(<= |id_#res| 3)} {1882#true} #45#return; {1968#(<= |id_#t~ret0| 3)} is VALID [2020-07-18 04:57:48,655 INFO L280 TraceCheckUtils]: 46: Hoare triple {1968#(<= |id_#t~ret0| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1968#(<= |id_#t~ret0| 3)} is VALID [2020-07-18 04:57:48,655 INFO L280 TraceCheckUtils]: 47: Hoare triple {1968#(<= |id_#t~ret0| 3)} ~ret~0 := 1 + #t~ret0; {1969#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:48,656 INFO L280 TraceCheckUtils]: 48: Hoare triple {1969#(<= id_~ret~0 4)} havoc #t~ret0; {1969#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:48,656 INFO L280 TraceCheckUtils]: 49: Hoare triple {1969#(<= id_~ret~0 4)} assume !(~ret~0 > 5); {1969#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:48,657 INFO L280 TraceCheckUtils]: 50: Hoare triple {1969#(<= id_~ret~0 4)} #res := ~ret~0; {1970#(<= |id_#res| 4)} is VALID [2020-07-18 04:57:48,657 INFO L280 TraceCheckUtils]: 51: Hoare triple {1970#(<= |id_#res| 4)} assume true; {1970#(<= |id_#res| 4)} is VALID [2020-07-18 04:57:48,658 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1970#(<= |id_#res| 4)} {1882#true} #43#return; {1931#(<= |main_#t~ret2| 4)} is VALID [2020-07-18 04:57:48,659 INFO L280 TraceCheckUtils]: 53: Hoare triple {1931#(<= |main_#t~ret2| 4)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1931#(<= |main_#t~ret2| 4)} is VALID [2020-07-18 04:57:48,659 INFO L280 TraceCheckUtils]: 54: Hoare triple {1931#(<= |main_#t~ret2| 4)} ~result~0 := #t~ret2; {1932#(<= main_~result~0 4)} is VALID [2020-07-18 04:57:48,660 INFO L280 TraceCheckUtils]: 55: Hoare triple {1932#(<= main_~result~0 4)} havoc #t~ret2; {1932#(<= main_~result~0 4)} is VALID [2020-07-18 04:57:48,660 INFO L280 TraceCheckUtils]: 56: Hoare triple {1932#(<= main_~result~0 4)} assume 10 == ~result~0; {1883#false} is VALID [2020-07-18 04:57:48,661 INFO L280 TraceCheckUtils]: 57: Hoare triple {1883#false} assume !false; {1883#false} is VALID [2020-07-18 04:57:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-18 04:57:48,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763533070] [2020-07-18 04:57:48,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:57:48,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-18 04:57:48,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490430370] [2020-07-18 04:57:48,665 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2020-07-18 04:57:48,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:48,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-18 04:57:48,714 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 04:57:48,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-18 04:57:48,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:48,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-18 04:57:48,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-07-18 04:57:48,715 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 17 states. [2020-07-18 04:57:49,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:49,308 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2020-07-18 04:57:49,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-18 04:57:49,308 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2020-07-18 04:57:49,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-18 04:57:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2020-07-18 04:57:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-18 04:57:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2020-07-18 04:57:49,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 79 transitions. [2020-07-18 04:57:49,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:49,422 INFO L225 Difference]: With dead ends: 78 [2020-07-18 04:57:49,422 INFO L226 Difference]: Without dead ends: 58 [2020-07-18 04:57:49,424 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2020-07-18 04:57:49,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-18 04:57:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2020-07-18 04:57:49,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:49,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2020-07-18 04:57:49,487 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2020-07-18 04:57:49,487 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2020-07-18 04:57:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:49,492 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2020-07-18 04:57:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-07-18 04:57:49,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:49,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:49,493 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2020-07-18 04:57:49,493 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2020-07-18 04:57:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:49,497 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2020-07-18 04:57:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-07-18 04:57:49,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:49,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:49,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:49,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-18 04:57:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2020-07-18 04:57:49,500 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 58 [2020-07-18 04:57:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:49,501 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2020-07-18 04:57:49,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-18 04:57:49,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 58 transitions. [2020-07-18 04:57:49,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:49,575 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-07-18 04:57:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-18 04:57:49,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:49,577 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:57:49,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 04:57:49,577 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:49,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1938626529, now seen corresponding path program 5 times [2020-07-18 04:57:49,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:49,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2025172607] [2020-07-18 04:57:49,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:49,656 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} assume true; {2430#true} is VALID [2020-07-18 04:57:49,656 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2430#true} {2430#true} #39#return; {2430#true} is VALID [2020-07-18 04:57:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:50,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-18 04:57:50,024 INFO L280 TraceCheckUtils]: 2: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,024 INFO L280 TraceCheckUtils]: 3: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,026 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,027 INFO L263 TraceCheckUtils]: 2: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,027 INFO L280 TraceCheckUtils]: 3: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,028 INFO L280 TraceCheckUtils]: 4: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-18 04:57:50,029 INFO L280 TraceCheckUtils]: 5: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,029 INFO L280 TraceCheckUtils]: 6: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,031 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,032 INFO L280 TraceCheckUtils]: 8: Hoare triple {2628#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,032 INFO L280 TraceCheckUtils]: 9: Hoare triple {2628#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,033 INFO L280 TraceCheckUtils]: 10: Hoare triple {2629#(<= id_~ret~0 1)} havoc #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,034 INFO L280 TraceCheckUtils]: 11: Hoare triple {2629#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,035 INFO L280 TraceCheckUtils]: 12: Hoare triple {2629#(<= id_~ret~0 1)} #res := ~ret~0; {2630#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:50,036 INFO L280 TraceCheckUtils]: 13: Hoare triple {2630#(<= |id_#res| 1)} assume true; {2630#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:50,037 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2630#(<= |id_#res| 1)} {2430#true} #45#return; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:50,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,038 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,038 INFO L263 TraceCheckUtils]: 2: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,039 INFO L280 TraceCheckUtils]: 3: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,039 INFO L280 TraceCheckUtils]: 4: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,039 INFO L263 TraceCheckUtils]: 5: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,039 INFO L280 TraceCheckUtils]: 6: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,040 INFO L280 TraceCheckUtils]: 7: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-18 04:57:50,041 INFO L280 TraceCheckUtils]: 8: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,042 INFO L280 TraceCheckUtils]: 9: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,043 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,055 INFO L280 TraceCheckUtils]: 11: Hoare triple {2628#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,056 INFO L280 TraceCheckUtils]: 12: Hoare triple {2628#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,057 INFO L280 TraceCheckUtils]: 13: Hoare triple {2629#(<= id_~ret~0 1)} havoc #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,058 INFO L280 TraceCheckUtils]: 14: Hoare triple {2629#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,059 INFO L280 TraceCheckUtils]: 15: Hoare triple {2629#(<= id_~ret~0 1)} #res := ~ret~0; {2630#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:50,060 INFO L280 TraceCheckUtils]: 16: Hoare triple {2630#(<= |id_#res| 1)} assume true; {2630#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:50,061 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2630#(<= |id_#res| 1)} {2430#true} #45#return; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:50,062 INFO L280 TraceCheckUtils]: 18: Hoare triple {2620#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:50,063 INFO L280 TraceCheckUtils]: 19: Hoare triple {2620#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,063 INFO L280 TraceCheckUtils]: 20: Hoare triple {2621#(<= id_~ret~0 2)} havoc #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,064 INFO L280 TraceCheckUtils]: 21: Hoare triple {2621#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,065 INFO L280 TraceCheckUtils]: 22: Hoare triple {2621#(<= id_~ret~0 2)} #res := ~ret~0; {2622#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:50,065 INFO L280 TraceCheckUtils]: 23: Hoare triple {2622#(<= |id_#res| 2)} assume true; {2622#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:50,068 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2622#(<= |id_#res| 2)} {2430#true} #45#return; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:50,069 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,070 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,070 INFO L263 TraceCheckUtils]: 2: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,070 INFO L280 TraceCheckUtils]: 3: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,071 INFO L280 TraceCheckUtils]: 4: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,071 INFO L263 TraceCheckUtils]: 5: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,071 INFO L280 TraceCheckUtils]: 6: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,072 INFO L280 TraceCheckUtils]: 7: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,072 INFO L263 TraceCheckUtils]: 8: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,072 INFO L280 TraceCheckUtils]: 9: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,079 INFO L280 TraceCheckUtils]: 10: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-18 04:57:50,095 INFO L280 TraceCheckUtils]: 11: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,095 INFO L280 TraceCheckUtils]: 12: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,097 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,097 INFO L280 TraceCheckUtils]: 14: Hoare triple {2628#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,098 INFO L280 TraceCheckUtils]: 15: Hoare triple {2628#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,098 INFO L280 TraceCheckUtils]: 16: Hoare triple {2629#(<= id_~ret~0 1)} havoc #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,099 INFO L280 TraceCheckUtils]: 17: Hoare triple {2629#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,099 INFO L280 TraceCheckUtils]: 18: Hoare triple {2629#(<= id_~ret~0 1)} #res := ~ret~0; {2630#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:50,100 INFO L280 TraceCheckUtils]: 19: Hoare triple {2630#(<= |id_#res| 1)} assume true; {2630#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:50,101 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2630#(<= |id_#res| 1)} {2430#true} #45#return; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:50,101 INFO L280 TraceCheckUtils]: 21: Hoare triple {2620#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:50,102 INFO L280 TraceCheckUtils]: 22: Hoare triple {2620#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,103 INFO L280 TraceCheckUtils]: 23: Hoare triple {2621#(<= id_~ret~0 2)} havoc #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,103 INFO L280 TraceCheckUtils]: 24: Hoare triple {2621#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,104 INFO L280 TraceCheckUtils]: 25: Hoare triple {2621#(<= id_~ret~0 2)} #res := ~ret~0; {2622#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:50,104 INFO L280 TraceCheckUtils]: 26: Hoare triple {2622#(<= |id_#res| 2)} assume true; {2622#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:50,105 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2622#(<= |id_#res| 2)} {2430#true} #45#return; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:50,106 INFO L280 TraceCheckUtils]: 28: Hoare triple {2602#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:50,106 INFO L280 TraceCheckUtils]: 29: Hoare triple {2602#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {2603#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:50,107 INFO L280 TraceCheckUtils]: 30: Hoare triple {2603#(<= id_~ret~0 3)} havoc #t~ret0; {2603#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:50,108 INFO L280 TraceCheckUtils]: 31: Hoare triple {2603#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {2603#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:50,108 INFO L280 TraceCheckUtils]: 32: Hoare triple {2603#(<= id_~ret~0 3)} #res := ~ret~0; {2604#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:50,109 INFO L280 TraceCheckUtils]: 33: Hoare triple {2604#(<= |id_#res| 3)} assume true; {2604#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:50,110 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2604#(<= |id_#res| 3)} {2430#true} #45#return; {2574#(<= |id_#t~ret0| 3)} is VALID [2020-07-18 04:57:50,111 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,111 INFO L263 TraceCheckUtils]: 2: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,112 INFO L280 TraceCheckUtils]: 3: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,112 INFO L280 TraceCheckUtils]: 4: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,112 INFO L263 TraceCheckUtils]: 5: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,112 INFO L280 TraceCheckUtils]: 6: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,112 INFO L280 TraceCheckUtils]: 7: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,113 INFO L263 TraceCheckUtils]: 8: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,113 INFO L280 TraceCheckUtils]: 9: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,113 INFO L280 TraceCheckUtils]: 10: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,113 INFO L263 TraceCheckUtils]: 11: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,113 INFO L280 TraceCheckUtils]: 12: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,114 INFO L280 TraceCheckUtils]: 13: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-18 04:57:50,115 INFO L280 TraceCheckUtils]: 14: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,115 INFO L280 TraceCheckUtils]: 15: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,116 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,117 INFO L280 TraceCheckUtils]: 17: Hoare triple {2628#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,117 INFO L280 TraceCheckUtils]: 18: Hoare triple {2628#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,118 INFO L280 TraceCheckUtils]: 19: Hoare triple {2629#(<= id_~ret~0 1)} havoc #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,118 INFO L280 TraceCheckUtils]: 20: Hoare triple {2629#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,119 INFO L280 TraceCheckUtils]: 21: Hoare triple {2629#(<= id_~ret~0 1)} #res := ~ret~0; {2630#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:50,119 INFO L280 TraceCheckUtils]: 22: Hoare triple {2630#(<= |id_#res| 1)} assume true; {2630#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:50,120 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2630#(<= |id_#res| 1)} {2430#true} #45#return; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:50,121 INFO L280 TraceCheckUtils]: 24: Hoare triple {2620#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:50,122 INFO L280 TraceCheckUtils]: 25: Hoare triple {2620#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,122 INFO L280 TraceCheckUtils]: 26: Hoare triple {2621#(<= id_~ret~0 2)} havoc #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,123 INFO L280 TraceCheckUtils]: 27: Hoare triple {2621#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,123 INFO L280 TraceCheckUtils]: 28: Hoare triple {2621#(<= id_~ret~0 2)} #res := ~ret~0; {2622#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:50,124 INFO L280 TraceCheckUtils]: 29: Hoare triple {2622#(<= |id_#res| 2)} assume true; {2622#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:50,125 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2622#(<= |id_#res| 2)} {2430#true} #45#return; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:50,125 INFO L280 TraceCheckUtils]: 31: Hoare triple {2602#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:50,126 INFO L280 TraceCheckUtils]: 32: Hoare triple {2602#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {2603#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:50,127 INFO L280 TraceCheckUtils]: 33: Hoare triple {2603#(<= id_~ret~0 3)} havoc #t~ret0; {2603#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:50,127 INFO L280 TraceCheckUtils]: 34: Hoare triple {2603#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {2603#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:50,128 INFO L280 TraceCheckUtils]: 35: Hoare triple {2603#(<= id_~ret~0 3)} #res := ~ret~0; {2604#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:50,128 INFO L280 TraceCheckUtils]: 36: Hoare triple {2604#(<= |id_#res| 3)} assume true; {2604#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:50,129 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2604#(<= |id_#res| 3)} {2430#true} #45#return; {2574#(<= |id_#t~ret0| 3)} is VALID [2020-07-18 04:57:50,130 INFO L280 TraceCheckUtils]: 38: Hoare triple {2574#(<= |id_#t~ret0| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2574#(<= |id_#t~ret0| 3)} is VALID [2020-07-18 04:57:50,130 INFO L280 TraceCheckUtils]: 39: Hoare triple {2574#(<= |id_#t~ret0| 3)} ~ret~0 := 1 + #t~ret0; {2575#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:50,131 INFO L280 TraceCheckUtils]: 40: Hoare triple {2575#(<= id_~ret~0 4)} havoc #t~ret0; {2575#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:50,132 INFO L280 TraceCheckUtils]: 41: Hoare triple {2575#(<= id_~ret~0 4)} assume !(~ret~0 > 5); {2575#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:50,132 INFO L280 TraceCheckUtils]: 42: Hoare triple {2575#(<= id_~ret~0 4)} #res := ~ret~0; {2576#(<= |id_#res| 4)} is VALID [2020-07-18 04:57:50,133 INFO L280 TraceCheckUtils]: 43: Hoare triple {2576#(<= |id_#res| 4)} assume true; {2576#(<= |id_#res| 4)} is VALID [2020-07-18 04:57:50,134 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2576#(<= |id_#res| 4)} {2430#true} #45#return; {2536#(<= |id_#t~ret0| 4)} is VALID [2020-07-18 04:57:50,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,137 INFO L263 TraceCheckUtils]: 2: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,137 INFO L280 TraceCheckUtils]: 3: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,137 INFO L280 TraceCheckUtils]: 4: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,138 INFO L263 TraceCheckUtils]: 5: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,138 INFO L280 TraceCheckUtils]: 6: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,138 INFO L280 TraceCheckUtils]: 7: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,138 INFO L263 TraceCheckUtils]: 8: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,138 INFO L280 TraceCheckUtils]: 9: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,138 INFO L280 TraceCheckUtils]: 10: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,139 INFO L263 TraceCheckUtils]: 11: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,139 INFO L280 TraceCheckUtils]: 12: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,139 INFO L280 TraceCheckUtils]: 13: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,139 INFO L263 TraceCheckUtils]: 14: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,139 INFO L280 TraceCheckUtils]: 15: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,140 INFO L280 TraceCheckUtils]: 16: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-18 04:57:50,141 INFO L280 TraceCheckUtils]: 17: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,141 INFO L280 TraceCheckUtils]: 18: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,142 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,143 INFO L280 TraceCheckUtils]: 20: Hoare triple {2628#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,143 INFO L280 TraceCheckUtils]: 21: Hoare triple {2628#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,144 INFO L280 TraceCheckUtils]: 22: Hoare triple {2629#(<= id_~ret~0 1)} havoc #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,144 INFO L280 TraceCheckUtils]: 23: Hoare triple {2629#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,145 INFO L280 TraceCheckUtils]: 24: Hoare triple {2629#(<= id_~ret~0 1)} #res := ~ret~0; {2630#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:50,146 INFO L280 TraceCheckUtils]: 25: Hoare triple {2630#(<= |id_#res| 1)} assume true; {2630#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:50,147 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2630#(<= |id_#res| 1)} {2430#true} #45#return; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:50,147 INFO L280 TraceCheckUtils]: 27: Hoare triple {2620#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:50,148 INFO L280 TraceCheckUtils]: 28: Hoare triple {2620#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,149 INFO L280 TraceCheckUtils]: 29: Hoare triple {2621#(<= id_~ret~0 2)} havoc #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,149 INFO L280 TraceCheckUtils]: 30: Hoare triple {2621#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,150 INFO L280 TraceCheckUtils]: 31: Hoare triple {2621#(<= id_~ret~0 2)} #res := ~ret~0; {2622#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:50,151 INFO L280 TraceCheckUtils]: 32: Hoare triple {2622#(<= |id_#res| 2)} assume true; {2622#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:50,152 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2622#(<= |id_#res| 2)} {2430#true} #45#return; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:50,152 INFO L280 TraceCheckUtils]: 34: Hoare triple {2602#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:50,153 INFO L280 TraceCheckUtils]: 35: Hoare triple {2602#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {2603#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:50,154 INFO L280 TraceCheckUtils]: 36: Hoare triple {2603#(<= id_~ret~0 3)} havoc #t~ret0; {2603#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:50,155 INFO L280 TraceCheckUtils]: 37: Hoare triple {2603#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {2603#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:50,156 INFO L280 TraceCheckUtils]: 38: Hoare triple {2603#(<= id_~ret~0 3)} #res := ~ret~0; {2604#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:50,156 INFO L280 TraceCheckUtils]: 39: Hoare triple {2604#(<= |id_#res| 3)} assume true; {2604#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:50,157 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2604#(<= |id_#res| 3)} {2430#true} #45#return; {2574#(<= |id_#t~ret0| 3)} is VALID [2020-07-18 04:57:50,158 INFO L280 TraceCheckUtils]: 41: Hoare triple {2574#(<= |id_#t~ret0| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2574#(<= |id_#t~ret0| 3)} is VALID [2020-07-18 04:57:50,159 INFO L280 TraceCheckUtils]: 42: Hoare triple {2574#(<= |id_#t~ret0| 3)} ~ret~0 := 1 + #t~ret0; {2575#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:50,159 INFO L280 TraceCheckUtils]: 43: Hoare triple {2575#(<= id_~ret~0 4)} havoc #t~ret0; {2575#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:50,160 INFO L280 TraceCheckUtils]: 44: Hoare triple {2575#(<= id_~ret~0 4)} assume !(~ret~0 > 5); {2575#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:50,160 INFO L280 TraceCheckUtils]: 45: Hoare triple {2575#(<= id_~ret~0 4)} #res := ~ret~0; {2576#(<= |id_#res| 4)} is VALID [2020-07-18 04:57:50,161 INFO L280 TraceCheckUtils]: 46: Hoare triple {2576#(<= |id_#res| 4)} assume true; {2576#(<= |id_#res| 4)} is VALID [2020-07-18 04:57:50,162 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2576#(<= |id_#res| 4)} {2430#true} #45#return; {2536#(<= |id_#t~ret0| 4)} is VALID [2020-07-18 04:57:50,163 INFO L280 TraceCheckUtils]: 48: Hoare triple {2536#(<= |id_#t~ret0| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2536#(<= |id_#t~ret0| 4)} is VALID [2020-07-18 04:57:50,164 INFO L280 TraceCheckUtils]: 49: Hoare triple {2536#(<= |id_#t~ret0| 4)} ~ret~0 := 1 + #t~ret0; {2537#(<= id_~ret~0 5)} is VALID [2020-07-18 04:57:50,164 INFO L280 TraceCheckUtils]: 50: Hoare triple {2537#(<= id_~ret~0 5)} havoc #t~ret0; {2537#(<= id_~ret~0 5)} is VALID [2020-07-18 04:57:50,165 INFO L280 TraceCheckUtils]: 51: Hoare triple {2537#(<= id_~ret~0 5)} assume !(~ret~0 > 5); {2537#(<= id_~ret~0 5)} is VALID [2020-07-18 04:57:50,165 INFO L280 TraceCheckUtils]: 52: Hoare triple {2537#(<= id_~ret~0 5)} #res := ~ret~0; {2538#(<= |id_#res| 5)} is VALID [2020-07-18 04:57:50,166 INFO L280 TraceCheckUtils]: 53: Hoare triple {2538#(<= |id_#res| 5)} assume true; {2538#(<= |id_#res| 5)} is VALID [2020-07-18 04:57:50,166 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {2538#(<= |id_#res| 5)} {2430#true} #43#return; {2489#(<= |main_#t~ret2| 5)} is VALID [2020-07-18 04:57:50,169 INFO L263 TraceCheckUtils]: 0: Hoare triple {2430#true} call ULTIMATE.init(); {2430#true} is VALID [2020-07-18 04:57:50,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume true; {2430#true} is VALID [2020-07-18 04:57:50,170 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2430#true} {2430#true} #39#return; {2430#true} is VALID [2020-07-18 04:57:50,170 INFO L263 TraceCheckUtils]: 3: Hoare triple {2430#true} call #t~ret3 := main(); {2430#true} is VALID [2020-07-18 04:57:50,170 INFO L280 TraceCheckUtils]: 4: Hoare triple {2430#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2430#true} is VALID [2020-07-18 04:57:50,170 INFO L280 TraceCheckUtils]: 5: Hoare triple {2430#true} ~input~0 := #t~nondet1; {2430#true} is VALID [2020-07-18 04:57:50,171 INFO L280 TraceCheckUtils]: 6: Hoare triple {2430#true} havoc #t~nondet1; {2430#true} is VALID [2020-07-18 04:57:50,172 INFO L263 TraceCheckUtils]: 7: Hoare triple {2430#true} call #t~ret2 := id(~input~0); {2430#true} is VALID [2020-07-18 04:57:50,172 INFO L280 TraceCheckUtils]: 8: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,172 INFO L280 TraceCheckUtils]: 9: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,172 INFO L263 TraceCheckUtils]: 10: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,173 INFO L280 TraceCheckUtils]: 11: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,173 INFO L280 TraceCheckUtils]: 12: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,173 INFO L263 TraceCheckUtils]: 13: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,173 INFO L280 TraceCheckUtils]: 14: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,173 INFO L280 TraceCheckUtils]: 15: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,173 INFO L263 TraceCheckUtils]: 16: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,174 INFO L280 TraceCheckUtils]: 17: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,174 INFO L280 TraceCheckUtils]: 18: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,174 INFO L263 TraceCheckUtils]: 19: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,174 INFO L280 TraceCheckUtils]: 20: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,174 INFO L280 TraceCheckUtils]: 21: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-18 04:57:50,174 INFO L263 TraceCheckUtils]: 22: Hoare triple {2430#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {2430#true} is VALID [2020-07-18 04:57:50,175 INFO L280 TraceCheckUtils]: 23: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-18 04:57:50,175 INFO L280 TraceCheckUtils]: 24: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-18 04:57:50,177 INFO L280 TraceCheckUtils]: 25: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,177 INFO L280 TraceCheckUtils]: 26: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:50,178 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,179 INFO L280 TraceCheckUtils]: 28: Hoare triple {2628#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:50,179 INFO L280 TraceCheckUtils]: 29: Hoare triple {2628#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,180 INFO L280 TraceCheckUtils]: 30: Hoare triple {2629#(<= id_~ret~0 1)} havoc #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,180 INFO L280 TraceCheckUtils]: 31: Hoare triple {2629#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2629#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:50,181 INFO L280 TraceCheckUtils]: 32: Hoare triple {2629#(<= id_~ret~0 1)} #res := ~ret~0; {2630#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:50,181 INFO L280 TraceCheckUtils]: 33: Hoare triple {2630#(<= |id_#res| 1)} assume true; {2630#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:50,182 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2630#(<= |id_#res| 1)} {2430#true} #45#return; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:50,183 INFO L280 TraceCheckUtils]: 35: Hoare triple {2620#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:50,184 INFO L280 TraceCheckUtils]: 36: Hoare triple {2620#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,184 INFO L280 TraceCheckUtils]: 37: Hoare triple {2621#(<= id_~ret~0 2)} havoc #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,185 INFO L280 TraceCheckUtils]: 38: Hoare triple {2621#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2621#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:50,185 INFO L280 TraceCheckUtils]: 39: Hoare triple {2621#(<= id_~ret~0 2)} #res := ~ret~0; {2622#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:50,186 INFO L280 TraceCheckUtils]: 40: Hoare triple {2622#(<= |id_#res| 2)} assume true; {2622#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:50,187 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2622#(<= |id_#res| 2)} {2430#true} #45#return; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:50,187 INFO L280 TraceCheckUtils]: 42: Hoare triple {2602#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:50,188 INFO L280 TraceCheckUtils]: 43: Hoare triple {2602#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {2603#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:50,188 INFO L280 TraceCheckUtils]: 44: Hoare triple {2603#(<= id_~ret~0 3)} havoc #t~ret0; {2603#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:50,189 INFO L280 TraceCheckUtils]: 45: Hoare triple {2603#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {2603#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:50,189 INFO L280 TraceCheckUtils]: 46: Hoare triple {2603#(<= id_~ret~0 3)} #res := ~ret~0; {2604#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:50,190 INFO L280 TraceCheckUtils]: 47: Hoare triple {2604#(<= |id_#res| 3)} assume true; {2604#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:50,191 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2604#(<= |id_#res| 3)} {2430#true} #45#return; {2574#(<= |id_#t~ret0| 3)} is VALID [2020-07-18 04:57:50,191 INFO L280 TraceCheckUtils]: 49: Hoare triple {2574#(<= |id_#t~ret0| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2574#(<= |id_#t~ret0| 3)} is VALID [2020-07-18 04:57:50,192 INFO L280 TraceCheckUtils]: 50: Hoare triple {2574#(<= |id_#t~ret0| 3)} ~ret~0 := 1 + #t~ret0; {2575#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:50,193 INFO L280 TraceCheckUtils]: 51: Hoare triple {2575#(<= id_~ret~0 4)} havoc #t~ret0; {2575#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:50,193 INFO L280 TraceCheckUtils]: 52: Hoare triple {2575#(<= id_~ret~0 4)} assume !(~ret~0 > 5); {2575#(<= id_~ret~0 4)} is VALID [2020-07-18 04:57:50,194 INFO L280 TraceCheckUtils]: 53: Hoare triple {2575#(<= id_~ret~0 4)} #res := ~ret~0; {2576#(<= |id_#res| 4)} is VALID [2020-07-18 04:57:50,194 INFO L280 TraceCheckUtils]: 54: Hoare triple {2576#(<= |id_#res| 4)} assume true; {2576#(<= |id_#res| 4)} is VALID [2020-07-18 04:57:50,196 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {2576#(<= |id_#res| 4)} {2430#true} #45#return; {2536#(<= |id_#t~ret0| 4)} is VALID [2020-07-18 04:57:50,196 INFO L280 TraceCheckUtils]: 56: Hoare triple {2536#(<= |id_#t~ret0| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2536#(<= |id_#t~ret0| 4)} is VALID [2020-07-18 04:57:50,197 INFO L280 TraceCheckUtils]: 57: Hoare triple {2536#(<= |id_#t~ret0| 4)} ~ret~0 := 1 + #t~ret0; {2537#(<= id_~ret~0 5)} is VALID [2020-07-18 04:57:50,198 INFO L280 TraceCheckUtils]: 58: Hoare triple {2537#(<= id_~ret~0 5)} havoc #t~ret0; {2537#(<= id_~ret~0 5)} is VALID [2020-07-18 04:57:50,198 INFO L280 TraceCheckUtils]: 59: Hoare triple {2537#(<= id_~ret~0 5)} assume !(~ret~0 > 5); {2537#(<= id_~ret~0 5)} is VALID [2020-07-18 04:57:50,199 INFO L280 TraceCheckUtils]: 60: Hoare triple {2537#(<= id_~ret~0 5)} #res := ~ret~0; {2538#(<= |id_#res| 5)} is VALID [2020-07-18 04:57:50,199 INFO L280 TraceCheckUtils]: 61: Hoare triple {2538#(<= |id_#res| 5)} assume true; {2538#(<= |id_#res| 5)} is VALID [2020-07-18 04:57:50,200 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2538#(<= |id_#res| 5)} {2430#true} #43#return; {2489#(<= |main_#t~ret2| 5)} is VALID [2020-07-18 04:57:50,200 INFO L280 TraceCheckUtils]: 63: Hoare triple {2489#(<= |main_#t~ret2| 5)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2489#(<= |main_#t~ret2| 5)} is VALID [2020-07-18 04:57:50,201 INFO L280 TraceCheckUtils]: 64: Hoare triple {2489#(<= |main_#t~ret2| 5)} ~result~0 := #t~ret2; {2490#(<= main_~result~0 5)} is VALID [2020-07-18 04:57:50,202 INFO L280 TraceCheckUtils]: 65: Hoare triple {2490#(<= main_~result~0 5)} havoc #t~ret2; {2490#(<= main_~result~0 5)} is VALID [2020-07-18 04:57:50,202 INFO L280 TraceCheckUtils]: 66: Hoare triple {2490#(<= main_~result~0 5)} assume 10 == ~result~0; {2431#false} is VALID [2020-07-18 04:57:50,202 INFO L280 TraceCheckUtils]: 67: Hoare triple {2431#false} assume !false; {2431#false} is VALID [2020-07-18 04:57:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-18 04:57:50,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2025172607] [2020-07-18 04:57:50,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:57:50,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-18 04:57:50,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335452099] [2020-07-18 04:57:50,208 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2020-07-18 04:57:50,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:50,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-18 04:57:50,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:50,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-18 04:57:50,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:50,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-18 04:57:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2020-07-18 04:57:50,267 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 20 states. [2020-07-18 04:57:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:50,790 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2020-07-18 04:57:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-18 04:57:50,790 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2020-07-18 04:57:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 04:57:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions. [2020-07-18 04:57:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 04:57:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions. [2020-07-18 04:57:50,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 79 transitions. [2020-07-18 04:57:50,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:50,882 INFO L225 Difference]: With dead ends: 76 [2020-07-18 04:57:50,882 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 04:57:50,886 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2020-07-18 04:57:50,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 04:57:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 04:57:50,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:50,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 04:57:50,887 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:57:50,888 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:57:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:50,888 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:57:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:57:50,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:50,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:50,889 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:57:50,889 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:57:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:50,889 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:57:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:57:50,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:50,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:50,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:50,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 04:57:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 04:57:50,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2020-07-18 04:57:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:50,893 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 04:57:50,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-18 04:57:50,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 04:57:50,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:57:50,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:50,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 04:57:50,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 04:57:51,204 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:57:51,204 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:57:51,204 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:57:51,204 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 04:57:51,204 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 04:57:51,204 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:57:51,205 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) the Hoare annotation is: false [2020-07-18 04:57:51,205 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-18 04:57:51,205 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: true [2020-07-18 04:57:51,205 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-07-18 04:57:51,206 INFO L264 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (<= main_~result~0 5) [2020-07-18 04:57:51,207 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-18 04:57:51,207 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-18 04:57:51,207 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (<= |main_#t~ret2| 5) [2020-07-18 04:57:51,207 INFO L271 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: true [2020-07-18 04:57:51,207 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-18 04:57:51,207 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (<= |main_#t~ret2| 5) [2020-07-18 04:57:51,208 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= main_~result~0 5)) [2020-07-18 04:57:51,208 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 9) the Hoare annotation is: (<= |id_#res| 5) [2020-07-18 04:57:51,208 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 9) the Hoare annotation is: (<= |id_#res| 5) [2020-07-18 04:57:51,209 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 9) the Hoare annotation is: true [2020-07-18 04:57:51,209 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (<= id_~ret~0 5) [2020-07-18 04:57:51,209 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-18 04:57:51,209 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-18 04:57:51,209 INFO L271 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: true [2020-07-18 04:57:51,210 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-18 04:57:51,210 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-18 04:57:51,210 INFO L271 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-07-18 04:57:51,210 INFO L271 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: true [2020-07-18 04:57:51,210 INFO L271 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: true [2020-07-18 04:57:51,222 INFO L163 areAnnotationChecker]: CFG has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 04:57:51,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:57:51 BoogieIcfgContainer [2020-07-18 04:57:51,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 04:57:51,243 INFO L168 Benchmark]: Toolchain (without parser) took 8526.80 ms. Allocated memory was 144.2 MB in the beginning and 307.2 MB in the end (delta: 163.1 MB). Free memory was 102.2 MB in the beginning and 211.8 MB in the end (delta: -109.6 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:51,244 INFO L168 Benchmark]: CDTParser took 0.95 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-18 04:57:51,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.57 ms. Allocated memory is still 144.2 MB. Free memory was 101.8 MB in the beginning and 92.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:51,245 INFO L168 Benchmark]: Boogie Preprocessor took 43.46 ms. Allocated memory is still 144.2 MB. Free memory was 92.3 MB in the beginning and 91.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:51,246 INFO L168 Benchmark]: RCFGBuilder took 561.03 ms. Allocated memory was 144.2 MB in the beginning and 205.0 MB in the end (delta: 60.8 MB). Free memory was 90.8 MB in the beginning and 167.7 MB in the end (delta: -76.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:51,249 INFO L168 Benchmark]: TraceAbstraction took 7645.48 ms. Allocated memory was 205.0 MB in the beginning and 307.2 MB in the end (delta: 102.2 MB). Free memory was 167.0 MB in the beginning and 211.8 MB in the end (delta: -44.8 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:51,255 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.95 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 269.57 ms. Allocated memory is still 144.2 MB. Free memory was 101.8 MB in the beginning and 92.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 43.46 ms. Allocated memory is still 144.2 MB. Free memory was 92.3 MB in the beginning and 91.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 561.03 ms. Allocated memory was 144.2 MB in the beginning and 205.0 MB in the end (delta: 60.8 MB). Free memory was 90.8 MB in the beginning and 167.7 MB in the end (delta: -76.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7645.48 ms. Allocated memory was 205.0 MB in the beginning and 307.2 MB in the end (delta: 102.2 MB). Free memory was 167.0 MB in the beginning and 211.8 MB in the end (delta: -44.8 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for id Derived contract for procedure id: \result <= 5 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.2s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 199 SDtfs, 79 SDslu, 1041 SDs, 0 SdLazy, 385 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 11 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 42 PreInvPairs, 178 NumberOfFragments, 48 HoareAnnotationTreeSize, 42 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 30 FomulaSimplificationsInter, 227 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 29494 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 111/281 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 correct! Received shutdown request...