/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-8fc6572 [2020-07-11 00:51:41,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:51:41,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:51:41,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:51:41,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:51:41,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:51:41,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:51:42,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:51:42,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:51:42,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:51:42,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:51:42,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:51:42,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:51:42,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:51:42,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:51:42,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:51:42,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:51:42,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:51:42,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:51:42,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:51:42,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:51:42,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:51:42,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:51:42,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:51:42,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:51:42,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:51:42,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:51:42,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:51:42,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:51:42,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:51:42,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:51:42,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:51:42,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:51:42,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:51:42,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:51:42,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:51:42,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:51:42,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:51:42,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:51:42,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:51:42,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:51:42,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:51:42,074 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:51:42,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:51:42,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:51:42,077 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:51:42,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:51:42,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:51:42,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:51:42,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:51:42,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:51:42,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:51:42,079 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:51:42,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:51:42,080 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:51:42,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:51:42,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:51:42,081 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:51:42,081 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:51:42,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:51:42,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:51:42,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:51:42,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:51:42,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:51:42,082 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:51:42,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:51:42,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:51:42,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:51:42,363 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:51:42,363 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:51:42,364 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-11 00:51:42,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228445437/0c92a2e07cdd4c618d7c07ab77666efc/FLAG5e7b444b9 [2020-07-11 00:51:42,885 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:51:42,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c [2020-07-11 00:51:42,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228445437/0c92a2e07cdd4c618d7c07ab77666efc/FLAG5e7b444b9 [2020-07-11 00:51:43,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228445437/0c92a2e07cdd4c618d7c07ab77666efc [2020-07-11 00:51:43,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:51:43,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:51:43,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:51:43,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:51:43,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:51:43,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:51:43" (1/1) ... [2020-07-11 00:51:43,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621eb230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:43, skipping insertion in model container [2020-07-11 00:51:43,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:51:43" (1/1) ... [2020-07-11 00:51:43,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:51:43,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:51:43,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:51:43,474 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:51:43,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:51:43,506 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:51:43,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:43 WrapperNode [2020-07-11 00:51:43,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:51:43,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:51:43,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:51:43,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:51:43,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:43" (1/1) ... [2020-07-11 00:51:43,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:43" (1/1) ... [2020-07-11 00:51:43,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:43" (1/1) ... [2020-07-11 00:51:43,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:43" (1/1) ... [2020-07-11 00:51:43,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:43" (1/1) ... [2020-07-11 00:51:43,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:43" (1/1) ... [2020-07-11 00:51:43,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:43" (1/1) ... [2020-07-11 00:51:43,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:51:43,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:51:43,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:51:43,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:51:43,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:51:43,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:51:43,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:51:43,683 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-11 00:51:43,683 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:51:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:51:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:51:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-11 00:51:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:51:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:51:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:51:43,935 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:51:43,936 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:51:43,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:51:43 BoogieIcfgContainer [2020-07-11 00:51:43,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:51:43,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:51:43,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:51:43,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:51:43,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:51:43" (1/3) ... [2020-07-11 00:51:43,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33284dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:51:43, skipping insertion in model container [2020-07-11 00:51:43,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:43" (2/3) ... [2020-07-11 00:51:43,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33284dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:51:43, skipping insertion in model container [2020-07-11 00:51:43,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:51:43" (3/3) ... [2020-07-11 00:51:43,951 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b5_o10-2.c [2020-07-11 00:51:43,964 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:51:43,971 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:51:43,988 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:51:44,011 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:51:44,012 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:51:44,012 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:51:44,012 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:51:44,012 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:51:44,012 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:51:44,013 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:51:44,013 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:51:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-11 00:51:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-11 00:51:44,040 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:44,041 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-11 00:51:44,042 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:44,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash 856871792, now seen corresponding path program 1 times [2020-07-11 00:51:44,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:44,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2063772033] [2020-07-11 00:51:44,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:44,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-11 00:51:44,275 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-11 00:51:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:44,317 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-11 00:51:44,318 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-11 00:51:44,319 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:44,320 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:44,322 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-11 00:51:44,323 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-11 00:51:44,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-11 00:51:44,324 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-11 00:51:44,324 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-11 00:51:44,325 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33#true} is VALID [2020-07-11 00:51:44,325 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~input~0 := #t~nondet1; {33#true} is VALID [2020-07-11 00:51:44,326 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc #t~nondet1; {33#true} is VALID [2020-07-11 00:51:44,326 INFO L263 TraceCheckUtils]: 7: Hoare triple {33#true} call #t~ret2 := id(~input~0); {33#true} is VALID [2020-07-11 00:51:44,327 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-11 00:51:44,327 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-11 00:51:44,328 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:44,329 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:44,331 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-11 00:51:44,332 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-11 00:51:44,334 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#(<= |main_#t~ret2| 0)} ~result~0 := #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-11 00:51:44,335 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#(<= main_~result~0 0)} havoc #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-11 00:51:44,336 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= main_~result~0 0)} assume 10 == ~result~0; {34#false} is VALID [2020-07-11 00:51:44,336 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-11 00:51:44,339 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-11 00:51:44,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2063772033] [2020-07-11 00:51:44,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:44,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:51:44,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818198342] [2020-07-11 00:51:44,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-11 00:51:44,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:44,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:51:44,419 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-11 00:51:44,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:51:44,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:44,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:51:44,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:51:44,434 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-07-11 00:51:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:44,702 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-11 00:51:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:51:44,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-11 00:51:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-11 00:51:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-11 00:51:44,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2020-07-11 00:51:44,794 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-11 00:51:44,807 INFO L225 Difference]: With dead ends: 44 [2020-07-11 00:51:44,808 INFO L226 Difference]: Without dead ends: 28 [2020-07-11 00:51:44,812 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-11 00:51:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-11 00:51:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-11 00:51:44,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:44,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:44,884 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:44,885 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:44,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:44,891 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-11 00:51:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-11 00:51:44,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:44,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:44,893 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:44,893 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:44,898 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-11 00:51:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-11 00:51:44,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:44,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:44,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:44,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 00:51:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-11 00:51:44,906 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2020-07-11 00:51:44,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:44,906 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-11 00:51:44,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:51:44,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-11 00:51:44,959 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-11 00:51:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-11 00:51:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-11 00:51:44,961 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:44,961 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-11 00:51:44,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:51:44,962 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609951, now seen corresponding path program 1 times [2020-07-11 00:51:44,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:44,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [685166479] [2020-07-11 00:51:44,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:45,020 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-11 00:51:45,021 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-11 00:51:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:45,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:45,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-11 00:51:45,137 INFO L280 TraceCheckUtils]: 2: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:45,138 INFO L280 TraceCheckUtils]: 3: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:45,140 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:45,140 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:45,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-11 00:51:45,141 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-11 00:51:45,141 INFO L280 TraceCheckUtils]: 3: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:45,141 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-11 00:51:45,142 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:45,143 INFO L280 TraceCheckUtils]: 6: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:45,144 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:45,145 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-11 00:51:45,146 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-11 00:51:45,147 INFO L280 TraceCheckUtils]: 10: Hoare triple {274#(<= id_~ret~0 1)} havoc #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:45,147 INFO L280 TraceCheckUtils]: 11: Hoare triple {274#(<= id_~ret~0 1)} assume ~ret~0 > 5; {250#false} is VALID [2020-07-11 00:51:45,148 INFO L280 TraceCheckUtils]: 12: Hoare triple {250#false} #res := 5; {250#false} is VALID [2020-07-11 00:51:45,148 INFO L280 TraceCheckUtils]: 13: Hoare triple {250#false} assume true; {250#false} is VALID [2020-07-11 00:51:45,148 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {250#false} {249#true} #43#return; {250#false} is VALID [2020-07-11 00:51:45,149 INFO L263 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2020-07-11 00:51:45,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-11 00:51:45,150 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-11 00:51:45,150 INFO L263 TraceCheckUtils]: 3: Hoare triple {249#true} call #t~ret3 := main(); {249#true} is VALID [2020-07-11 00:51:45,151 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {249#true} is VALID [2020-07-11 00:51:45,151 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} ~input~0 := #t~nondet1; {249#true} is VALID [2020-07-11 00:51:45,151 INFO L280 TraceCheckUtils]: 6: Hoare triple {249#true} havoc #t~nondet1; {249#true} is VALID [2020-07-11 00:51:45,151 INFO L263 TraceCheckUtils]: 7: Hoare triple {249#true} call #t~ret2 := id(~input~0); {249#true} is VALID [2020-07-11 00:51:45,152 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:45,152 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-11 00:51:45,152 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-11 00:51:45,153 INFO L280 TraceCheckUtils]: 11: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:45,153 INFO L280 TraceCheckUtils]: 12: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-11 00:51:45,154 INFO L280 TraceCheckUtils]: 13: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:45,154 INFO L280 TraceCheckUtils]: 14: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:45,156 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:45,157 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-11 00:51:45,157 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-11 00:51:45,158 INFO L280 TraceCheckUtils]: 18: Hoare triple {274#(<= id_~ret~0 1)} havoc #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:45,159 INFO L280 TraceCheckUtils]: 19: Hoare triple {274#(<= id_~ret~0 1)} assume ~ret~0 > 5; {250#false} is VALID [2020-07-11 00:51:45,159 INFO L280 TraceCheckUtils]: 20: Hoare triple {250#false} #res := 5; {250#false} is VALID [2020-07-11 00:51:45,159 INFO L280 TraceCheckUtils]: 21: Hoare triple {250#false} assume true; {250#false} is VALID [2020-07-11 00:51:45,160 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {250#false} {249#true} #43#return; {250#false} is VALID [2020-07-11 00:51:45,160 INFO L280 TraceCheckUtils]: 23: Hoare triple {250#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {250#false} is VALID [2020-07-11 00:51:45,160 INFO L280 TraceCheckUtils]: 24: Hoare triple {250#false} ~result~0 := #t~ret2; {250#false} is VALID [2020-07-11 00:51:45,160 INFO L280 TraceCheckUtils]: 25: Hoare triple {250#false} havoc #t~ret2; {250#false} is VALID [2020-07-11 00:51:45,161 INFO L280 TraceCheckUtils]: 26: Hoare triple {250#false} assume 10 == ~result~0; {250#false} is VALID [2020-07-11 00:51:45,161 INFO L280 TraceCheckUtils]: 27: Hoare triple {250#false} assume !false; {250#false} is VALID [2020-07-11 00:51:45,163 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-11 00:51:45,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [685166479] [2020-07-11 00:51:45,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:45,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:51:45,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061026491] [2020-07-11 00:51:45,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-11 00:51:45,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:45,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:51:45,197 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-11 00:51:45,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:51:45,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:45,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:51:45,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:51:45,199 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2020-07-11 00:51:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:45,409 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-11 00:51:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:51:45,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-11 00:51:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-11 00:51:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-11 00:51:45,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2020-07-11 00:51:45,490 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-11 00:51:45,495 INFO L225 Difference]: With dead ends: 49 [2020-07-11 00:51:45,496 INFO L226 Difference]: Without dead ends: 35 [2020-07-11 00:51:45,498 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-11 00:51:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-11 00:51:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-11 00:51:45,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:45,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2020-07-11 00:51:45,536 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2020-07-11 00:51:45,536 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2020-07-11 00:51:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:45,543 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-11 00:51:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-11 00:51:45,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:45,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:45,546 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2020-07-11 00:51:45,546 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2020-07-11 00:51:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:45,555 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-11 00:51:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-11 00:51:45,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:45,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:45,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:45,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 00:51:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-11 00:51:45,563 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2020-07-11 00:51:45,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:45,563 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-11 00:51:45,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:51:45,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-11 00:51:45,604 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-11 00:51:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-11 00:51:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-11 00:51:45,606 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:45,607 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-11 00:51:45,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:51:45,607 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:45,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1645321695, now seen corresponding path program 1 times [2020-07-11 00:51:45,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:45,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2023496005] [2020-07-11 00:51:45,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:45,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-11 00:51:45,661 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {512#true} {512#true} #39#return; {512#true} is VALID [2020-07-11 00:51:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:45,758 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:45,759 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-11 00:51:45,759 INFO L280 TraceCheckUtils]: 2: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:45,760 INFO L280 TraceCheckUtils]: 3: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:45,762 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:45,762 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:45,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume !(0 == ~x); {512#true} is VALID [2020-07-11 00:51:45,763 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-11 00:51:45,763 INFO L280 TraceCheckUtils]: 3: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:45,763 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-11 00:51:45,764 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:45,765 INFO L280 TraceCheckUtils]: 6: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:45,766 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:45,767 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-11 00:51:45,768 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-11 00:51:45,769 INFO L280 TraceCheckUtils]: 10: Hoare triple {539#(<= id_~ret~0 1)} havoc #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:45,770 INFO L280 TraceCheckUtils]: 11: Hoare triple {539#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {539#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:45,770 INFO L280 TraceCheckUtils]: 12: Hoare triple {539#(<= id_~ret~0 1)} #res := ~ret~0; {540#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:45,771 INFO L280 TraceCheckUtils]: 13: Hoare triple {540#(<= |id_#res| 1)} assume true; {540#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:45,772 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {540#(<= |id_#res| 1)} {512#true} #43#return; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-11 00:51:45,773 INFO L263 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2020-07-11 00:51:45,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-11 00:51:45,774 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {512#true} {512#true} #39#return; {512#true} is VALID [2020-07-11 00:51:45,774 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#true} call #t~ret3 := main(); {512#true} is VALID [2020-07-11 00:51:45,775 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {512#true} is VALID [2020-07-11 00:51:45,775 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} ~input~0 := #t~nondet1; {512#true} is VALID [2020-07-11 00:51:45,775 INFO L280 TraceCheckUtils]: 6: Hoare triple {512#true} havoc #t~nondet1; {512#true} is VALID [2020-07-11 00:51:45,776 INFO L263 TraceCheckUtils]: 7: Hoare triple {512#true} call #t~ret2 := id(~input~0); {512#true} is VALID [2020-07-11 00:51:45,776 INFO L280 TraceCheckUtils]: 8: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:45,776 INFO L280 TraceCheckUtils]: 9: Hoare triple {512#true} assume !(0 == ~x); {512#true} is VALID [2020-07-11 00:51:45,777 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-11 00:51:45,777 INFO L280 TraceCheckUtils]: 11: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:45,777 INFO L280 TraceCheckUtils]: 12: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-11 00:51:45,778 INFO L280 TraceCheckUtils]: 13: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:45,779 INFO L280 TraceCheckUtils]: 14: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:45,781 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:45,781 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-11 00:51:45,782 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-11 00:51:45,783 INFO L280 TraceCheckUtils]: 18: Hoare triple {539#(<= id_~ret~0 1)} havoc #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:45,784 INFO L280 TraceCheckUtils]: 19: Hoare triple {539#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {539#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:45,785 INFO L280 TraceCheckUtils]: 20: Hoare triple {539#(<= id_~ret~0 1)} #res := ~ret~0; {540#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:45,785 INFO L280 TraceCheckUtils]: 21: Hoare triple {540#(<= |id_#res| 1)} assume true; {540#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:45,787 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {540#(<= |id_#res| 1)} {512#true} #43#return; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-11 00:51:45,787 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-11 00:51:45,788 INFO L280 TraceCheckUtils]: 24: Hoare triple {531#(<= |main_#t~ret2| 1)} ~result~0 := #t~ret2; {532#(<= main_~result~0 1)} is VALID [2020-07-11 00:51:45,789 INFO L280 TraceCheckUtils]: 25: Hoare triple {532#(<= main_~result~0 1)} havoc #t~ret2; {532#(<= main_~result~0 1)} is VALID [2020-07-11 00:51:45,790 INFO L280 TraceCheckUtils]: 26: Hoare triple {532#(<= main_~result~0 1)} assume 10 == ~result~0; {513#false} is VALID [2020-07-11 00:51:45,790 INFO L280 TraceCheckUtils]: 27: Hoare triple {513#false} assume !false; {513#false} is VALID [2020-07-11 00:51:45,792 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-11 00:51:45,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2023496005] [2020-07-11 00:51:45,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:45,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 00:51:45,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444371736] [2020-07-11 00:51:45,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-11 00:51:45,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:45,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:51:45,848 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-11 00:51:45,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:51:45,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:45,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:51:45,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:51:45,850 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2020-07-11 00:51:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:46,142 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-11 00:51:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 00:51:46,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-11 00:51:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:51:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-11 00:51:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:51:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-11 00:51:46,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2020-07-11 00:51:46,211 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-11 00:51:46,214 INFO L225 Difference]: With dead ends: 41 [2020-07-11 00:51:46,214 INFO L226 Difference]: Without dead ends: 35 [2020-07-11 00:51:46,216 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-11 00:51:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-11 00:51:46,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-11 00:51:46,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:46,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:46,253 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:46,253 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:46,257 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-11 00:51:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 00:51:46,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:46,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:46,258 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:46,259 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:46,262 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-11 00:51:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 00:51:46,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:46,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:46,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:46,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:46,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-11 00:51:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-11 00:51:46,265 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2020-07-11 00:51:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:46,266 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-11 00:51:46,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:51:46,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-11 00:51:46,309 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-11 00:51:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 00:51:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-11 00:51:46,310 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:46,311 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-11 00:51:46,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:51:46,311 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:46,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:46,311 INFO L82 PathProgramCache]: Analyzing trace with hash 170302224, now seen corresponding path program 1 times [2020-07-11 00:51:46,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:46,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819272664] [2020-07-11 00:51:46,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:46,367 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:46,368 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {772#true} {772#true} #39#return; {772#true} is VALID [2020-07-11 00:51:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:46,417 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:46,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-11 00:51:46,418 INFO L280 TraceCheckUtils]: 2: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-11 00:51:46,418 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:46,418 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:46,419 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:46,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:46,419 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-11 00:51:46,419 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:46,420 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-11 00:51:46,420 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-11 00:51:46,420 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:46,421 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:46,421 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:46,421 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:46,421 INFO L280 TraceCheckUtils]: 10: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:46,422 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} assume !(~ret~0 > 5); {772#true} is VALID [2020-07-11 00:51:46,422 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-11 00:51:46,422 INFO L280 TraceCheckUtils]: 13: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:46,422 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:46,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:46,423 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:46,423 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-11 00:51:46,424 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:46,424 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:46,424 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-11 00:51:46,424 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:46,425 INFO L280 TraceCheckUtils]: 7: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-11 00:51:46,425 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-11 00:51:46,425 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:46,425 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:46,426 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:46,426 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:46,426 INFO L280 TraceCheckUtils]: 13: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:46,426 INFO L280 TraceCheckUtils]: 14: Hoare triple {772#true} assume !(~ret~0 > 5); {772#true} is VALID [2020-07-11 00:51:46,427 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-11 00:51:46,427 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:46,427 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:46,427 INFO L280 TraceCheckUtils]: 18: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:46,428 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:46,428 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:46,428 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#true} assume ~ret~0 > 5; {772#true} is VALID [2020-07-11 00:51:46,429 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#true} #res := 5; {818#(<= |id_#res| 5)} is VALID [2020-07-11 00:51:46,430 INFO L280 TraceCheckUtils]: 23: Hoare triple {818#(<= |id_#res| 5)} assume true; {818#(<= |id_#res| 5)} is VALID [2020-07-11 00:51:46,431 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {818#(<= |id_#res| 5)} {772#true} #43#return; {801#(<= |main_#t~ret2| 5)} is VALID [2020-07-11 00:51:46,432 INFO L263 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2020-07-11 00:51:46,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:46,432 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {772#true} {772#true} #39#return; {772#true} is VALID [2020-07-11 00:51:46,432 INFO L263 TraceCheckUtils]: 3: Hoare triple {772#true} call #t~ret3 := main(); {772#true} is VALID [2020-07-11 00:51:46,433 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:46,433 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} ~input~0 := #t~nondet1; {772#true} is VALID [2020-07-11 00:51:46,433 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} havoc #t~nondet1; {772#true} is VALID [2020-07-11 00:51:46,433 INFO L263 TraceCheckUtils]: 7: Hoare triple {772#true} call #t~ret2 := id(~input~0); {772#true} is VALID [2020-07-11 00:51:46,434 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:46,434 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:46,434 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-11 00:51:46,434 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:46,435 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:46,435 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-11 00:51:46,435 INFO L280 TraceCheckUtils]: 14: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:46,435 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-11 00:51:46,436 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-11 00:51:46,436 INFO L280 TraceCheckUtils]: 17: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:46,436 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:46,436 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:46,437 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:46,437 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:46,437 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#true} assume !(~ret~0 > 5); {772#true} is VALID [2020-07-11 00:51:46,437 INFO L280 TraceCheckUtils]: 23: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-11 00:51:46,437 INFO L280 TraceCheckUtils]: 24: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:46,438 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:46,438 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:46,438 INFO L280 TraceCheckUtils]: 27: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:46,438 INFO L280 TraceCheckUtils]: 28: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:46,439 INFO L280 TraceCheckUtils]: 29: Hoare triple {772#true} assume ~ret~0 > 5; {772#true} is VALID [2020-07-11 00:51:46,439 INFO L280 TraceCheckUtils]: 30: Hoare triple {772#true} #res := 5; {818#(<= |id_#res| 5)} is VALID [2020-07-11 00:51:46,440 INFO L280 TraceCheckUtils]: 31: Hoare triple {818#(<= |id_#res| 5)} assume true; {818#(<= |id_#res| 5)} is VALID [2020-07-11 00:51:46,441 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {818#(<= |id_#res| 5)} {772#true} #43#return; {801#(<= |main_#t~ret2| 5)} is VALID [2020-07-11 00:51:46,442 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-11 00:51:46,442 INFO L280 TraceCheckUtils]: 34: Hoare triple {801#(<= |main_#t~ret2| 5)} ~result~0 := #t~ret2; {802#(<= main_~result~0 5)} is VALID [2020-07-11 00:51:46,443 INFO L280 TraceCheckUtils]: 35: Hoare triple {802#(<= main_~result~0 5)} havoc #t~ret2; {802#(<= main_~result~0 5)} is VALID [2020-07-11 00:51:46,444 INFO L280 TraceCheckUtils]: 36: Hoare triple {802#(<= main_~result~0 5)} assume 10 == ~result~0; {773#false} is VALID [2020-07-11 00:51:46,444 INFO L280 TraceCheckUtils]: 37: Hoare triple {773#false} assume !false; {773#false} is VALID [2020-07-11 00:51:46,446 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-11 00:51:46,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1819272664] [2020-07-11 00:51:46,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:46,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:51:46,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276248193] [2020-07-11 00:51:46,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-11 00:51:46,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:46,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:51:46,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:46,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:51:46,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:46,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:51:46,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:51:46,478 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2020-07-11 00:51:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:46,591 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-11 00:51:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:51:46,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-11 00:51:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-11 00:51:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-11 00:51:46,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2020-07-11 00:51:46,633 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-11 00:51:46,635 INFO L225 Difference]: With dead ends: 43 [2020-07-11 00:51:46,635 INFO L226 Difference]: Without dead ends: 37 [2020-07-11 00:51:46,636 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-11 00:51:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-11 00:51:46,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-11 00:51:46,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:46,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2020-07-11 00:51:46,674 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2020-07-11 00:51:46,674 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2020-07-11 00:51:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:46,677 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-11 00:51:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-11 00:51:46,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:46,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:46,678 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2020-07-11 00:51:46,678 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2020-07-11 00:51:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:46,681 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-11 00:51:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-11 00:51:46,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:46,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:46,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:46,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-11 00:51:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-11 00:51:46,684 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 38 [2020-07-11 00:51:46,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:46,684 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-11 00:51:46,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:51:46,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-11 00:51:46,720 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-11 00:51:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 00:51:46,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-11 00:51:46,721 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:46,721 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-11 00:51:46,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:51:46,722 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:46,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:46,722 INFO L82 PathProgramCache]: Analyzing trace with hash 41013968, now seen corresponding path program 2 times [2020-07-11 00:51:46,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:46,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005375877] [2020-07-11 00:51:46,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:46,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} assume true; {1058#true} is VALID [2020-07-11 00:51:46,780 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1058#true} {1058#true} #39#return; {1058#true} is VALID [2020-07-11 00:51:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:46,912 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:46,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-11 00:51:46,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:46,914 INFO L280 TraceCheckUtils]: 3: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:46,915 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:46,915 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:46,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-11 00:51:46,916 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-11 00:51:46,916 INFO L280 TraceCheckUtils]: 3: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:46,916 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-11 00:51:46,917 INFO L280 TraceCheckUtils]: 5: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:46,918 INFO L280 TraceCheckUtils]: 6: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:46,919 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:46,919 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-11 00:51:46,920 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-11 00:51:46,921 INFO L280 TraceCheckUtils]: 10: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:46,921 INFO L280 TraceCheckUtils]: 11: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:46,922 INFO L280 TraceCheckUtils]: 12: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:46,923 INFO L280 TraceCheckUtils]: 13: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:46,924 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:46,924 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:46,925 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-11 00:51:46,925 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-11 00:51:46,925 INFO L280 TraceCheckUtils]: 3: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:46,926 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-11 00:51:46,926 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-11 00:51:46,926 INFO L280 TraceCheckUtils]: 6: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:46,926 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-11 00:51:46,927 INFO L280 TraceCheckUtils]: 8: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:46,928 INFO L280 TraceCheckUtils]: 9: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:46,929 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:46,930 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-11 00:51:46,930 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-11 00:51:46,931 INFO L280 TraceCheckUtils]: 13: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:46,931 INFO L280 TraceCheckUtils]: 14: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:46,932 INFO L280 TraceCheckUtils]: 15: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:46,933 INFO L280 TraceCheckUtils]: 16: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:46,934 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:46,934 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-11 00:51:46,935 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-11 00:51:46,936 INFO L280 TraceCheckUtils]: 20: Hoare triple {1105#(<= id_~ret~0 2)} havoc #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:46,936 INFO L280 TraceCheckUtils]: 21: Hoare triple {1105#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {1105#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:46,937 INFO L280 TraceCheckUtils]: 22: Hoare triple {1105#(<= id_~ret~0 2)} #res := ~ret~0; {1106#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:46,938 INFO L280 TraceCheckUtils]: 23: Hoare triple {1106#(<= |id_#res| 2)} assume true; {1106#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:46,939 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1106#(<= |id_#res| 2)} {1058#true} #43#return; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-11 00:51:46,940 INFO L263 TraceCheckUtils]: 0: Hoare triple {1058#true} call ULTIMATE.init(); {1058#true} is VALID [2020-07-11 00:51:46,940 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume true; {1058#true} is VALID [2020-07-11 00:51:46,940 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1058#true} {1058#true} #39#return; {1058#true} is VALID [2020-07-11 00:51:46,941 INFO L263 TraceCheckUtils]: 3: Hoare triple {1058#true} call #t~ret3 := main(); {1058#true} is VALID [2020-07-11 00:51:46,941 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1058#true} is VALID [2020-07-11 00:51:46,941 INFO L280 TraceCheckUtils]: 5: Hoare triple {1058#true} ~input~0 := #t~nondet1; {1058#true} is VALID [2020-07-11 00:51:46,941 INFO L280 TraceCheckUtils]: 6: Hoare triple {1058#true} havoc #t~nondet1; {1058#true} is VALID [2020-07-11 00:51:46,942 INFO L263 TraceCheckUtils]: 7: Hoare triple {1058#true} call #t~ret2 := id(~input~0); {1058#true} is VALID [2020-07-11 00:51:46,942 INFO L280 TraceCheckUtils]: 8: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:46,942 INFO L280 TraceCheckUtils]: 9: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-11 00:51:46,942 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-11 00:51:46,942 INFO L280 TraceCheckUtils]: 11: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:46,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-11 00:51:46,943 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-11 00:51:46,943 INFO L280 TraceCheckUtils]: 14: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:46,943 INFO L280 TraceCheckUtils]: 15: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-11 00:51:46,944 INFO L280 TraceCheckUtils]: 16: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:46,945 INFO L280 TraceCheckUtils]: 17: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:46,946 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:46,946 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-11 00:51:46,947 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-11 00:51:46,948 INFO L280 TraceCheckUtils]: 21: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:46,948 INFO L280 TraceCheckUtils]: 22: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:46,949 INFO L280 TraceCheckUtils]: 23: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:46,949 INFO L280 TraceCheckUtils]: 24: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:46,951 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:46,951 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-11 00:51:46,952 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-11 00:51:46,953 INFO L280 TraceCheckUtils]: 28: Hoare triple {1105#(<= id_~ret~0 2)} havoc #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:46,953 INFO L280 TraceCheckUtils]: 29: Hoare triple {1105#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {1105#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:46,954 INFO L280 TraceCheckUtils]: 30: Hoare triple {1105#(<= id_~ret~0 2)} #res := ~ret~0; {1106#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:46,955 INFO L280 TraceCheckUtils]: 31: Hoare triple {1106#(<= |id_#res| 2)} assume true; {1106#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:46,955 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1106#(<= |id_#res| 2)} {1058#true} #43#return; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-11 00:51:46,956 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-11 00:51:46,957 INFO L280 TraceCheckUtils]: 34: Hoare triple {1087#(<= |main_#t~ret2| 2)} ~result~0 := #t~ret2; {1088#(<= main_~result~0 2)} is VALID [2020-07-11 00:51:46,957 INFO L280 TraceCheckUtils]: 35: Hoare triple {1088#(<= main_~result~0 2)} havoc #t~ret2; {1088#(<= main_~result~0 2)} is VALID [2020-07-11 00:51:46,958 INFO L280 TraceCheckUtils]: 36: Hoare triple {1088#(<= main_~result~0 2)} assume 10 == ~result~0; {1059#false} is VALID [2020-07-11 00:51:46,958 INFO L280 TraceCheckUtils]: 37: Hoare triple {1059#false} assume !false; {1059#false} is VALID [2020-07-11 00:51:46,960 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-11 00:51:46,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005375877] [2020-07-11 00:51:46,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:46,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 00:51:46,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200043138] [2020-07-11 00:51:46,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-07-11 00:51:46,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:46,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 00:51:46,997 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-11 00:51:46,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 00:51:46,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:46,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 00:51:46,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:51:46,998 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 11 states. [2020-07-11 00:51:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:47,292 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2020-07-11 00:51:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-11 00:51:47,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-07-11 00:51:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 00:51:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2020-07-11 00:51:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 00:51:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2020-07-11 00:51:47,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 65 transitions. [2020-07-11 00:51:47,371 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-11 00:51:47,373 INFO L225 Difference]: With dead ends: 64 [2020-07-11 00:51:47,373 INFO L226 Difference]: Without dead ends: 44 [2020-07-11 00:51:47,374 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-11 00:51:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-11 00:51:47,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-11 00:51:47,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:47,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-11 00:51:47,414 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-11 00:51:47,414 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-11 00:51:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:47,417 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-11 00:51:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-11 00:51:47,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:47,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:47,418 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-11 00:51:47,418 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-11 00:51:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:47,421 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-11 00:51:47,421 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-11 00:51:47,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:47,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:47,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:47,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-11 00:51:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-11 00:51:47,425 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 38 [2020-07-11 00:51:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:47,425 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-11 00:51:47,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 00:51:47,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-11 00:51:47,487 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-11 00:51:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-11 00:51:47,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-11 00:51:47,489 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:47,489 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-11 00:51:47,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:51:47,490 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:47,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:47,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1045014785, now seen corresponding path program 3 times [2020-07-11 00:51:47,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:47,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [895808561] [2020-07-11 00:51:47,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:47,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-11 00:51:47,549 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1428#true} {1428#true} #39#return; {1428#true} is VALID [2020-07-11 00:51:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:47,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-11 00:51:47,734 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:47,735 INFO L280 TraceCheckUtils]: 3: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:47,736 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:47,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:47,737 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-11 00:51:47,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-11 00:51:47,738 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:47,739 INFO L280 TraceCheckUtils]: 6: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:47,740 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:47,740 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-11 00:51:47,741 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-11 00:51:47,742 INFO L280 TraceCheckUtils]: 10: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:47,742 INFO L280 TraceCheckUtils]: 11: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:47,743 INFO L280 TraceCheckUtils]: 12: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:47,744 INFO L280 TraceCheckUtils]: 13: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:47,745 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:47,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:47,746 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-11 00:51:47,746 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,746 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:47,747 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-11 00:51:47,747 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,747 INFO L280 TraceCheckUtils]: 7: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-11 00:51:47,748 INFO L280 TraceCheckUtils]: 8: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:47,748 INFO L280 TraceCheckUtils]: 9: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:47,750 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:47,750 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-11 00:51:47,751 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-11 00:51:47,752 INFO L280 TraceCheckUtils]: 13: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:47,752 INFO L280 TraceCheckUtils]: 14: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:47,753 INFO L280 TraceCheckUtils]: 15: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:47,753 INFO L280 TraceCheckUtils]: 16: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:47,755 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:47,755 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-11 00:51:47,756 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-11 00:51:47,757 INFO L280 TraceCheckUtils]: 20: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:47,757 INFO L280 TraceCheckUtils]: 21: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:47,758 INFO L280 TraceCheckUtils]: 22: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:47,759 INFO L280 TraceCheckUtils]: 23: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:47,760 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:47,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,761 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:47,761 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-11 00:51:47,761 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,762 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:47,762 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-11 00:51:47,762 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,762 INFO L280 TraceCheckUtils]: 7: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:47,762 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-11 00:51:47,763 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,763 INFO L280 TraceCheckUtils]: 10: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-11 00:51:47,763 INFO L280 TraceCheckUtils]: 11: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:47,764 INFO L280 TraceCheckUtils]: 12: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:47,765 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:47,766 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-11 00:51:47,766 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-11 00:51:47,767 INFO L280 TraceCheckUtils]: 16: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:47,767 INFO L280 TraceCheckUtils]: 17: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:47,768 INFO L280 TraceCheckUtils]: 18: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:47,769 INFO L280 TraceCheckUtils]: 19: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:47,770 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:47,770 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-11 00:51:47,771 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-11 00:51:47,772 INFO L280 TraceCheckUtils]: 23: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:47,772 INFO L280 TraceCheckUtils]: 24: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:47,773 INFO L280 TraceCheckUtils]: 25: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:47,773 INFO L280 TraceCheckUtils]: 26: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:47,774 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:47,775 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-11 00:51:47,776 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-11 00:51:47,776 INFO L280 TraceCheckUtils]: 30: Hoare triple {1495#(<= id_~ret~0 3)} havoc #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:47,777 INFO L280 TraceCheckUtils]: 31: Hoare triple {1495#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {1495#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:47,778 INFO L280 TraceCheckUtils]: 32: Hoare triple {1495#(<= id_~ret~0 3)} #res := ~ret~0; {1496#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:47,778 INFO L280 TraceCheckUtils]: 33: Hoare triple {1496#(<= |id_#res| 3)} assume true; {1496#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:47,779 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1496#(<= |id_#res| 3)} {1428#true} #43#return; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-11 00:51:47,781 INFO L263 TraceCheckUtils]: 0: Hoare triple {1428#true} call ULTIMATE.init(); {1428#true} is VALID [2020-07-11 00:51:47,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-11 00:51:47,781 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1428#true} {1428#true} #39#return; {1428#true} is VALID [2020-07-11 00:51:47,782 INFO L263 TraceCheckUtils]: 3: Hoare triple {1428#true} call #t~ret3 := main(); {1428#true} is VALID [2020-07-11 00:51:47,782 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1428#true} is VALID [2020-07-11 00:51:47,782 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#true} ~input~0 := #t~nondet1; {1428#true} is VALID [2020-07-11 00:51:47,782 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} havoc #t~nondet1; {1428#true} is VALID [2020-07-11 00:51:47,783 INFO L263 TraceCheckUtils]: 7: Hoare triple {1428#true} call #t~ret2 := id(~input~0); {1428#true} is VALID [2020-07-11 00:51:47,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,783 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:47,783 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-11 00:51:47,783 INFO L280 TraceCheckUtils]: 11: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,784 INFO L280 TraceCheckUtils]: 12: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:47,784 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-11 00:51:47,784 INFO L280 TraceCheckUtils]: 14: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,784 INFO L280 TraceCheckUtils]: 15: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:47,785 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-11 00:51:47,785 INFO L280 TraceCheckUtils]: 17: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:47,785 INFO L280 TraceCheckUtils]: 18: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-11 00:51:47,786 INFO L280 TraceCheckUtils]: 19: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:47,786 INFO L280 TraceCheckUtils]: 20: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:47,787 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:47,788 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-11 00:51:47,789 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-11 00:51:47,789 INFO L280 TraceCheckUtils]: 24: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:47,790 INFO L280 TraceCheckUtils]: 25: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:47,791 INFO L280 TraceCheckUtils]: 26: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:47,791 INFO L280 TraceCheckUtils]: 27: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:47,792 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:47,793 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-11 00:51:47,794 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-11 00:51:47,794 INFO L280 TraceCheckUtils]: 31: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:47,795 INFO L280 TraceCheckUtils]: 32: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:47,795 INFO L280 TraceCheckUtils]: 33: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:47,796 INFO L280 TraceCheckUtils]: 34: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:47,797 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:47,798 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-11 00:51:47,798 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-11 00:51:47,799 INFO L280 TraceCheckUtils]: 38: Hoare triple {1495#(<= id_~ret~0 3)} havoc #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:47,799 INFO L280 TraceCheckUtils]: 39: Hoare triple {1495#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {1495#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:47,800 INFO L280 TraceCheckUtils]: 40: Hoare triple {1495#(<= id_~ret~0 3)} #res := ~ret~0; {1496#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:47,801 INFO L280 TraceCheckUtils]: 41: Hoare triple {1496#(<= |id_#res| 3)} assume true; {1496#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:47,802 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1496#(<= |id_#res| 3)} {1428#true} #43#return; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-11 00:51:47,802 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-11 00:51:47,803 INFO L280 TraceCheckUtils]: 44: Hoare triple {1467#(<= |main_#t~ret2| 3)} ~result~0 := #t~ret2; {1468#(<= main_~result~0 3)} is VALID [2020-07-11 00:51:47,804 INFO L280 TraceCheckUtils]: 45: Hoare triple {1468#(<= main_~result~0 3)} havoc #t~ret2; {1468#(<= main_~result~0 3)} is VALID [2020-07-11 00:51:47,804 INFO L280 TraceCheckUtils]: 46: Hoare triple {1468#(<= main_~result~0 3)} assume 10 == ~result~0; {1429#false} is VALID [2020-07-11 00:51:47,804 INFO L280 TraceCheckUtils]: 47: Hoare triple {1429#false} assume !false; {1429#false} is VALID [2020-07-11 00:51:47,807 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-11 00:51:47,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [895808561] [2020-07-11 00:51:47,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:47,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-11 00:51:47,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866457487] [2020-07-11 00:51:47,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2020-07-11 00:51:47,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:47,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-11 00:51:47,853 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-11 00:51:47,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-11 00:51:47,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:47,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-11 00:51:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-07-11 00:51:47,854 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 14 states. [2020-07-11 00:51:48,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:48,264 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2020-07-11 00:51:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 00:51:48,264 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2020-07-11 00:51:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 00:51:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2020-07-11 00:51:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 00:51:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2020-07-11 00:51:48,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 72 transitions. [2020-07-11 00:51:48,355 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-11 00:51:48,357 INFO L225 Difference]: With dead ends: 71 [2020-07-11 00:51:48,357 INFO L226 Difference]: Without dead ends: 51 [2020-07-11 00:51:48,358 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-11 00:51:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-11 00:51:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-07-11 00:51:48,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:48,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2020-07-11 00:51:48,401 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2020-07-11 00:51:48,402 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2020-07-11 00:51:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:48,406 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-07-11 00:51:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-07-11 00:51:48,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:48,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:48,407 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2020-07-11 00:51:48,407 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2020-07-11 00:51:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:48,410 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-07-11 00:51:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-07-11 00:51:48,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:48,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:48,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:48,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-11 00:51:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-07-11 00:51:48,415 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 48 [2020-07-11 00:51:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:48,416 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-07-11 00:51:48,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-11 00:51:48,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 51 transitions. [2020-07-11 00:51:48,467 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-11 00:51:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-11 00:51:48,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-11 00:51:48,469 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:48,469 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-11 00:51:48,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:51:48,469 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:48,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash 485800496, now seen corresponding path program 4 times [2020-07-11 00:51:48,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:48,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2049095900] [2020-07-11 00:51:48,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:48,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#true} assume true; {1882#true} is VALID [2020-07-11 00:51:48,548 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1882#true} {1882#true} #39#return; {1882#true} is VALID [2020-07-11 00:51:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:48,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#true} assume 0 == ~x; {1882#true} is VALID [2020-07-11 00:51:48,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {1882#true} #res := 0; {2025#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:48,824 INFO L280 TraceCheckUtils]: 3: Hoare triple {2025#(= 0 |id_#res|)} assume true; {2025#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:48,825 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2025#(= 0 |id_#res|)} {1882#true} #45#return; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:48,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,826 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-11 00:51:48,826 INFO L280 TraceCheckUtils]: 3: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,826 INFO L280 TraceCheckUtils]: 4: Hoare triple {1882#true} assume 0 == ~x; {1882#true} is VALID [2020-07-11 00:51:48,829 INFO L280 TraceCheckUtils]: 5: Hoare triple {1882#true} #res := 0; {2025#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:48,829 INFO L280 TraceCheckUtils]: 6: Hoare triple {2025#(= 0 |id_#res|)} assume true; {2025#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:48,838 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2025#(= 0 |id_#res|)} {1882#true} #45#return; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:48,838 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-11 00:51:48,839 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-11 00:51:48,840 INFO L280 TraceCheckUtils]: 10: Hoare triple {2023#(<= id_~ret~0 1)} havoc #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:48,840 INFO L280 TraceCheckUtils]: 11: Hoare triple {2023#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2023#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:48,841 INFO L280 TraceCheckUtils]: 12: Hoare triple {2023#(<= id_~ret~0 1)} #res := ~ret~0; {2024#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:48,841 INFO L280 TraceCheckUtils]: 13: Hoare triple {2024#(<= |id_#res| 1)} assume true; {2024#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:48,842 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2024#(<= |id_#res| 1)} {1882#true} #45#return; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:48,843 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,844 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,844 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-11 00:51:48,844 INFO L280 TraceCheckUtils]: 3: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,844 INFO L280 TraceCheckUtils]: 4: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,845 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-11 00:51:48,845 INFO L280 TraceCheckUtils]: 6: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,845 INFO L280 TraceCheckUtils]: 7: Hoare triple {1882#true} assume 0 == ~x; {1882#true} is VALID [2020-07-11 00:51:48,846 INFO L280 TraceCheckUtils]: 8: Hoare triple {1882#true} #res := 0; {2025#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:48,847 INFO L280 TraceCheckUtils]: 9: Hoare triple {2025#(= 0 |id_#res|)} assume true; {2025#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:48,848 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2025#(= 0 |id_#res|)} {1882#true} #45#return; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:48,848 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-11 00:51:48,850 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-11 00:51:48,850 INFO L280 TraceCheckUtils]: 13: Hoare triple {2023#(<= id_~ret~0 1)} havoc #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:48,851 INFO L280 TraceCheckUtils]: 14: Hoare triple {2023#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2023#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:48,851 INFO L280 TraceCheckUtils]: 15: Hoare triple {2023#(<= id_~ret~0 1)} #res := ~ret~0; {2024#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:48,852 INFO L280 TraceCheckUtils]: 16: Hoare triple {2024#(<= |id_#res| 1)} assume true; {2024#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:48,853 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2024#(<= |id_#res| 1)} {1882#true} #45#return; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:48,853 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-11 00:51:48,854 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-11 00:51:48,855 INFO L280 TraceCheckUtils]: 20: Hoare triple {2015#(<= id_~ret~0 2)} havoc #t~ret0; {2015#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:48,855 INFO L280 TraceCheckUtils]: 21: Hoare triple {2015#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2015#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:48,856 INFO L280 TraceCheckUtils]: 22: Hoare triple {2015#(<= id_~ret~0 2)} #res := ~ret~0; {2016#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:48,856 INFO L280 TraceCheckUtils]: 23: Hoare triple {2016#(<= |id_#res| 2)} assume true; {2016#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:48,857 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2016#(<= |id_#res| 2)} {1882#true} #45#return; {1996#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:48,858 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,859 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-11 00:51:48,859 INFO L280 TraceCheckUtils]: 3: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,859 INFO L280 TraceCheckUtils]: 4: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,859 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-11 00:51:48,860 INFO L280 TraceCheckUtils]: 6: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,860 INFO L280 TraceCheckUtils]: 7: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,860 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-11 00:51:48,860 INFO L280 TraceCheckUtils]: 9: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,860 INFO L280 TraceCheckUtils]: 10: Hoare triple {1882#true} assume 0 == ~x; {1882#true} is VALID [2020-07-11 00:51:48,862 INFO L280 TraceCheckUtils]: 11: Hoare triple {1882#true} #res := 0; {2025#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:48,863 INFO L280 TraceCheckUtils]: 12: Hoare triple {2025#(= 0 |id_#res|)} assume true; {2025#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:48,864 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2025#(= 0 |id_#res|)} {1882#true} #45#return; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:48,865 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-11 00:51:48,865 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-11 00:51:48,866 INFO L280 TraceCheckUtils]: 16: Hoare triple {2023#(<= id_~ret~0 1)} havoc #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:48,866 INFO L280 TraceCheckUtils]: 17: Hoare triple {2023#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2023#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:48,867 INFO L280 TraceCheckUtils]: 18: Hoare triple {2023#(<= id_~ret~0 1)} #res := ~ret~0; {2024#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:48,867 INFO L280 TraceCheckUtils]: 19: Hoare triple {2024#(<= |id_#res| 1)} assume true; {2024#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:48,869 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2024#(<= |id_#res| 1)} {1882#true} #45#return; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:48,870 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-11 00:51:48,871 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-11 00:51:48,872 INFO L280 TraceCheckUtils]: 23: Hoare triple {2015#(<= id_~ret~0 2)} havoc #t~ret0; {2015#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:48,873 INFO L280 TraceCheckUtils]: 24: Hoare triple {2015#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2015#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:48,874 INFO L280 TraceCheckUtils]: 25: Hoare triple {2015#(<= id_~ret~0 2)} #res := ~ret~0; {2016#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:48,874 INFO L280 TraceCheckUtils]: 26: Hoare triple {2016#(<= |id_#res| 2)} assume true; {2016#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:48,876 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2016#(<= |id_#res| 2)} {1882#true} #45#return; {1996#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:48,877 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-11 00:51:48,878 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-11 00:51:48,879 INFO L280 TraceCheckUtils]: 30: Hoare triple {1997#(<= id_~ret~0 3)} havoc #t~ret0; {1997#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:48,879 INFO L280 TraceCheckUtils]: 31: Hoare triple {1997#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {1997#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:48,883 INFO L280 TraceCheckUtils]: 32: Hoare triple {1997#(<= id_~ret~0 3)} #res := ~ret~0; {1998#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:48,884 INFO L280 TraceCheckUtils]: 33: Hoare triple {1998#(<= |id_#res| 3)} assume true; {1998#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:48,886 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1998#(<= |id_#res| 3)} {1882#true} #45#return; {1968#(<= |id_#t~ret0| 3)} is VALID [2020-07-11 00:51:48,889 INFO L280 TraceCheckUtils]: 0: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,889 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-11 00:51:48,890 INFO L280 TraceCheckUtils]: 3: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,890 INFO L280 TraceCheckUtils]: 4: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,891 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-11 00:51:48,891 INFO L280 TraceCheckUtils]: 6: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,892 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-11 00:51:48,900 INFO L280 TraceCheckUtils]: 9: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,900 INFO L280 TraceCheckUtils]: 10: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,901 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-11 00:51:48,901 INFO L280 TraceCheckUtils]: 12: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,901 INFO L280 TraceCheckUtils]: 13: Hoare triple {1882#true} assume 0 == ~x; {1882#true} is VALID [2020-07-11 00:51:48,912 INFO L280 TraceCheckUtils]: 14: Hoare triple {1882#true} #res := 0; {2025#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:48,913 INFO L280 TraceCheckUtils]: 15: Hoare triple {2025#(= 0 |id_#res|)} assume true; {2025#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:48,914 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2025#(= 0 |id_#res|)} {1882#true} #45#return; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:48,915 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-11 00:51:48,915 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-11 00:51:48,916 INFO L280 TraceCheckUtils]: 19: Hoare triple {2023#(<= id_~ret~0 1)} havoc #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:48,917 INFO L280 TraceCheckUtils]: 20: Hoare triple {2023#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2023#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:48,918 INFO L280 TraceCheckUtils]: 21: Hoare triple {2023#(<= id_~ret~0 1)} #res := ~ret~0; {2024#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:48,919 INFO L280 TraceCheckUtils]: 22: Hoare triple {2024#(<= |id_#res| 1)} assume true; {2024#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:48,920 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2024#(<= |id_#res| 1)} {1882#true} #45#return; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:48,921 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-11 00:51:48,922 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-11 00:51:48,923 INFO L280 TraceCheckUtils]: 26: Hoare triple {2015#(<= id_~ret~0 2)} havoc #t~ret0; {2015#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:48,923 INFO L280 TraceCheckUtils]: 27: Hoare triple {2015#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2015#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:48,924 INFO L280 TraceCheckUtils]: 28: Hoare triple {2015#(<= id_~ret~0 2)} #res := ~ret~0; {2016#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:48,925 INFO L280 TraceCheckUtils]: 29: Hoare triple {2016#(<= |id_#res| 2)} assume true; {2016#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:48,927 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2016#(<= |id_#res| 2)} {1882#true} #45#return; {1996#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:48,927 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-11 00:51:48,929 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-11 00:51:48,930 INFO L280 TraceCheckUtils]: 33: Hoare triple {1997#(<= id_~ret~0 3)} havoc #t~ret0; {1997#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:48,932 INFO L280 TraceCheckUtils]: 34: Hoare triple {1997#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {1997#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:48,932 INFO L280 TraceCheckUtils]: 35: Hoare triple {1997#(<= id_~ret~0 3)} #res := ~ret~0; {1998#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:48,933 INFO L280 TraceCheckUtils]: 36: Hoare triple {1998#(<= |id_#res| 3)} assume true; {1998#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:48,935 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1998#(<= |id_#res| 3)} {1882#true} #45#return; {1968#(<= |id_#t~ret0| 3)} is VALID [2020-07-11 00:51:48,935 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-11 00:51:48,936 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-11 00:51:48,937 INFO L280 TraceCheckUtils]: 40: Hoare triple {1969#(<= id_~ret~0 4)} havoc #t~ret0; {1969#(<= id_~ret~0 4)} is VALID [2020-07-11 00:51:48,938 INFO L280 TraceCheckUtils]: 41: Hoare triple {1969#(<= id_~ret~0 4)} assume !(~ret~0 > 5); {1969#(<= id_~ret~0 4)} is VALID [2020-07-11 00:51:48,939 INFO L280 TraceCheckUtils]: 42: Hoare triple {1969#(<= id_~ret~0 4)} #res := ~ret~0; {1970#(<= |id_#res| 4)} is VALID [2020-07-11 00:51:48,940 INFO L280 TraceCheckUtils]: 43: Hoare triple {1970#(<= |id_#res| 4)} assume true; {1970#(<= |id_#res| 4)} is VALID [2020-07-11 00:51:48,941 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1970#(<= |id_#res| 4)} {1882#true} #43#return; {1931#(<= |main_#t~ret2| 4)} is VALID [2020-07-11 00:51:48,945 INFO L263 TraceCheckUtils]: 0: Hoare triple {1882#true} call ULTIMATE.init(); {1882#true} is VALID [2020-07-11 00:51:48,946 INFO L280 TraceCheckUtils]: 1: Hoare triple {1882#true} assume true; {1882#true} is VALID [2020-07-11 00:51:48,946 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1882#true} {1882#true} #39#return; {1882#true} is VALID [2020-07-11 00:51:48,946 INFO L263 TraceCheckUtils]: 3: Hoare triple {1882#true} call #t~ret3 := main(); {1882#true} is VALID [2020-07-11 00:51:48,947 INFO L280 TraceCheckUtils]: 4: Hoare triple {1882#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1882#true} is VALID [2020-07-11 00:51:48,947 INFO L280 TraceCheckUtils]: 5: Hoare triple {1882#true} ~input~0 := #t~nondet1; {1882#true} is VALID [2020-07-11 00:51:48,947 INFO L280 TraceCheckUtils]: 6: Hoare triple {1882#true} havoc #t~nondet1; {1882#true} is VALID [2020-07-11 00:51:48,947 INFO L263 TraceCheckUtils]: 7: Hoare triple {1882#true} call #t~ret2 := id(~input~0); {1882#true} is VALID [2020-07-11 00:51:48,948 INFO L280 TraceCheckUtils]: 8: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,948 INFO L280 TraceCheckUtils]: 9: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,948 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-11 00:51:48,948 INFO L280 TraceCheckUtils]: 11: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,949 INFO L280 TraceCheckUtils]: 12: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,949 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-11 00:51:48,949 INFO L280 TraceCheckUtils]: 14: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,949 INFO L280 TraceCheckUtils]: 15: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,950 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-11 00:51:48,950 INFO L280 TraceCheckUtils]: 17: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,950 INFO L280 TraceCheckUtils]: 18: Hoare triple {1882#true} assume !(0 == ~x); {1882#true} is VALID [2020-07-11 00:51:48,951 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-11 00:51:48,951 INFO L280 TraceCheckUtils]: 20: Hoare triple {1882#true} ~x := #in~x; {1882#true} is VALID [2020-07-11 00:51:48,951 INFO L280 TraceCheckUtils]: 21: Hoare triple {1882#true} assume 0 == ~x; {1882#true} is VALID [2020-07-11 00:51:48,955 INFO L280 TraceCheckUtils]: 22: Hoare triple {1882#true} #res := 0; {2025#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:48,956 INFO L280 TraceCheckUtils]: 23: Hoare triple {2025#(= 0 |id_#res|)} assume true; {2025#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:48,957 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2025#(= 0 |id_#res|)} {1882#true} #45#return; {2022#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:48,957 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-11 00:51:48,958 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-11 00:51:48,959 INFO L280 TraceCheckUtils]: 27: Hoare triple {2023#(<= id_~ret~0 1)} havoc #t~ret0; {2023#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:48,959 INFO L280 TraceCheckUtils]: 28: Hoare triple {2023#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2023#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:48,960 INFO L280 TraceCheckUtils]: 29: Hoare triple {2023#(<= id_~ret~0 1)} #res := ~ret~0; {2024#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:48,960 INFO L280 TraceCheckUtils]: 30: Hoare triple {2024#(<= |id_#res| 1)} assume true; {2024#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:48,961 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2024#(<= |id_#res| 1)} {1882#true} #45#return; {2014#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:48,962 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-11 00:51:48,962 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-11 00:51:48,963 INFO L280 TraceCheckUtils]: 34: Hoare triple {2015#(<= id_~ret~0 2)} havoc #t~ret0; {2015#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:48,963 INFO L280 TraceCheckUtils]: 35: Hoare triple {2015#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2015#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:48,964 INFO L280 TraceCheckUtils]: 36: Hoare triple {2015#(<= id_~ret~0 2)} #res := ~ret~0; {2016#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:48,965 INFO L280 TraceCheckUtils]: 37: Hoare triple {2016#(<= |id_#res| 2)} assume true; {2016#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:48,966 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2016#(<= |id_#res| 2)} {1882#true} #45#return; {1996#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:48,967 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-11 00:51:48,968 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-11 00:51:48,969 INFO L280 TraceCheckUtils]: 41: Hoare triple {1997#(<= id_~ret~0 3)} havoc #t~ret0; {1997#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:48,970 INFO L280 TraceCheckUtils]: 42: Hoare triple {1997#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {1997#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:48,971 INFO L280 TraceCheckUtils]: 43: Hoare triple {1997#(<= id_~ret~0 3)} #res := ~ret~0; {1998#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:48,971 INFO L280 TraceCheckUtils]: 44: Hoare triple {1998#(<= |id_#res| 3)} assume true; {1998#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:48,973 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1998#(<= |id_#res| 3)} {1882#true} #45#return; {1968#(<= |id_#t~ret0| 3)} is VALID [2020-07-11 00:51:48,974 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-11 00:51:48,975 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-11 00:51:48,975 INFO L280 TraceCheckUtils]: 48: Hoare triple {1969#(<= id_~ret~0 4)} havoc #t~ret0; {1969#(<= id_~ret~0 4)} is VALID [2020-07-11 00:51:48,976 INFO L280 TraceCheckUtils]: 49: Hoare triple {1969#(<= id_~ret~0 4)} assume !(~ret~0 > 5); {1969#(<= id_~ret~0 4)} is VALID [2020-07-11 00:51:48,977 INFO L280 TraceCheckUtils]: 50: Hoare triple {1969#(<= id_~ret~0 4)} #res := ~ret~0; {1970#(<= |id_#res| 4)} is VALID [2020-07-11 00:51:48,978 INFO L280 TraceCheckUtils]: 51: Hoare triple {1970#(<= |id_#res| 4)} assume true; {1970#(<= |id_#res| 4)} is VALID [2020-07-11 00:51:48,979 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1970#(<= |id_#res| 4)} {1882#true} #43#return; {1931#(<= |main_#t~ret2| 4)} is VALID [2020-07-11 00:51:48,980 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-11 00:51:48,982 INFO L280 TraceCheckUtils]: 54: Hoare triple {1931#(<= |main_#t~ret2| 4)} ~result~0 := #t~ret2; {1932#(<= main_~result~0 4)} is VALID [2020-07-11 00:51:48,982 INFO L280 TraceCheckUtils]: 55: Hoare triple {1932#(<= main_~result~0 4)} havoc #t~ret2; {1932#(<= main_~result~0 4)} is VALID [2020-07-11 00:51:48,983 INFO L280 TraceCheckUtils]: 56: Hoare triple {1932#(<= main_~result~0 4)} assume 10 == ~result~0; {1883#false} is VALID [2020-07-11 00:51:48,984 INFO L280 TraceCheckUtils]: 57: Hoare triple {1883#false} assume !false; {1883#false} is VALID [2020-07-11 00:51:48,990 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-11 00:51:48,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2049095900] [2020-07-11 00:51:48,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:48,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-11 00:51:48,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724748133] [2020-07-11 00:51:48,994 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2020-07-11 00:51:48,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:48,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-11 00:51:49,057 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-11 00:51:49,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-11 00:51:49,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:49,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-11 00:51:49,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-07-11 00:51:49,059 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 17 states. [2020-07-11 00:51:49,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:49,593 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2020-07-11 00:51:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-11 00:51:49,593 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2020-07-11 00:51:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-11 00:51:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2020-07-11 00:51:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-11 00:51:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2020-07-11 00:51:49,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 79 transitions. [2020-07-11 00:51:49,677 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-11 00:51:49,679 INFO L225 Difference]: With dead ends: 78 [2020-07-11 00:51:49,680 INFO L226 Difference]: Without dead ends: 58 [2020-07-11 00:51:49,683 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-11 00:51:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-11 00:51:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2020-07-11 00:51:49,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:49,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2020-07-11 00:51:49,747 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2020-07-11 00:51:49,747 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2020-07-11 00:51:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:49,750 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2020-07-11 00:51:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-07-11 00:51:49,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:49,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:49,751 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2020-07-11 00:51:49,751 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2020-07-11 00:51:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:49,755 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2020-07-11 00:51:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-07-11 00:51:49,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:49,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:49,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:49,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-11 00:51:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2020-07-11 00:51:49,759 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 58 [2020-07-11 00:51:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:49,760 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2020-07-11 00:51:49,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-11 00:51:49,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 58 transitions. [2020-07-11 00:51:49,829 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-11 00:51:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-07-11 00:51:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-11 00:51:49,830 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:49,830 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-11 00:51:49,831 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 00:51:49,831 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1938626529, now seen corresponding path program 5 times [2020-07-11 00:51:49,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:49,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592616009] [2020-07-11 00:51:49,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:49,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} assume true; {2430#true} is VALID [2020-07-11 00:51:49,920 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2430#true} {2430#true} #39#return; {2430#true} is VALID [2020-07-11 00:51:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:50,325 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-11 00:51:50,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,327 INFO L280 TraceCheckUtils]: 3: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,328 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:50,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,329 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-11 00:51:50,329 INFO L280 TraceCheckUtils]: 3: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,329 INFO L280 TraceCheckUtils]: 4: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-11 00:51:50,330 INFO L280 TraceCheckUtils]: 5: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,331 INFO L280 TraceCheckUtils]: 6: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,332 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:50,332 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-11 00:51:50,333 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-11 00:51:50,333 INFO L280 TraceCheckUtils]: 10: Hoare triple {2629#(<= id_~ret~0 1)} havoc #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:50,334 INFO L280 TraceCheckUtils]: 11: Hoare triple {2629#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2629#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:50,335 INFO L280 TraceCheckUtils]: 12: Hoare triple {2629#(<= id_~ret~0 1)} #res := ~ret~0; {2630#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:50,335 INFO L280 TraceCheckUtils]: 13: Hoare triple {2630#(<= |id_#res| 1)} assume true; {2630#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:50,336 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2630#(<= |id_#res| 1)} {2430#true} #45#return; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:50,337 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,337 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-11 00:51:50,337 INFO L280 TraceCheckUtils]: 3: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,337 INFO L280 TraceCheckUtils]: 4: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,338 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-11 00:51:50,338 INFO L280 TraceCheckUtils]: 6: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,338 INFO L280 TraceCheckUtils]: 7: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-11 00:51:50,339 INFO L280 TraceCheckUtils]: 8: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,339 INFO L280 TraceCheckUtils]: 9: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,340 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:50,341 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-11 00:51:50,342 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-11 00:51:50,342 INFO L280 TraceCheckUtils]: 13: Hoare triple {2629#(<= id_~ret~0 1)} havoc #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:50,343 INFO L280 TraceCheckUtils]: 14: Hoare triple {2629#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2629#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:50,343 INFO L280 TraceCheckUtils]: 15: Hoare triple {2629#(<= id_~ret~0 1)} #res := ~ret~0; {2630#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:50,344 INFO L280 TraceCheckUtils]: 16: Hoare triple {2630#(<= |id_#res| 1)} assume true; {2630#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:50,345 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2630#(<= |id_#res| 1)} {2430#true} #45#return; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:50,345 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-11 00:51:50,346 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-11 00:51:50,347 INFO L280 TraceCheckUtils]: 20: Hoare triple {2621#(<= id_~ret~0 2)} havoc #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:50,347 INFO L280 TraceCheckUtils]: 21: Hoare triple {2621#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2621#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:50,348 INFO L280 TraceCheckUtils]: 22: Hoare triple {2621#(<= id_~ret~0 2)} #res := ~ret~0; {2622#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:50,349 INFO L280 TraceCheckUtils]: 23: Hoare triple {2622#(<= |id_#res| 2)} assume true; {2622#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:50,351 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2622#(<= |id_#res| 2)} {2430#true} #45#return; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:50,351 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,352 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-11 00:51:50,352 INFO L280 TraceCheckUtils]: 3: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,352 INFO L280 TraceCheckUtils]: 4: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,353 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-11 00:51:50,353 INFO L280 TraceCheckUtils]: 6: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,353 INFO L280 TraceCheckUtils]: 7: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,353 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-11 00:51:50,353 INFO L280 TraceCheckUtils]: 9: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,354 INFO L280 TraceCheckUtils]: 10: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-11 00:51:50,354 INFO L280 TraceCheckUtils]: 11: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,355 INFO L280 TraceCheckUtils]: 12: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,356 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:50,356 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-11 00:51:50,357 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-11 00:51:50,358 INFO L280 TraceCheckUtils]: 16: Hoare triple {2629#(<= id_~ret~0 1)} havoc #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:50,358 INFO L280 TraceCheckUtils]: 17: Hoare triple {2629#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2629#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:50,359 INFO L280 TraceCheckUtils]: 18: Hoare triple {2629#(<= id_~ret~0 1)} #res := ~ret~0; {2630#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:50,359 INFO L280 TraceCheckUtils]: 19: Hoare triple {2630#(<= |id_#res| 1)} assume true; {2630#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:50,360 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2630#(<= |id_#res| 1)} {2430#true} #45#return; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:50,361 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-11 00:51:50,362 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-11 00:51:50,362 INFO L280 TraceCheckUtils]: 23: Hoare triple {2621#(<= id_~ret~0 2)} havoc #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:50,363 INFO L280 TraceCheckUtils]: 24: Hoare triple {2621#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2621#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:50,363 INFO L280 TraceCheckUtils]: 25: Hoare triple {2621#(<= id_~ret~0 2)} #res := ~ret~0; {2622#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:50,364 INFO L280 TraceCheckUtils]: 26: Hoare triple {2622#(<= |id_#res| 2)} assume true; {2622#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:50,365 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2622#(<= |id_#res| 2)} {2430#true} #45#return; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:50,366 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-11 00:51:50,366 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-11 00:51:50,367 INFO L280 TraceCheckUtils]: 30: Hoare triple {2603#(<= id_~ret~0 3)} havoc #t~ret0; {2603#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:50,367 INFO L280 TraceCheckUtils]: 31: Hoare triple {2603#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {2603#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:50,368 INFO L280 TraceCheckUtils]: 32: Hoare triple {2603#(<= id_~ret~0 3)} #res := ~ret~0; {2604#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:50,368 INFO L280 TraceCheckUtils]: 33: Hoare triple {2604#(<= |id_#res| 3)} assume true; {2604#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:50,370 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2604#(<= |id_#res| 3)} {2430#true} #45#return; {2574#(<= |id_#t~ret0| 3)} is VALID [2020-07-11 00:51:50,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,371 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-11 00:51:50,372 INFO L280 TraceCheckUtils]: 3: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,372 INFO L280 TraceCheckUtils]: 4: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,372 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-11 00:51:50,372 INFO L280 TraceCheckUtils]: 6: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,372 INFO L280 TraceCheckUtils]: 7: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,373 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-11 00:51:50,373 INFO L280 TraceCheckUtils]: 9: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,373 INFO L280 TraceCheckUtils]: 10: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,373 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-11 00:51:50,373 INFO L280 TraceCheckUtils]: 12: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,374 INFO L280 TraceCheckUtils]: 13: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-11 00:51:50,374 INFO L280 TraceCheckUtils]: 14: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,375 INFO L280 TraceCheckUtils]: 15: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,375 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:50,376 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-11 00:51:50,376 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-11 00:51:50,377 INFO L280 TraceCheckUtils]: 19: Hoare triple {2629#(<= id_~ret~0 1)} havoc #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:50,377 INFO L280 TraceCheckUtils]: 20: Hoare triple {2629#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2629#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:50,380 INFO L280 TraceCheckUtils]: 21: Hoare triple {2629#(<= id_~ret~0 1)} #res := ~ret~0; {2630#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:50,382 INFO L280 TraceCheckUtils]: 22: Hoare triple {2630#(<= |id_#res| 1)} assume true; {2630#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:50,383 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2630#(<= |id_#res| 1)} {2430#true} #45#return; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:50,384 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-11 00:51:50,384 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-11 00:51:50,385 INFO L280 TraceCheckUtils]: 26: Hoare triple {2621#(<= id_~ret~0 2)} havoc #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:50,385 INFO L280 TraceCheckUtils]: 27: Hoare triple {2621#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2621#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:50,386 INFO L280 TraceCheckUtils]: 28: Hoare triple {2621#(<= id_~ret~0 2)} #res := ~ret~0; {2622#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:50,386 INFO L280 TraceCheckUtils]: 29: Hoare triple {2622#(<= |id_#res| 2)} assume true; {2622#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:50,387 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2622#(<= |id_#res| 2)} {2430#true} #45#return; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:50,387 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-11 00:51:50,388 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-11 00:51:50,388 INFO L280 TraceCheckUtils]: 33: Hoare triple {2603#(<= id_~ret~0 3)} havoc #t~ret0; {2603#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:50,388 INFO L280 TraceCheckUtils]: 34: Hoare triple {2603#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {2603#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:50,389 INFO L280 TraceCheckUtils]: 35: Hoare triple {2603#(<= id_~ret~0 3)} #res := ~ret~0; {2604#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:50,389 INFO L280 TraceCheckUtils]: 36: Hoare triple {2604#(<= |id_#res| 3)} assume true; {2604#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:50,393 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2604#(<= |id_#res| 3)} {2430#true} #45#return; {2574#(<= |id_#t~ret0| 3)} is VALID [2020-07-11 00:51:50,393 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-11 00:51:50,394 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-11 00:51:50,394 INFO L280 TraceCheckUtils]: 40: Hoare triple {2575#(<= id_~ret~0 4)} havoc #t~ret0; {2575#(<= id_~ret~0 4)} is VALID [2020-07-11 00:51:50,395 INFO L280 TraceCheckUtils]: 41: Hoare triple {2575#(<= id_~ret~0 4)} assume !(~ret~0 > 5); {2575#(<= id_~ret~0 4)} is VALID [2020-07-11 00:51:50,395 INFO L280 TraceCheckUtils]: 42: Hoare triple {2575#(<= id_~ret~0 4)} #res := ~ret~0; {2576#(<= |id_#res| 4)} is VALID [2020-07-11 00:51:50,396 INFO L280 TraceCheckUtils]: 43: Hoare triple {2576#(<= |id_#res| 4)} assume true; {2576#(<= |id_#res| 4)} is VALID [2020-07-11 00:51:50,396 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2576#(<= |id_#res| 4)} {2430#true} #45#return; {2536#(<= |id_#t~ret0| 4)} is VALID [2020-07-11 00:51:50,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,399 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-11 00:51:50,399 INFO L280 TraceCheckUtils]: 3: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,399 INFO L280 TraceCheckUtils]: 4: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,399 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-11 00:51:50,400 INFO L280 TraceCheckUtils]: 6: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,400 INFO L280 TraceCheckUtils]: 7: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,400 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-11 00:51:50,400 INFO L280 TraceCheckUtils]: 9: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,401 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-11 00:51:50,401 INFO L280 TraceCheckUtils]: 12: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,401 INFO L280 TraceCheckUtils]: 13: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,401 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-11 00:51:50,401 INFO L280 TraceCheckUtils]: 15: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,402 INFO L280 TraceCheckUtils]: 16: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-11 00:51:50,402 INFO L280 TraceCheckUtils]: 17: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,403 INFO L280 TraceCheckUtils]: 18: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,404 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:50,404 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-11 00:51:50,405 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-11 00:51:50,405 INFO L280 TraceCheckUtils]: 22: Hoare triple {2629#(<= id_~ret~0 1)} havoc #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:50,406 INFO L280 TraceCheckUtils]: 23: Hoare triple {2629#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2629#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:50,406 INFO L280 TraceCheckUtils]: 24: Hoare triple {2629#(<= id_~ret~0 1)} #res := ~ret~0; {2630#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:50,407 INFO L280 TraceCheckUtils]: 25: Hoare triple {2630#(<= |id_#res| 1)} assume true; {2630#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:50,408 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2630#(<= |id_#res| 1)} {2430#true} #45#return; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:50,408 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-11 00:51:50,409 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-11 00:51:50,409 INFO L280 TraceCheckUtils]: 29: Hoare triple {2621#(<= id_~ret~0 2)} havoc #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:50,410 INFO L280 TraceCheckUtils]: 30: Hoare triple {2621#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2621#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:50,410 INFO L280 TraceCheckUtils]: 31: Hoare triple {2621#(<= id_~ret~0 2)} #res := ~ret~0; {2622#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:50,411 INFO L280 TraceCheckUtils]: 32: Hoare triple {2622#(<= |id_#res| 2)} assume true; {2622#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:50,412 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2622#(<= |id_#res| 2)} {2430#true} #45#return; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:50,412 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-11 00:51:50,413 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-11 00:51:50,413 INFO L280 TraceCheckUtils]: 36: Hoare triple {2603#(<= id_~ret~0 3)} havoc #t~ret0; {2603#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:50,414 INFO L280 TraceCheckUtils]: 37: Hoare triple {2603#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {2603#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:50,414 INFO L280 TraceCheckUtils]: 38: Hoare triple {2603#(<= id_~ret~0 3)} #res := ~ret~0; {2604#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:50,415 INFO L280 TraceCheckUtils]: 39: Hoare triple {2604#(<= |id_#res| 3)} assume true; {2604#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:50,416 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2604#(<= |id_#res| 3)} {2430#true} #45#return; {2574#(<= |id_#t~ret0| 3)} is VALID [2020-07-11 00:51:50,416 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-11 00:51:50,417 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-11 00:51:50,418 INFO L280 TraceCheckUtils]: 43: Hoare triple {2575#(<= id_~ret~0 4)} havoc #t~ret0; {2575#(<= id_~ret~0 4)} is VALID [2020-07-11 00:51:50,418 INFO L280 TraceCheckUtils]: 44: Hoare triple {2575#(<= id_~ret~0 4)} assume !(~ret~0 > 5); {2575#(<= id_~ret~0 4)} is VALID [2020-07-11 00:51:50,419 INFO L280 TraceCheckUtils]: 45: Hoare triple {2575#(<= id_~ret~0 4)} #res := ~ret~0; {2576#(<= |id_#res| 4)} is VALID [2020-07-11 00:51:50,419 INFO L280 TraceCheckUtils]: 46: Hoare triple {2576#(<= |id_#res| 4)} assume true; {2576#(<= |id_#res| 4)} is VALID [2020-07-11 00:51:50,420 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2576#(<= |id_#res| 4)} {2430#true} #45#return; {2536#(<= |id_#t~ret0| 4)} is VALID [2020-07-11 00:51:50,421 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-11 00:51:50,421 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-11 00:51:50,422 INFO L280 TraceCheckUtils]: 50: Hoare triple {2537#(<= id_~ret~0 5)} havoc #t~ret0; {2537#(<= id_~ret~0 5)} is VALID [2020-07-11 00:51:50,422 INFO L280 TraceCheckUtils]: 51: Hoare triple {2537#(<= id_~ret~0 5)} assume !(~ret~0 > 5); {2537#(<= id_~ret~0 5)} is VALID [2020-07-11 00:51:50,423 INFO L280 TraceCheckUtils]: 52: Hoare triple {2537#(<= id_~ret~0 5)} #res := ~ret~0; {2538#(<= |id_#res| 5)} is VALID [2020-07-11 00:51:50,423 INFO L280 TraceCheckUtils]: 53: Hoare triple {2538#(<= |id_#res| 5)} assume true; {2538#(<= |id_#res| 5)} is VALID [2020-07-11 00:51:50,424 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {2538#(<= |id_#res| 5)} {2430#true} #43#return; {2489#(<= |main_#t~ret2| 5)} is VALID [2020-07-11 00:51:50,427 INFO L263 TraceCheckUtils]: 0: Hoare triple {2430#true} call ULTIMATE.init(); {2430#true} is VALID [2020-07-11 00:51:50,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {2430#true} assume true; {2430#true} is VALID [2020-07-11 00:51:50,427 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2430#true} {2430#true} #39#return; {2430#true} is VALID [2020-07-11 00:51:50,427 INFO L263 TraceCheckUtils]: 3: Hoare triple {2430#true} call #t~ret3 := main(); {2430#true} is VALID [2020-07-11 00:51:50,428 INFO L280 TraceCheckUtils]: 4: Hoare triple {2430#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2430#true} is VALID [2020-07-11 00:51:50,428 INFO L280 TraceCheckUtils]: 5: Hoare triple {2430#true} ~input~0 := #t~nondet1; {2430#true} is VALID [2020-07-11 00:51:50,428 INFO L280 TraceCheckUtils]: 6: Hoare triple {2430#true} havoc #t~nondet1; {2430#true} is VALID [2020-07-11 00:51:50,428 INFO L263 TraceCheckUtils]: 7: Hoare triple {2430#true} call #t~ret2 := id(~input~0); {2430#true} is VALID [2020-07-11 00:51:50,428 INFO L280 TraceCheckUtils]: 8: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,429 INFO L280 TraceCheckUtils]: 9: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,429 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-11 00:51:50,429 INFO L280 TraceCheckUtils]: 11: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,429 INFO L280 TraceCheckUtils]: 12: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,429 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-11 00:51:50,430 INFO L280 TraceCheckUtils]: 14: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,430 INFO L280 TraceCheckUtils]: 15: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,430 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-11 00:51:50,430 INFO L280 TraceCheckUtils]: 17: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,430 INFO L280 TraceCheckUtils]: 18: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,431 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-11 00:51:50,431 INFO L280 TraceCheckUtils]: 20: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,431 INFO L280 TraceCheckUtils]: 21: Hoare triple {2430#true} assume !(0 == ~x); {2430#true} is VALID [2020-07-11 00:51:50,431 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-11 00:51:50,431 INFO L280 TraceCheckUtils]: 23: Hoare triple {2430#true} ~x := #in~x; {2430#true} is VALID [2020-07-11 00:51:50,431 INFO L280 TraceCheckUtils]: 24: Hoare triple {2430#true} assume 0 == ~x; {2430#true} is VALID [2020-07-11 00:51:50,433 INFO L280 TraceCheckUtils]: 25: Hoare triple {2430#true} #res := 0; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,436 INFO L280 TraceCheckUtils]: 26: Hoare triple {2631#(= 0 |id_#res|)} assume true; {2631#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:50,437 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2631#(= 0 |id_#res|)} {2430#true} #45#return; {2628#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:50,438 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-11 00:51:50,440 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-11 00:51:50,441 INFO L280 TraceCheckUtils]: 30: Hoare triple {2629#(<= id_~ret~0 1)} havoc #t~ret0; {2629#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:50,442 INFO L280 TraceCheckUtils]: 31: Hoare triple {2629#(<= id_~ret~0 1)} assume !(~ret~0 > 5); {2629#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:50,442 INFO L280 TraceCheckUtils]: 32: Hoare triple {2629#(<= id_~ret~0 1)} #res := ~ret~0; {2630#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:50,443 INFO L280 TraceCheckUtils]: 33: Hoare triple {2630#(<= |id_#res| 1)} assume true; {2630#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:50,444 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2630#(<= |id_#res| 1)} {2430#true} #45#return; {2620#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:50,444 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-11 00:51:50,445 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-11 00:51:50,446 INFO L280 TraceCheckUtils]: 37: Hoare triple {2621#(<= id_~ret~0 2)} havoc #t~ret0; {2621#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:50,446 INFO L280 TraceCheckUtils]: 38: Hoare triple {2621#(<= id_~ret~0 2)} assume !(~ret~0 > 5); {2621#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:50,447 INFO L280 TraceCheckUtils]: 39: Hoare triple {2621#(<= id_~ret~0 2)} #res := ~ret~0; {2622#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:50,447 INFO L280 TraceCheckUtils]: 40: Hoare triple {2622#(<= |id_#res| 2)} assume true; {2622#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:50,448 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2622#(<= |id_#res| 2)} {2430#true} #45#return; {2602#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:50,449 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-11 00:51:50,450 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-11 00:51:50,450 INFO L280 TraceCheckUtils]: 44: Hoare triple {2603#(<= id_~ret~0 3)} havoc #t~ret0; {2603#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:50,451 INFO L280 TraceCheckUtils]: 45: Hoare triple {2603#(<= id_~ret~0 3)} assume !(~ret~0 > 5); {2603#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:50,451 INFO L280 TraceCheckUtils]: 46: Hoare triple {2603#(<= id_~ret~0 3)} #res := ~ret~0; {2604#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:50,452 INFO L280 TraceCheckUtils]: 47: Hoare triple {2604#(<= |id_#res| 3)} assume true; {2604#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:50,453 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2604#(<= |id_#res| 3)} {2430#true} #45#return; {2574#(<= |id_#t~ret0| 3)} is VALID [2020-07-11 00:51:50,453 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-11 00:51:50,454 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-11 00:51:50,454 INFO L280 TraceCheckUtils]: 51: Hoare triple {2575#(<= id_~ret~0 4)} havoc #t~ret0; {2575#(<= id_~ret~0 4)} is VALID [2020-07-11 00:51:50,455 INFO L280 TraceCheckUtils]: 52: Hoare triple {2575#(<= id_~ret~0 4)} assume !(~ret~0 > 5); {2575#(<= id_~ret~0 4)} is VALID [2020-07-11 00:51:50,455 INFO L280 TraceCheckUtils]: 53: Hoare triple {2575#(<= id_~ret~0 4)} #res := ~ret~0; {2576#(<= |id_#res| 4)} is VALID [2020-07-11 00:51:50,456 INFO L280 TraceCheckUtils]: 54: Hoare triple {2576#(<= |id_#res| 4)} assume true; {2576#(<= |id_#res| 4)} is VALID [2020-07-11 00:51:50,457 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {2576#(<= |id_#res| 4)} {2430#true} #45#return; {2536#(<= |id_#t~ret0| 4)} is VALID [2020-07-11 00:51:50,458 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-11 00:51:50,458 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-11 00:51:50,459 INFO L280 TraceCheckUtils]: 58: Hoare triple {2537#(<= id_~ret~0 5)} havoc #t~ret0; {2537#(<= id_~ret~0 5)} is VALID [2020-07-11 00:51:50,459 INFO L280 TraceCheckUtils]: 59: Hoare triple {2537#(<= id_~ret~0 5)} assume !(~ret~0 > 5); {2537#(<= id_~ret~0 5)} is VALID [2020-07-11 00:51:50,460 INFO L280 TraceCheckUtils]: 60: Hoare triple {2537#(<= id_~ret~0 5)} #res := ~ret~0; {2538#(<= |id_#res| 5)} is VALID [2020-07-11 00:51:50,460 INFO L280 TraceCheckUtils]: 61: Hoare triple {2538#(<= |id_#res| 5)} assume true; {2538#(<= |id_#res| 5)} is VALID [2020-07-11 00:51:50,461 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2538#(<= |id_#res| 5)} {2430#true} #43#return; {2489#(<= |main_#t~ret2| 5)} is VALID [2020-07-11 00:51:50,462 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-11 00:51:50,462 INFO L280 TraceCheckUtils]: 64: Hoare triple {2489#(<= |main_#t~ret2| 5)} ~result~0 := #t~ret2; {2490#(<= main_~result~0 5)} is VALID [2020-07-11 00:51:50,463 INFO L280 TraceCheckUtils]: 65: Hoare triple {2490#(<= main_~result~0 5)} havoc #t~ret2; {2490#(<= main_~result~0 5)} is VALID [2020-07-11 00:51:50,463 INFO L280 TraceCheckUtils]: 66: Hoare triple {2490#(<= main_~result~0 5)} assume 10 == ~result~0; {2431#false} is VALID [2020-07-11 00:51:50,463 INFO L280 TraceCheckUtils]: 67: Hoare triple {2431#false} assume !false; {2431#false} is VALID [2020-07-11 00:51:50,467 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-11 00:51:50,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592616009] [2020-07-11 00:51:50,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:50,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-11 00:51:50,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863097909] [2020-07-11 00:51:50,469 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2020-07-11 00:51:50,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:50,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-11 00:51:50,527 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-11 00:51:50,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-11 00:51:50,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:50,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-11 00:51:50,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2020-07-11 00:51:50,528 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 20 states. [2020-07-11 00:51:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:51,003 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2020-07-11 00:51:51,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-11 00:51:51,003 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2020-07-11 00:51:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 00:51:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions. [2020-07-11 00:51:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 00:51:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions. [2020-07-11 00:51:51,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 79 transitions. [2020-07-11 00:51:51,099 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-11 00:51:51,099 INFO L225 Difference]: With dead ends: 76 [2020-07-11 00:51:51,099 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:51:51,101 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-11 00:51:51,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:51:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:51:51,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:51,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:51,104 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:51,104 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:51,105 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:51:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:51:51,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:51,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:51,105 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:51,106 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:51,106 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:51:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:51:51,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:51,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:51,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:51,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:51:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:51:51,107 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2020-07-11 00:51:51,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:51,107 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:51:51,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-11 00:51:51,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:51:51,108 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-11 00:51:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:51:51,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:51,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 00:51:51,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:51:51,387 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:51:51,387 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:51:51,387 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:51:51,387 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:51:51,387 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:51:51,387 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:51:51,388 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) the Hoare annotation is: false [2020-07-11 00:51:51,388 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-11 00:51:51,388 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: true [2020-07-11 00:51:51,388 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-07-11 00:51:51,388 INFO L264 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (<= main_~result~0 5) [2020-07-11 00:51:51,388 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-11 00:51:51,388 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-11 00:51:51,389 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (<= |main_#t~ret2| 5) [2020-07-11 00:51:51,389 INFO L271 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: true [2020-07-11 00:51:51,389 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-11 00:51:51,389 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (<= |main_#t~ret2| 5) [2020-07-11 00:51:51,390 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-11 00:51:51,390 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 9) the Hoare annotation is: (<= |id_#res| 5) [2020-07-11 00:51:51,390 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 9) the Hoare annotation is: (<= |id_#res| 5) [2020-07-11 00:51:51,390 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 9) the Hoare annotation is: true [2020-07-11 00:51:51,390 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (<= id_~ret~0 5) [2020-07-11 00:51:51,390 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-11 00:51:51,390 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-11 00:51:51,391 INFO L271 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: true [2020-07-11 00:51:51,391 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-11 00:51:51,391 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-11 00:51:51,391 INFO L271 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-07-11 00:51:51,391 INFO L271 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: true [2020-07-11 00:51:51,392 INFO L271 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: true [2020-07-11 00:51:51,404 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-11 00:51:51,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:51:51 BoogieIcfgContainer [2020-07-11 00:51:51,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:51:51,426 INFO L168 Benchmark]: Toolchain (without parser) took 8133.76 ms. Allocated memory was 139.5 MB in the beginning and 322.4 MB in the end (delta: 183.0 MB). Free memory was 103.7 MB in the beginning and 238.6 MB in the end (delta: -134.9 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:51,427 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 00:51:51,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.71 ms. Allocated memory is still 139.5 MB. Free memory was 103.5 MB in the beginning and 94.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:51,428 INFO L168 Benchmark]: Boogie Preprocessor took 28.83 ms. Allocated memory is still 139.5 MB. Free memory was 94.0 MB in the beginning and 92.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:51,429 INFO L168 Benchmark]: RCFGBuilder took 404.17 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 92.6 MB in the beginning and 166.3 MB in the end (delta: -73.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:51,433 INFO L168 Benchmark]: TraceAbstraction took 7475.60 ms. Allocated memory was 203.9 MB in the beginning and 322.4 MB in the end (delta: 118.5 MB). Free memory was 166.3 MB in the beginning and 238.6 MB in the end (delta: -72.3 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:51,439 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 218.71 ms. Allocated memory is still 139.5 MB. Free memory was 103.5 MB in the beginning and 94.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.83 ms. Allocated memory is still 139.5 MB. Free memory was 94.0 MB in the beginning and 92.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 404.17 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 92.6 MB in the beginning and 166.3 MB in the end (delta: -73.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7475.60 ms. Allocated memory was 203.9 MB in the beginning and 322.4 MB in the end (delta: 118.5 MB). Free memory was 166.3 MB in the beginning and 238.6 MB in the end (delta: -72.3 MB). Peak memory consumption was 46.2 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.0s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, 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.0s 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...