/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:21:23,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:21:23,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:21:23,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:21:23,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:21:23,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:21:23,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:21:23,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:21:23,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:21:23,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:21:23,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:21:23,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:21:23,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:21:23,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:21:23,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:21:23,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:21:23,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:21:23,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:21:23,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:21:23,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:21:23,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:21:23,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:21:23,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:21:23,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:21:23,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:21:23,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:21:23,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:21:23,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:21:23,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:21:23,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:21:23,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:21:23,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:21:23,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:21:23,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:21:23,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:21:23,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:21:23,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:21:23,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:21:23,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:21:23,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:21:23,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:21:23,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:21:23,303 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:21:23,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:21:23,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:21:23,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:21:23,305 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:21:23,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:21:23,305 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:21:23,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:21:23,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:21:23,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:21:23,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:21:23,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:21:23,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:21:23,307 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:21:23,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:21:23,307 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:21:23,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:21:23,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:21:23,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:21:23,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:21:23,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:21:23,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:21:23,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:21:23,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:21:23,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:21:23,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:21:23,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:21:23,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:21:23,310 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:21:23,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:21:23,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:21:23,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:21:23,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:21:23,616 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:21:23,616 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:21:23,617 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-07-17 22:21:23,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7f6aae9/0e3f5f8688164c0e9f59c149a794e4c5/FLAGcc080aa65 [2020-07-17 22:21:24,209 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:21:24,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-07-17 22:21:24,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7f6aae9/0e3f5f8688164c0e9f59c149a794e4c5/FLAGcc080aa65 [2020-07-17 22:21:24,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7f6aae9/0e3f5f8688164c0e9f59c149a794e4c5 [2020-07-17 22:21:24,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:21:24,563 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:21:24,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:21:24,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:21:24,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:21:24,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55456146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24, skipping insertion in model container [2020-07-17 22:21:24,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:21:24,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:21:24,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:21:24,894 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:21:24,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:21:24,937 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:21:24,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24 WrapperNode [2020-07-17 22:21:24,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:21:24,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:21:24,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:21:24,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:21:24,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:21:24,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:21:24,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:21:24,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:21:24,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (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-17 22:21:25,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:21:25,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:21:25,139 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-17 22:21:25,139 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-07-17 22:21:25,139 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:21:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:21:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:21:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-17 22:21:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-07-17 22:21:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:21:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:21:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:21:25,383 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:21:25,383 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:21:25,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:21:25 BoogieIcfgContainer [2020-07-17 22:21:25,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:21:25,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:21:25,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:21:25,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:21:25,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:21:24" (1/3) ... [2020-07-17 22:21:25,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0825b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:21:25, skipping insertion in model container [2020-07-17 22:21:25,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (2/3) ... [2020-07-17 22:21:25,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0825b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:21:25, skipping insertion in model container [2020-07-17 22:21:25,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:21:25" (3/3) ... [2020-07-17 22:21:25,399 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2020-07-17 22:21:25,412 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:21:25,421 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:21:25,444 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:21:25,477 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:21:25,477 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:21:25,477 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:21:25,477 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:21:25,478 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:21:25,478 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:21:25,478 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:21:25,479 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:21:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-17 22:21:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:21:25,519 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:25,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:25,521 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:25,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:25,533 INFO L82 PathProgramCache]: Analyzing trace with hash -550894517, now seen corresponding path program 1 times [2020-07-17 22:21:25,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:25,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173689279] [2020-07-17 22:21:25,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:25,767 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-17 22:21:25,768 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #36#return; {29#true} is VALID [2020-07-17 22:21:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:25,821 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:25,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:25,824 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:25,826 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#(= 0 |id_#in~x|)} {33#(<= 5 main_~input~0)} #40#return; {30#false} is VALID [2020-07-17 22:21:25,827 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-17 22:21:25,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-17 22:21:25,828 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #36#return; {29#true} is VALID [2020-07-17 22:21:25,828 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret3 := main(); {29#true} is VALID [2020-07-17 22:21:25,830 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} ~input~0 := 5; {33#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:25,831 INFO L263 TraceCheckUtils]: 5: Hoare triple {33#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {29#true} is VALID [2020-07-17 22:21:25,832 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:25,834 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:25,835 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:25,837 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {39#(= 0 |id_#in~x|)} {33#(<= 5 main_~input~0)} #40#return; {30#false} is VALID [2020-07-17 22:21:25,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {30#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {30#false} is VALID [2020-07-17 22:21:25,838 INFO L280 TraceCheckUtils]: 11: Hoare triple {30#false} assume 5 != ~result~0; {30#false} is VALID [2020-07-17 22:21:25,839 INFO L280 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-17 22:21:25,841 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-17 22:21:25,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173689279] [2020-07-17 22:21:25,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:21:25,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:21:25,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694027295] [2020-07-17 22:21:25,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:21:25,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:25,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:21:25,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:25,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:21:25,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:25,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:21:25,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:21:25,904 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2020-07-17 22:21:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,148 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-17 22:21:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:21:26,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:21:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-17 22:21:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-17 22:21:26,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-17 22:21:26,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:26,250 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:21:26,251 INFO L226 Difference]: Without dead ends: 24 [2020-07-17 22:21:26,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-17 22:21:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-17 22:21:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-17 22:21:26,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:26,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-17 22:21:26,307 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:21:26,307 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:21:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,313 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-17 22:21:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-17 22:21:26,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:26,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:26,315 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:21:26,315 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:21:26,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,320 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-17 22:21:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-17 22:21:26,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:26,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:26,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:26,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:21:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-17 22:21:26,326 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2020-07-17 22:21:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:26,327 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-17 22:21:26,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:21:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-17 22:21:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:21:26,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:26,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:26,329 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:21:26,330 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash 40504409, now seen corresponding path program 1 times [2020-07-17 22:21:26,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:26,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430206342] [2020-07-17 22:21:26,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {170#true} assume true; {170#true} is VALID [2020-07-17 22:21:26,410 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {170#true} {170#true} #36#return; {170#true} is VALID [2020-07-17 22:21:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {170#true} ~x := #in~x; {191#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:26,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {191#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:26,508 INFO L280 TraceCheckUtils]: 2: Hoare triple {192#(= 0 |id2_#in~x|)} assume true; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:26,510 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {192#(= 0 |id2_#in~x|)} {185#(= |id_#in~x| id_~x)} #42#return; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,511 INFO L280 TraceCheckUtils]: 0: Hoare triple {170#true} ~x := #in~x; {185#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:26,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {185#(= |id_#in~x| id_~x)} assume !(0 == ~x); {185#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:26,512 INFO L263 TraceCheckUtils]: 2: Hoare triple {185#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {170#true} is VALID [2020-07-17 22:21:26,513 INFO L280 TraceCheckUtils]: 3: Hoare triple {170#true} ~x := #in~x; {191#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:26,514 INFO L280 TraceCheckUtils]: 4: Hoare triple {191#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:26,515 INFO L280 TraceCheckUtils]: 5: Hoare triple {192#(= 0 |id2_#in~x|)} assume true; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:26,529 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {192#(= 0 |id2_#in~x|)} {185#(= |id_#in~x| id_~x)} #42#return; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,533 INFO L280 TraceCheckUtils]: 7: Hoare triple {190#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,534 INFO L280 TraceCheckUtils]: 8: Hoare triple {190#(<= |id_#in~x| 1)} assume true; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,536 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {190#(<= |id_#in~x| 1)} {174#(<= 5 main_~input~0)} #40#return; {171#false} is VALID [2020-07-17 22:21:26,538 INFO L263 TraceCheckUtils]: 0: Hoare triple {170#true} call ULTIMATE.init(); {170#true} is VALID [2020-07-17 22:21:26,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {170#true} assume true; {170#true} is VALID [2020-07-17 22:21:26,538 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {170#true} {170#true} #36#return; {170#true} is VALID [2020-07-17 22:21:26,539 INFO L263 TraceCheckUtils]: 3: Hoare triple {170#true} call #t~ret3 := main(); {170#true} is VALID [2020-07-17 22:21:26,540 INFO L280 TraceCheckUtils]: 4: Hoare triple {170#true} ~input~0 := 5; {174#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:26,541 INFO L263 TraceCheckUtils]: 5: Hoare triple {174#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {170#true} is VALID [2020-07-17 22:21:26,542 INFO L280 TraceCheckUtils]: 6: Hoare triple {170#true} ~x := #in~x; {185#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:26,543 INFO L280 TraceCheckUtils]: 7: Hoare triple {185#(= |id_#in~x| id_~x)} assume !(0 == ~x); {185#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:26,544 INFO L263 TraceCheckUtils]: 8: Hoare triple {185#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {170#true} is VALID [2020-07-17 22:21:26,544 INFO L280 TraceCheckUtils]: 9: Hoare triple {170#true} ~x := #in~x; {191#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:26,545 INFO L280 TraceCheckUtils]: 10: Hoare triple {191#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:26,546 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#(= 0 |id2_#in~x|)} assume true; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:26,548 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {192#(= 0 |id2_#in~x|)} {185#(= |id_#in~x| id_~x)} #42#return; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,549 INFO L280 TraceCheckUtils]: 13: Hoare triple {190#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,550 INFO L280 TraceCheckUtils]: 14: Hoare triple {190#(<= |id_#in~x| 1)} assume true; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,551 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {190#(<= |id_#in~x| 1)} {174#(<= 5 main_~input~0)} #40#return; {171#false} is VALID [2020-07-17 22:21:26,552 INFO L280 TraceCheckUtils]: 16: Hoare triple {171#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {171#false} is VALID [2020-07-17 22:21:26,552 INFO L280 TraceCheckUtils]: 17: Hoare triple {171#false} assume 5 != ~result~0; {171#false} is VALID [2020-07-17 22:21:26,552 INFO L280 TraceCheckUtils]: 18: Hoare triple {171#false} assume !false; {171#false} is VALID [2020-07-17 22:21:26,554 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-17 22:21:26,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430206342] [2020-07-17 22:21:26,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:21:26,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:21:26,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314162494] [2020-07-17 22:21:26,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-17 22:21:26,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:26,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:21:26,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:26,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:21:26,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:21:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:21:26,587 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2020-07-17 22:21:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,841 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-17 22:21:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:21:26,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-17 22:21:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:21:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-17 22:21:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:21:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-17 22:21:26,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2020-07-17 22:21:26,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:26,898 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:21:26,899 INFO L226 Difference]: Without dead ends: 29 [2020-07-17 22:21:26,900 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:21:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-17 22:21:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-07-17 22:21:26,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:26,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2020-07-17 22:21:26,912 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2020-07-17 22:21:26,912 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2020-07-17 22:21:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,916 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:21:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:21:26,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:26,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:26,917 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2020-07-17 22:21:26,918 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2020-07-17 22:21:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,921 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:21:26,921 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:21:26,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:26,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:26,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:26,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:21:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-17 22:21:26,926 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2020-07-17 22:21:26,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:26,926 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-17 22:21:26,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:21:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-17 22:21:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:21:26,928 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:26,928 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] [2020-07-17 22:21:26,928 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:21:26,928 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:26,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:26,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1029702107, now seen corresponding path program 1 times [2020-07-17 22:21:26,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:26,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907757107] [2020-07-17 22:21:26,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,986 INFO L280 TraceCheckUtils]: 0: Hoare triple {335#true} assume true; {335#true} is VALID [2020-07-17 22:21:26,987 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {335#true} {335#true} #36#return; {335#true} is VALID [2020-07-17 22:21:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,179 INFO L280 TraceCheckUtils]: 0: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {356#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,181 INFO L280 TraceCheckUtils]: 2: Hoare triple {374#(= 0 |id_#in~x|)} assume true; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,183 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {374#(= 0 |id_#in~x|)} {368#(= id2_~x |id2_#in~x|)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,184 INFO L280 TraceCheckUtils]: 0: Hoare triple {335#true} ~x := #in~x; {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:27,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {368#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:27,185 INFO L263 TraceCheckUtils]: 2: Hoare triple {368#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,189 INFO L280 TraceCheckUtils]: 3: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,190 INFO L280 TraceCheckUtils]: 4: Hoare triple {356#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,191 INFO L280 TraceCheckUtils]: 5: Hoare triple {374#(= 0 |id_#in~x|)} assume true; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,193 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {374#(= 0 |id_#in~x|)} {368#(= id2_~x |id2_#in~x|)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,194 INFO L280 TraceCheckUtils]: 7: Hoare triple {373#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,195 INFO L280 TraceCheckUtils]: 8: Hoare triple {373#(<= |id2_#in~x| 1)} assume true; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,197 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {373#(<= |id2_#in~x| 1)} {356#(= |id_#in~x| id_~x)} #42#return; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {356#(= |id_#in~x| id_~x)} assume !(0 == ~x); {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,201 INFO L263 TraceCheckUtils]: 2: Hoare triple {356#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,203 INFO L280 TraceCheckUtils]: 3: Hoare triple {335#true} ~x := #in~x; {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:27,204 INFO L280 TraceCheckUtils]: 4: Hoare triple {368#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:27,204 INFO L263 TraceCheckUtils]: 5: Hoare triple {368#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,205 INFO L280 TraceCheckUtils]: 6: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,206 INFO L280 TraceCheckUtils]: 7: Hoare triple {356#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,207 INFO L280 TraceCheckUtils]: 8: Hoare triple {374#(= 0 |id_#in~x|)} assume true; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,211 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {374#(= 0 |id_#in~x|)} {368#(= id2_~x |id2_#in~x|)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,212 INFO L280 TraceCheckUtils]: 10: Hoare triple {373#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,213 INFO L280 TraceCheckUtils]: 11: Hoare triple {373#(<= |id2_#in~x| 1)} assume true; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,214 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {373#(<= |id2_#in~x| 1)} {356#(= |id_#in~x| id_~x)} #42#return; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,222 INFO L280 TraceCheckUtils]: 13: Hoare triple {367#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,223 INFO L280 TraceCheckUtils]: 14: Hoare triple {367#(<= |id_#in~x| 2)} assume true; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,225 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {367#(<= |id_#in~x| 2)} {339#(<= 5 main_~input~0)} #40#return; {336#false} is VALID [2020-07-17 22:21:27,226 INFO L263 TraceCheckUtils]: 0: Hoare triple {335#true} call ULTIMATE.init(); {335#true} is VALID [2020-07-17 22:21:27,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {335#true} assume true; {335#true} is VALID [2020-07-17 22:21:27,227 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {335#true} {335#true} #36#return; {335#true} is VALID [2020-07-17 22:21:27,227 INFO L263 TraceCheckUtils]: 3: Hoare triple {335#true} call #t~ret3 := main(); {335#true} is VALID [2020-07-17 22:21:27,228 INFO L280 TraceCheckUtils]: 4: Hoare triple {335#true} ~input~0 := 5; {339#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:27,229 INFO L263 TraceCheckUtils]: 5: Hoare triple {339#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {335#true} is VALID [2020-07-17 22:21:27,230 INFO L280 TraceCheckUtils]: 6: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,231 INFO L280 TraceCheckUtils]: 7: Hoare triple {356#(= |id_#in~x| id_~x)} assume !(0 == ~x); {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,232 INFO L263 TraceCheckUtils]: 8: Hoare triple {356#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,233 INFO L280 TraceCheckUtils]: 9: Hoare triple {335#true} ~x := #in~x; {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:27,234 INFO L280 TraceCheckUtils]: 10: Hoare triple {368#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:27,234 INFO L263 TraceCheckUtils]: 11: Hoare triple {368#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,235 INFO L280 TraceCheckUtils]: 12: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,236 INFO L280 TraceCheckUtils]: 13: Hoare triple {356#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,238 INFO L280 TraceCheckUtils]: 14: Hoare triple {374#(= 0 |id_#in~x|)} assume true; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,240 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {374#(= 0 |id_#in~x|)} {368#(= id2_~x |id2_#in~x|)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,246 INFO L280 TraceCheckUtils]: 16: Hoare triple {373#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,247 INFO L280 TraceCheckUtils]: 17: Hoare triple {373#(<= |id2_#in~x| 1)} assume true; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,248 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {373#(<= |id2_#in~x| 1)} {356#(= |id_#in~x| id_~x)} #42#return; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,250 INFO L280 TraceCheckUtils]: 19: Hoare triple {367#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,251 INFO L280 TraceCheckUtils]: 20: Hoare triple {367#(<= |id_#in~x| 2)} assume true; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,253 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {367#(<= |id_#in~x| 2)} {339#(<= 5 main_~input~0)} #40#return; {336#false} is VALID [2020-07-17 22:21:27,253 INFO L280 TraceCheckUtils]: 22: Hoare triple {336#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {336#false} is VALID [2020-07-17 22:21:27,253 INFO L280 TraceCheckUtils]: 23: Hoare triple {336#false} assume 5 != ~result~0; {336#false} is VALID [2020-07-17 22:21:27,254 INFO L280 TraceCheckUtils]: 24: Hoare triple {336#false} assume !false; {336#false} is VALID [2020-07-17 22:21:27,256 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-17 22:21:27,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907757107] [2020-07-17 22:21:27,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354142976] [2020-07-17 22:21:27,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:21:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:27,526 INFO L263 TraceCheckUtils]: 0: Hoare triple {335#true} call ULTIMATE.init(); {335#true} is VALID [2020-07-17 22:21:27,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {335#true} assume true; {335#true} is VALID [2020-07-17 22:21:27,527 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {335#true} {335#true} #36#return; {335#true} is VALID [2020-07-17 22:21:27,527 INFO L263 TraceCheckUtils]: 3: Hoare triple {335#true} call #t~ret3 := main(); {335#true} is VALID [2020-07-17 22:21:27,528 INFO L280 TraceCheckUtils]: 4: Hoare triple {335#true} ~input~0 := 5; {339#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:27,529 INFO L263 TraceCheckUtils]: 5: Hoare triple {339#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {335#true} is VALID [2020-07-17 22:21:27,530 INFO L280 TraceCheckUtils]: 6: Hoare triple {335#true} ~x := #in~x; {396#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,531 INFO L280 TraceCheckUtils]: 7: Hoare triple {396#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {396#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,531 INFO L263 TraceCheckUtils]: 8: Hoare triple {396#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,532 INFO L280 TraceCheckUtils]: 9: Hoare triple {335#true} ~x := #in~x; {406#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:27,533 INFO L280 TraceCheckUtils]: 10: Hoare triple {406#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {406#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:27,533 INFO L263 TraceCheckUtils]: 11: Hoare triple {406#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,534 INFO L280 TraceCheckUtils]: 12: Hoare triple {335#true} ~x := #in~x; {396#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,535 INFO L280 TraceCheckUtils]: 13: Hoare triple {396#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {419#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:21:27,536 INFO L280 TraceCheckUtils]: 14: Hoare triple {419#(<= |id_#in~x| 0)} assume true; {419#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:21:27,537 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {419#(<= |id_#in~x| 0)} {406#(<= |id2_#in~x| id2_~x)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,538 INFO L280 TraceCheckUtils]: 16: Hoare triple {373#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,539 INFO L280 TraceCheckUtils]: 17: Hoare triple {373#(<= |id2_#in~x| 1)} assume true; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,541 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {373#(<= |id2_#in~x| 1)} {396#(<= |id_#in~x| id_~x)} #42#return; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,542 INFO L280 TraceCheckUtils]: 19: Hoare triple {367#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,543 INFO L280 TraceCheckUtils]: 20: Hoare triple {367#(<= |id_#in~x| 2)} assume true; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,544 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {367#(<= |id_#in~x| 2)} {339#(<= 5 main_~input~0)} #40#return; {336#false} is VALID [2020-07-17 22:21:27,544 INFO L280 TraceCheckUtils]: 22: Hoare triple {336#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {336#false} is VALID [2020-07-17 22:21:27,545 INFO L280 TraceCheckUtils]: 23: Hoare triple {336#false} assume 5 != ~result~0; {336#false} is VALID [2020-07-17 22:21:27,545 INFO L280 TraceCheckUtils]: 24: Hoare triple {336#false} assume !false; {336#false} is VALID [2020-07-17 22:21:27,547 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-17 22:21:27,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:27,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-07-17 22:21:27,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62365787] [2020-07-17 22:21:27,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-07-17 22:21:27,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:27,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:21:27,597 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-17 22:21:27,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:21:27,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:27,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:21:27,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:21:27,599 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 11 states. [2020-07-17 22:21:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:27,971 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-17 22:21:27,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:21:27,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-07-17 22:21:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:21:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2020-07-17 22:21:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:21:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2020-07-17 22:21:27,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2020-07-17 22:21:28,039 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-17 22:21:28,041 INFO L225 Difference]: With dead ends: 39 [2020-07-17 22:21:28,042 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:21:28,042 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:21:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:21:28,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2020-07-17 22:21:28,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:28,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2020-07-17 22:21:28,055 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2020-07-17 22:21:28,055 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2020-07-17 22:21:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:28,058 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-17 22:21:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-17 22:21:28,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:28,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:28,059 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2020-07-17 22:21:28,060 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2020-07-17 22:21:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:28,063 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-17 22:21:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-17 22:21:28,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:28,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:28,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:28,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:21:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-17 22:21:28,067 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2020-07-17 22:21:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:28,067 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-17 22:21:28,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:21:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-17 22:21:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:21:28,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:28,069 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:28,283 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:21:28,284 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:28,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:28,285 INFO L82 PathProgramCache]: Analyzing trace with hash -559715991, now seen corresponding path program 1 times [2020-07-17 22:21:28,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:28,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722387256] [2020-07-17 22:21:28,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,323 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-17 22:21:28,323 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {615#true} {615#true} #36#return; {615#true} is VALID [2020-07-17 22:21:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,454 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,456 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,457 INFO L263 TraceCheckUtils]: 2: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,458 INFO L280 TraceCheckUtils]: 3: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,459 INFO L280 TraceCheckUtils]: 4: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,459 INFO L280 TraceCheckUtils]: 5: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,463 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,464 INFO L280 TraceCheckUtils]: 7: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,465 INFO L280 TraceCheckUtils]: 8: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,466 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {676#(<= |id_#in~x| 1)} {660#(= id2_~x |id2_#in~x|)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,471 INFO L263 TraceCheckUtils]: 2: Hoare triple {660#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,473 INFO L280 TraceCheckUtils]: 3: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,475 INFO L263 TraceCheckUtils]: 5: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,476 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,478 INFO L280 TraceCheckUtils]: 7: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,479 INFO L280 TraceCheckUtils]: 8: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,480 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,481 INFO L280 TraceCheckUtils]: 10: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,482 INFO L280 TraceCheckUtils]: 11: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,483 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {676#(<= |id_#in~x| 1)} {660#(= id2_~x |id2_#in~x|)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,484 INFO L280 TraceCheckUtils]: 13: Hoare triple {671#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,484 INFO L280 TraceCheckUtils]: 14: Hoare triple {671#(<= |id2_#in~x| 2)} assume true; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,485 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {671#(<= |id2_#in~x| 2)} {642#(= |id_#in~x| id_~x)} #42#return; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,488 INFO L263 TraceCheckUtils]: 2: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,488 INFO L280 TraceCheckUtils]: 3: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,489 INFO L263 TraceCheckUtils]: 5: Hoare triple {660#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,489 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,490 INFO L280 TraceCheckUtils]: 7: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,490 INFO L263 TraceCheckUtils]: 8: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,491 INFO L280 TraceCheckUtils]: 9: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,492 INFO L280 TraceCheckUtils]: 10: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,492 INFO L280 TraceCheckUtils]: 11: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,493 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,494 INFO L280 TraceCheckUtils]: 13: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,496 INFO L280 TraceCheckUtils]: 14: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,498 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {676#(<= |id_#in~x| 1)} {660#(= id2_~x |id2_#in~x|)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,500 INFO L280 TraceCheckUtils]: 16: Hoare triple {671#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,501 INFO L280 TraceCheckUtils]: 17: Hoare triple {671#(<= |id2_#in~x| 2)} assume true; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,504 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {671#(<= |id2_#in~x| 2)} {642#(= |id_#in~x| id_~x)} #42#return; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,505 INFO L280 TraceCheckUtils]: 19: Hoare triple {659#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,506 INFO L280 TraceCheckUtils]: 20: Hoare triple {659#(<= |id_#in~x| 3)} assume true; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,507 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {659#(<= |id_#in~x| 3)} {619#(<= 5 main_~input~0)} #40#return; {616#false} is VALID [2020-07-17 22:21:28,509 INFO L263 TraceCheckUtils]: 0: Hoare triple {615#true} call ULTIMATE.init(); {615#true} is VALID [2020-07-17 22:21:28,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-17 22:21:28,509 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {615#true} {615#true} #36#return; {615#true} is VALID [2020-07-17 22:21:28,509 INFO L263 TraceCheckUtils]: 3: Hoare triple {615#true} call #t~ret3 := main(); {615#true} is VALID [2020-07-17 22:21:28,517 INFO L280 TraceCheckUtils]: 4: Hoare triple {615#true} ~input~0 := 5; {619#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:28,517 INFO L263 TraceCheckUtils]: 5: Hoare triple {619#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {615#true} is VALID [2020-07-17 22:21:28,517 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,518 INFO L280 TraceCheckUtils]: 7: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,518 INFO L263 TraceCheckUtils]: 8: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,520 INFO L280 TraceCheckUtils]: 10: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,520 INFO L263 TraceCheckUtils]: 11: Hoare triple {660#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,520 INFO L280 TraceCheckUtils]: 12: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,521 INFO L280 TraceCheckUtils]: 13: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,521 INFO L263 TraceCheckUtils]: 14: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,521 INFO L280 TraceCheckUtils]: 15: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,524 INFO L280 TraceCheckUtils]: 16: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,525 INFO L280 TraceCheckUtils]: 17: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,528 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,529 INFO L280 TraceCheckUtils]: 19: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,529 INFO L280 TraceCheckUtils]: 20: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,533 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {676#(<= |id_#in~x| 1)} {660#(= id2_~x |id2_#in~x|)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,534 INFO L280 TraceCheckUtils]: 22: Hoare triple {671#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,534 INFO L280 TraceCheckUtils]: 23: Hoare triple {671#(<= |id2_#in~x| 2)} assume true; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,536 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {671#(<= |id2_#in~x| 2)} {642#(= |id_#in~x| id_~x)} #42#return; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,536 INFO L280 TraceCheckUtils]: 25: Hoare triple {659#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,537 INFO L280 TraceCheckUtils]: 26: Hoare triple {659#(<= |id_#in~x| 3)} assume true; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,537 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {659#(<= |id_#in~x| 3)} {619#(<= 5 main_~input~0)} #40#return; {616#false} is VALID [2020-07-17 22:21:28,538 INFO L280 TraceCheckUtils]: 28: Hoare triple {616#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {616#false} is VALID [2020-07-17 22:21:28,538 INFO L280 TraceCheckUtils]: 29: Hoare triple {616#false} assume 5 != ~result~0; {616#false} is VALID [2020-07-17 22:21:28,538 INFO L280 TraceCheckUtils]: 30: Hoare triple {616#false} assume !false; {616#false} is VALID [2020-07-17 22:21:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:21:28,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722387256] [2020-07-17 22:21:28,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508515097] [2020-07-17 22:21:28,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,572 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-17 22:21:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,585 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:28,751 INFO L263 TraceCheckUtils]: 0: Hoare triple {615#true} call ULTIMATE.init(); {615#true} is VALID [2020-07-17 22:21:28,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-17 22:21:28,751 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {615#true} {615#true} #36#return; {615#true} is VALID [2020-07-17 22:21:28,751 INFO L263 TraceCheckUtils]: 3: Hoare triple {615#true} call #t~ret3 := main(); {615#true} is VALID [2020-07-17 22:21:28,752 INFO L280 TraceCheckUtils]: 4: Hoare triple {615#true} ~input~0 := 5; {619#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:28,753 INFO L263 TraceCheckUtils]: 5: Hoare triple {619#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {615#true} is VALID [2020-07-17 22:21:28,753 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#true} ~x := #in~x; {699#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,754 INFO L280 TraceCheckUtils]: 7: Hoare triple {699#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {699#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,754 INFO L263 TraceCheckUtils]: 8: Hoare triple {699#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,755 INFO L280 TraceCheckUtils]: 9: Hoare triple {615#true} ~x := #in~x; {709#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:28,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {709#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {709#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:28,756 INFO L263 TraceCheckUtils]: 11: Hoare triple {709#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,757 INFO L280 TraceCheckUtils]: 12: Hoare triple {615#true} ~x := #in~x; {699#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,757 INFO L280 TraceCheckUtils]: 13: Hoare triple {699#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {699#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,758 INFO L263 TraceCheckUtils]: 14: Hoare triple {699#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,758 INFO L280 TraceCheckUtils]: 15: Hoare triple {615#true} ~x := #in~x; {709#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:28,759 INFO L280 TraceCheckUtils]: 16: Hoare triple {709#(<= |id2_#in~x| id2_~x)} assume 0 == ~x;#res := 0; {731#(<= |id2_#in~x| 0)} is VALID [2020-07-17 22:21:28,760 INFO L280 TraceCheckUtils]: 17: Hoare triple {731#(<= |id2_#in~x| 0)} assume true; {731#(<= |id2_#in~x| 0)} is VALID [2020-07-17 22:21:28,761 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {731#(<= |id2_#in~x| 0)} {699#(<= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,762 INFO L280 TraceCheckUtils]: 19: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,762 INFO L280 TraceCheckUtils]: 20: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,764 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {676#(<= |id_#in~x| 1)} {709#(<= |id2_#in~x| id2_~x)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,765 INFO L280 TraceCheckUtils]: 22: Hoare triple {671#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,765 INFO L280 TraceCheckUtils]: 23: Hoare triple {671#(<= |id2_#in~x| 2)} assume true; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,767 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {671#(<= |id2_#in~x| 2)} {699#(<= |id_#in~x| id_~x)} #42#return; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,767 INFO L280 TraceCheckUtils]: 25: Hoare triple {659#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,768 INFO L280 TraceCheckUtils]: 26: Hoare triple {659#(<= |id_#in~x| 3)} assume true; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,769 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {659#(<= |id_#in~x| 3)} {619#(<= 5 main_~input~0)} #40#return; {616#false} is VALID [2020-07-17 22:21:28,770 INFO L280 TraceCheckUtils]: 28: Hoare triple {616#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {616#false} is VALID [2020-07-17 22:21:28,770 INFO L280 TraceCheckUtils]: 29: Hoare triple {616#false} assume 5 != ~result~0; {616#false} is VALID [2020-07-17 22:21:28,770 INFO L280 TraceCheckUtils]: 30: Hoare triple {616#false} assume !false; {616#false} is VALID [2020-07-17 22:21:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:21:28,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:28,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-17 22:21:28,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875845898] [2020-07-17 22:21:28,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-17 22:21:28,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:28,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-17 22:21:28,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:28,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 22:21:28,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:28,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 22:21:28,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:21:28,845 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 12 states. [2020-07-17 22:21:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:29,268 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-17 22:21:29,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:21:29,268 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-17 22:21:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:21:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-17 22:21:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:21:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-17 22:21:29,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 39 transitions. [2020-07-17 22:21:29,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:29,343 INFO L225 Difference]: With dead ends: 45 [2020-07-17 22:21:29,343 INFO L226 Difference]: Without dead ends: 41 [2020-07-17 22:21:29,344 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:21:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-17 22:21:29,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2020-07-17 22:21:29,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:29,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 33 states. [2020-07-17 22:21:29,355 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 33 states. [2020-07-17 22:21:29,355 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 33 states. [2020-07-17 22:21:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:29,359 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-17 22:21:29,359 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-17 22:21:29,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:29,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:29,361 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 41 states. [2020-07-17 22:21:29,361 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 41 states. [2020-07-17 22:21:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:29,364 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-17 22:21:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-17 22:21:29,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:29,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:29,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:29,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:21:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-07-17 22:21:29,368 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2020-07-17 22:21:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:29,368 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-07-17 22:21:29,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 22:21:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-17 22:21:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:21:29,370 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:29,370 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:29,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:29,584 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:29,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:29,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2003326827, now seen corresponding path program 2 times [2020-07-17 22:21:29,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:29,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343271894] [2020-07-17 22:21:29,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-17 22:21:29,631 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {959#true} {959#true} #36#return; {959#true} is VALID [2020-07-17 22:21:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,867 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,871 INFO L280 TraceCheckUtils]: 2: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,873 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,874 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,874 INFO L280 TraceCheckUtils]: 1: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,874 INFO L263 TraceCheckUtils]: 2: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,875 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,875 INFO L280 TraceCheckUtils]: 4: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,876 INFO L280 TraceCheckUtils]: 5: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,877 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,877 INFO L280 TraceCheckUtils]: 7: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,878 INFO L280 TraceCheckUtils]: 8: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,879 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,881 INFO L280 TraceCheckUtils]: 1: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,882 INFO L263 TraceCheckUtils]: 2: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,882 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,883 INFO L280 TraceCheckUtils]: 4: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,883 INFO L263 TraceCheckUtils]: 5: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,883 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,890 INFO L280 TraceCheckUtils]: 7: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,892 INFO L280 TraceCheckUtils]: 8: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,893 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,894 INFO L280 TraceCheckUtils]: 10: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,894 INFO L280 TraceCheckUtils]: 11: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,896 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,896 INFO L280 TraceCheckUtils]: 13: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,897 INFO L280 TraceCheckUtils]: 14: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,899 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,901 INFO L263 TraceCheckUtils]: 2: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,902 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,903 INFO L280 TraceCheckUtils]: 4: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,903 INFO L263 TraceCheckUtils]: 5: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,903 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,904 INFO L280 TraceCheckUtils]: 7: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,904 INFO L263 TraceCheckUtils]: 8: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,905 INFO L280 TraceCheckUtils]: 9: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,906 INFO L280 TraceCheckUtils]: 10: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,906 INFO L280 TraceCheckUtils]: 11: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,908 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,908 INFO L280 TraceCheckUtils]: 13: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,909 INFO L280 TraceCheckUtils]: 14: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,910 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,911 INFO L280 TraceCheckUtils]: 16: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,912 INFO L280 TraceCheckUtils]: 17: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,913 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,914 INFO L280 TraceCheckUtils]: 19: Hoare triple {1033#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,914 INFO L280 TraceCheckUtils]: 20: Hoare triple {1033#(<= |id2_#in~x| 3)} assume true; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,916 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1033#(<= |id2_#in~x| 3)} {992#(= |id_#in~x| id_~x)} #42#return; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,918 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,919 INFO L263 TraceCheckUtils]: 2: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,920 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,921 INFO L280 TraceCheckUtils]: 4: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,922 INFO L263 TraceCheckUtils]: 5: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,922 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,923 INFO L280 TraceCheckUtils]: 7: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,923 INFO L263 TraceCheckUtils]: 8: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,924 INFO L280 TraceCheckUtils]: 9: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,924 INFO L280 TraceCheckUtils]: 10: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,925 INFO L263 TraceCheckUtils]: 11: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,925 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,933 INFO L280 TraceCheckUtils]: 13: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,934 INFO L280 TraceCheckUtils]: 14: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,935 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,936 INFO L280 TraceCheckUtils]: 16: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,937 INFO L280 TraceCheckUtils]: 17: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,938 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,939 INFO L280 TraceCheckUtils]: 19: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,944 INFO L280 TraceCheckUtils]: 20: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,946 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,946 INFO L280 TraceCheckUtils]: 22: Hoare triple {1033#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,947 INFO L280 TraceCheckUtils]: 23: Hoare triple {1033#(<= |id2_#in~x| 3)} assume true; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,948 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1033#(<= |id2_#in~x| 3)} {992#(= |id_#in~x| id_~x)} #42#return; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,948 INFO L280 TraceCheckUtils]: 25: Hoare triple {1015#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,949 INFO L280 TraceCheckUtils]: 26: Hoare triple {1015#(<= |id_#in~x| 4)} assume true; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,950 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1015#(<= |id_#in~x| 4)} {963#(<= 5 main_~input~0)} #40#return; {960#false} is VALID [2020-07-17 22:21:29,951 INFO L263 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2020-07-17 22:21:29,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-17 22:21:29,952 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #36#return; {959#true} is VALID [2020-07-17 22:21:29,952 INFO L263 TraceCheckUtils]: 3: Hoare triple {959#true} call #t~ret3 := main(); {959#true} is VALID [2020-07-17 22:21:29,953 INFO L280 TraceCheckUtils]: 4: Hoare triple {959#true} ~input~0 := 5; {963#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:29,953 INFO L263 TraceCheckUtils]: 5: Hoare triple {963#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {959#true} is VALID [2020-07-17 22:21:29,960 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,961 INFO L280 TraceCheckUtils]: 7: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,962 INFO L263 TraceCheckUtils]: 8: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,962 INFO L280 TraceCheckUtils]: 9: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,963 INFO L280 TraceCheckUtils]: 10: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,963 INFO L263 TraceCheckUtils]: 11: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,964 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,964 INFO L280 TraceCheckUtils]: 13: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,964 INFO L263 TraceCheckUtils]: 14: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,965 INFO L280 TraceCheckUtils]: 15: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,966 INFO L280 TraceCheckUtils]: 16: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,966 INFO L263 TraceCheckUtils]: 17: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,966 INFO L280 TraceCheckUtils]: 18: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,967 INFO L280 TraceCheckUtils]: 19: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,968 INFO L280 TraceCheckUtils]: 20: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,969 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,969 INFO L280 TraceCheckUtils]: 22: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,970 INFO L280 TraceCheckUtils]: 23: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,971 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,972 INFO L280 TraceCheckUtils]: 25: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,973 INFO L280 TraceCheckUtils]: 26: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,974 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,975 INFO L280 TraceCheckUtils]: 28: Hoare triple {1033#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,975 INFO L280 TraceCheckUtils]: 29: Hoare triple {1033#(<= |id2_#in~x| 3)} assume true; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,977 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1033#(<= |id2_#in~x| 3)} {992#(= |id_#in~x| id_~x)} #42#return; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,978 INFO L280 TraceCheckUtils]: 31: Hoare triple {1015#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,978 INFO L280 TraceCheckUtils]: 32: Hoare triple {1015#(<= |id_#in~x| 4)} assume true; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,979 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1015#(<= |id_#in~x| 4)} {963#(<= 5 main_~input~0)} #40#return; {960#false} is VALID [2020-07-17 22:21:29,979 INFO L280 TraceCheckUtils]: 34: Hoare triple {960#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {960#false} is VALID [2020-07-17 22:21:29,980 INFO L280 TraceCheckUtils]: 35: Hoare triple {960#false} assume 5 != ~result~0; {960#false} is VALID [2020-07-17 22:21:29,980 INFO L280 TraceCheckUtils]: 36: Hoare triple {960#false} assume !false; {960#false} is VALID [2020-07-17 22:21:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-17 22:21:29,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343271894] [2020-07-17 22:21:29,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209312009] [2020-07-17 22:21:29,984 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:30,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:21:30,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:21:30,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-17 22:21:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:30,060 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:30,233 INFO L263 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2020-07-17 22:21:30,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-17 22:21:30,234 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #36#return; {959#true} is VALID [2020-07-17 22:21:30,234 INFO L263 TraceCheckUtils]: 3: Hoare triple {959#true} call #t~ret3 := main(); {959#true} is VALID [2020-07-17 22:21:30,235 INFO L280 TraceCheckUtils]: 4: Hoare triple {959#true} ~input~0 := 5; {963#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:30,235 INFO L263 TraceCheckUtils]: 5: Hoare triple {963#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {959#true} is VALID [2020-07-17 22:21:30,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:30,236 INFO L280 TraceCheckUtils]: 7: Hoare triple {1072#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:30,236 INFO L263 TraceCheckUtils]: 8: Hoare triple {1072#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:30,237 INFO L280 TraceCheckUtils]: 9: Hoare triple {959#true} ~x := #in~x; {1082#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:30,238 INFO L280 TraceCheckUtils]: 10: Hoare triple {1082#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {1082#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:30,238 INFO L263 TraceCheckUtils]: 11: Hoare triple {1082#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:30,241 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#true} ~x := #in~x; {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:30,244 INFO L280 TraceCheckUtils]: 13: Hoare triple {1072#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:30,244 INFO L263 TraceCheckUtils]: 14: Hoare triple {1072#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:30,245 INFO L280 TraceCheckUtils]: 15: Hoare triple {959#true} ~x := #in~x; {1082#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:30,246 INFO L280 TraceCheckUtils]: 16: Hoare triple {1082#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {1082#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:30,246 INFO L263 TraceCheckUtils]: 17: Hoare triple {1082#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:30,247 INFO L280 TraceCheckUtils]: 18: Hoare triple {959#true} ~x := #in~x; {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:30,248 INFO L280 TraceCheckUtils]: 19: Hoare triple {1072#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1113#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:21:30,248 INFO L280 TraceCheckUtils]: 20: Hoare triple {1113#(<= |id_#in~x| 0)} assume true; {1113#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:21:30,249 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1113#(<= |id_#in~x| 0)} {1082#(<= |id2_#in~x| id2_~x)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:30,250 INFO L280 TraceCheckUtils]: 22: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:30,251 INFO L280 TraceCheckUtils]: 23: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:30,252 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {1072#(<= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:30,253 INFO L280 TraceCheckUtils]: 25: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:30,253 INFO L280 TraceCheckUtils]: 26: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:30,254 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1082#(<= |id2_#in~x| id2_~x)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:30,254 INFO L280 TraceCheckUtils]: 28: Hoare triple {1033#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:30,255 INFO L280 TraceCheckUtils]: 29: Hoare triple {1033#(<= |id2_#in~x| 3)} assume true; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:30,256 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1033#(<= |id2_#in~x| 3)} {1072#(<= |id_#in~x| id_~x)} #42#return; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:30,257 INFO L280 TraceCheckUtils]: 31: Hoare triple {1015#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:30,257 INFO L280 TraceCheckUtils]: 32: Hoare triple {1015#(<= |id_#in~x| 4)} assume true; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:30,258 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1015#(<= |id_#in~x| 4)} {963#(<= 5 main_~input~0)} #40#return; {960#false} is VALID [2020-07-17 22:21:30,258 INFO L280 TraceCheckUtils]: 34: Hoare triple {960#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {960#false} is VALID [2020-07-17 22:21:30,258 INFO L280 TraceCheckUtils]: 35: Hoare triple {960#false} assume 5 != ~result~0; {960#false} is VALID [2020-07-17 22:21:30,258 INFO L280 TraceCheckUtils]: 36: Hoare triple {960#false} assume !false; {960#false} is VALID [2020-07-17 22:21:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-17 22:21:30,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:30,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2020-07-17 22:21:30,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218327356] [2020-07-17 22:21:30,262 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-07-17 22:21:30,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:30,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:21:30,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:30,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:21:30,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:30,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:21:30,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:21:30,323 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 13 states. [2020-07-17 22:21:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:30,685 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-07-17 22:21:30,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:21:30,686 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-07-17 22:21:30,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:21:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-17 22:21:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:21:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-17 22:21:30,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-17 22:21:30,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:30,767 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:21:30,768 INFO L226 Difference]: Without dead ends: 47 [2020-07-17 22:21:30,768 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2020-07-17 22:21:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-17 22:21:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2020-07-17 22:21:30,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:30,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 36 states. [2020-07-17 22:21:30,785 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 36 states. [2020-07-17 22:21:30,785 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 36 states. [2020-07-17 22:21:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:30,789 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2020-07-17 22:21:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-07-17 22:21:30,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:30,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:30,792 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 47 states. [2020-07-17 22:21:30,792 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 47 states. [2020-07-17 22:21:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:30,800 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2020-07-17 22:21:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-07-17 22:21:30,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:30,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:30,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:30,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:21:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-17 22:21:30,804 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 37 [2020-07-17 22:21:30,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:30,805 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-17 22:21:30,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:21:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-17 22:21:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-17 22:21:30,806 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:30,806 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:31,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:31,014 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1197899385, now seen corresponding path program 2 times [2020-07-17 22:21:31,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:31,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225111357] [2020-07-17 22:21:31,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} assume true; {1373#true} is VALID [2020-07-17 22:21:31,114 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1373#true} {1373#true} #36#return; {1373#true} is VALID [2020-07-17 22:21:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,506 INFO L280 TraceCheckUtils]: 2: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,507 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:31,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,508 INFO L263 TraceCheckUtils]: 2: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,509 INFO L280 TraceCheckUtils]: 3: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,510 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,510 INFO L280 TraceCheckUtils]: 5: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,512 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:31,513 INFO L280 TraceCheckUtils]: 7: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,513 INFO L280 TraceCheckUtils]: 8: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,514 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-17 22:21:31,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,516 INFO L263 TraceCheckUtils]: 2: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,516 INFO L280 TraceCheckUtils]: 3: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,516 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,516 INFO L263 TraceCheckUtils]: 5: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,517 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,518 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,518 INFO L280 TraceCheckUtils]: 8: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,520 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:31,521 INFO L280 TraceCheckUtils]: 10: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,522 INFO L280 TraceCheckUtils]: 11: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,523 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-17 22:21:31,524 INFO L280 TraceCheckUtils]: 13: Hoare triple {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-17 22:21:31,525 INFO L280 TraceCheckUtils]: 14: Hoare triple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-17 22:21:31,526 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1373#true} #42#return; {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-17 22:21:31,527 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,527 INFO L263 TraceCheckUtils]: 2: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,528 INFO L280 TraceCheckUtils]: 3: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,528 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,528 INFO L263 TraceCheckUtils]: 5: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,528 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,529 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,529 INFO L263 TraceCheckUtils]: 8: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,529 INFO L280 TraceCheckUtils]: 9: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,530 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,531 INFO L280 TraceCheckUtils]: 11: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,532 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:31,533 INFO L280 TraceCheckUtils]: 13: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,534 INFO L280 TraceCheckUtils]: 14: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,535 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-17 22:21:31,536 INFO L280 TraceCheckUtils]: 16: Hoare triple {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-17 22:21:31,537 INFO L280 TraceCheckUtils]: 17: Hoare triple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-17 22:21:31,538 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1373#true} #42#return; {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-17 22:21:31,539 INFO L280 TraceCheckUtils]: 19: Hoare triple {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:21:31,540 INFO L280 TraceCheckUtils]: 20: Hoare triple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:21:31,541 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1373#true} #34#return; {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-17 22:21:31,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,542 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,542 INFO L263 TraceCheckUtils]: 2: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,542 INFO L280 TraceCheckUtils]: 3: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,543 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,543 INFO L263 TraceCheckUtils]: 5: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,543 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,543 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,544 INFO L263 TraceCheckUtils]: 8: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,544 INFO L280 TraceCheckUtils]: 9: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,544 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,544 INFO L263 TraceCheckUtils]: 11: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,544 INFO L280 TraceCheckUtils]: 12: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,545 INFO L280 TraceCheckUtils]: 13: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,546 INFO L280 TraceCheckUtils]: 14: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,547 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:31,548 INFO L280 TraceCheckUtils]: 16: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,549 INFO L280 TraceCheckUtils]: 17: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,550 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-17 22:21:31,551 INFO L280 TraceCheckUtils]: 19: Hoare triple {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-17 22:21:31,552 INFO L280 TraceCheckUtils]: 20: Hoare triple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-17 22:21:31,553 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1373#true} #42#return; {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-17 22:21:31,554 INFO L280 TraceCheckUtils]: 22: Hoare triple {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:21:31,555 INFO L280 TraceCheckUtils]: 23: Hoare triple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:21:31,556 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1373#true} #34#return; {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-17 22:21:31,557 INFO L280 TraceCheckUtils]: 25: Hoare triple {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-17 22:21:31,558 INFO L280 TraceCheckUtils]: 26: Hoare triple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-17 22:21:31,559 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1373#true} #42#return; {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-17 22:21:31,561 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,561 INFO L263 TraceCheckUtils]: 2: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,561 INFO L280 TraceCheckUtils]: 3: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,562 INFO L263 TraceCheckUtils]: 5: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,562 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,562 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,562 INFO L263 TraceCheckUtils]: 8: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,563 INFO L280 TraceCheckUtils]: 9: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,563 INFO L263 TraceCheckUtils]: 11: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,563 INFO L280 TraceCheckUtils]: 12: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,563 INFO L280 TraceCheckUtils]: 13: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,564 INFO L263 TraceCheckUtils]: 14: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,564 INFO L280 TraceCheckUtils]: 15: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,565 INFO L280 TraceCheckUtils]: 16: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,565 INFO L280 TraceCheckUtils]: 17: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,567 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:31,568 INFO L280 TraceCheckUtils]: 19: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,568 INFO L280 TraceCheckUtils]: 20: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,570 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-17 22:21:31,571 INFO L280 TraceCheckUtils]: 22: Hoare triple {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-17 22:21:31,572 INFO L280 TraceCheckUtils]: 23: Hoare triple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-17 22:21:31,573 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1373#true} #42#return; {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-17 22:21:31,574 INFO L280 TraceCheckUtils]: 25: Hoare triple {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:21:31,575 INFO L280 TraceCheckUtils]: 26: Hoare triple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:21:31,576 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1373#true} #34#return; {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-17 22:21:31,577 INFO L280 TraceCheckUtils]: 28: Hoare triple {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-17 22:21:31,578 INFO L280 TraceCheckUtils]: 29: Hoare triple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-17 22:21:31,579 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1373#true} #42#return; {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-17 22:21:31,580 INFO L280 TraceCheckUtils]: 31: Hoare triple {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-17 22:21:31,581 INFO L280 TraceCheckUtils]: 32: Hoare triple {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-17 22:21:31,582 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1373#true} #40#return; {1411#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} is VALID [2020-07-17 22:21:31,584 INFO L263 TraceCheckUtils]: 0: Hoare triple {1373#true} call ULTIMATE.init(); {1373#true} is VALID [2020-07-17 22:21:31,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume true; {1373#true} is VALID [2020-07-17 22:21:31,584 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1373#true} {1373#true} #36#return; {1373#true} is VALID [2020-07-17 22:21:31,585 INFO L263 TraceCheckUtils]: 3: Hoare triple {1373#true} call #t~ret3 := main(); {1373#true} is VALID [2020-07-17 22:21:31,585 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} ~input~0 := 5; {1373#true} is VALID [2020-07-17 22:21:31,585 INFO L263 TraceCheckUtils]: 5: Hoare triple {1373#true} call #t~ret2 := id(~input~0); {1373#true} is VALID [2020-07-17 22:21:31,585 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,585 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,585 INFO L263 TraceCheckUtils]: 8: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,586 INFO L280 TraceCheckUtils]: 9: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,586 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,586 INFO L263 TraceCheckUtils]: 11: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,586 INFO L280 TraceCheckUtils]: 12: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,586 INFO L280 TraceCheckUtils]: 13: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,587 INFO L263 TraceCheckUtils]: 14: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,587 INFO L280 TraceCheckUtils]: 15: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,587 INFO L280 TraceCheckUtils]: 16: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,587 INFO L263 TraceCheckUtils]: 17: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,587 INFO L280 TraceCheckUtils]: 18: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,588 INFO L280 TraceCheckUtils]: 19: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,588 INFO L263 TraceCheckUtils]: 20: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,588 INFO L280 TraceCheckUtils]: 21: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,589 INFO L280 TraceCheckUtils]: 22: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,590 INFO L280 TraceCheckUtils]: 23: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,591 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:31,592 INFO L280 TraceCheckUtils]: 25: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,592 INFO L280 TraceCheckUtils]: 26: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,594 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-17 22:21:31,595 INFO L280 TraceCheckUtils]: 28: Hoare triple {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-17 22:21:31,595 INFO L280 TraceCheckUtils]: 29: Hoare triple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-17 22:21:31,596 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1373#true} #42#return; {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-17 22:21:31,597 INFO L280 TraceCheckUtils]: 31: Hoare triple {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:21:31,598 INFO L280 TraceCheckUtils]: 32: Hoare triple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:21:31,599 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1373#true} #34#return; {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-17 22:21:31,600 INFO L280 TraceCheckUtils]: 34: Hoare triple {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-17 22:21:31,601 INFO L280 TraceCheckUtils]: 35: Hoare triple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-17 22:21:31,602 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1373#true} #42#return; {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-17 22:21:31,603 INFO L280 TraceCheckUtils]: 37: Hoare triple {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-17 22:21:31,603 INFO L280 TraceCheckUtils]: 38: Hoare triple {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-17 22:21:31,605 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1373#true} #40#return; {1411#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} is VALID [2020-07-17 22:21:31,605 INFO L280 TraceCheckUtils]: 40: Hoare triple {1411#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {1412#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-17 22:21:31,606 INFO L280 TraceCheckUtils]: 41: Hoare triple {1412#(and (< 4 main_~result~0) (<= main_~result~0 5))} assume 5 != ~result~0; {1374#false} is VALID [2020-07-17 22:21:31,606 INFO L280 TraceCheckUtils]: 42: Hoare triple {1374#false} assume !false; {1374#false} is VALID [2020-07-17 22:21:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-17 22:21:31,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225111357] [2020-07-17 22:21:31,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557180360] [2020-07-17 22:21:31,610 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:31,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:21:31,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:21:31,644 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-17 22:21:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:31,853 INFO L263 TraceCheckUtils]: 0: Hoare triple {1373#true} call ULTIMATE.init(); {1373#true} is VALID [2020-07-17 22:21:31,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume true; {1373#true} is VALID [2020-07-17 22:21:31,854 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1373#true} {1373#true} #36#return; {1373#true} is VALID [2020-07-17 22:21:31,854 INFO L263 TraceCheckUtils]: 3: Hoare triple {1373#true} call #t~ret3 := main(); {1373#true} is VALID [2020-07-17 22:21:31,854 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} ~input~0 := 5; {1373#true} is VALID [2020-07-17 22:21:31,855 INFO L263 TraceCheckUtils]: 5: Hoare triple {1373#true} call #t~ret2 := id(~input~0); {1373#true} is VALID [2020-07-17 22:21:31,855 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,855 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,855 INFO L263 TraceCheckUtils]: 8: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,856 INFO L280 TraceCheckUtils]: 9: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,856 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,856 INFO L263 TraceCheckUtils]: 11: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,856 INFO L280 TraceCheckUtils]: 12: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,857 INFO L280 TraceCheckUtils]: 13: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,857 INFO L263 TraceCheckUtils]: 14: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,857 INFO L280 TraceCheckUtils]: 15: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,857 INFO L280 TraceCheckUtils]: 16: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,858 INFO L263 TraceCheckUtils]: 17: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,858 INFO L280 TraceCheckUtils]: 18: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,858 INFO L280 TraceCheckUtils]: 19: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-17 22:21:31,858 INFO L263 TraceCheckUtils]: 20: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-17 22:21:31,859 INFO L280 TraceCheckUtils]: 21: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-17 22:21:31,860 INFO L280 TraceCheckUtils]: 22: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,861 INFO L280 TraceCheckUtils]: 23: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-17 22:21:31,863 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:31,863 INFO L280 TraceCheckUtils]: 25: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,864 INFO L280 TraceCheckUtils]: 26: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:21:31,865 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-17 22:21:31,867 INFO L280 TraceCheckUtils]: 28: Hoare triple {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-17 22:21:31,868 INFO L280 TraceCheckUtils]: 29: Hoare triple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-17 22:21:31,869 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1373#true} #42#return; {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-17 22:21:31,870 INFO L280 TraceCheckUtils]: 31: Hoare triple {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:21:31,871 INFO L280 TraceCheckUtils]: 32: Hoare triple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:21:31,873 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1373#true} #34#return; {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-17 22:21:31,874 INFO L280 TraceCheckUtils]: 34: Hoare triple {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-17 22:21:31,875 INFO L280 TraceCheckUtils]: 35: Hoare triple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-17 22:21:31,877 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1373#true} #42#return; {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-17 22:21:31,878 INFO L280 TraceCheckUtils]: 37: Hoare triple {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-17 22:21:31,878 INFO L280 TraceCheckUtils]: 38: Hoare triple {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-17 22:21:31,879 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1373#true} #40#return; {1411#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} is VALID [2020-07-17 22:21:31,880 INFO L280 TraceCheckUtils]: 40: Hoare triple {1411#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {1412#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-17 22:21:31,882 INFO L280 TraceCheckUtils]: 41: Hoare triple {1412#(and (< 4 main_~result~0) (<= main_~result~0 5))} assume 5 != ~result~0; {1374#false} is VALID [2020-07-17 22:21:31,882 INFO L280 TraceCheckUtils]: 42: Hoare triple {1374#false} assume !false; {1374#false} is VALID [2020-07-17 22:21:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-17 22:21:31,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:31,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2020-07-17 22:21:31,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614167998] [2020-07-17 22:21:31,887 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-07-17 22:21:31,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:31,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-17 22:21:31,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:31,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 22:21:31,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:31,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 22:21:31,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:21:31,937 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 15 states. [2020-07-17 22:21:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,575 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-07-17 22:21:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:21:32,575 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-07-17 22:21:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:21:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2020-07-17 22:21:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:21:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2020-07-17 22:21:32,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 45 transitions. [2020-07-17 22:21:32,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:32,645 INFO L225 Difference]: With dead ends: 57 [2020-07-17 22:21:32,645 INFO L226 Difference]: Without dead ends: 53 [2020-07-17 22:21:32,646 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:21:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-17 22:21:32,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2020-07-17 22:21:32,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:32,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 39 states. [2020-07-17 22:21:32,665 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 39 states. [2020-07-17 22:21:32,665 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 39 states. [2020-07-17 22:21:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,673 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-17 22:21:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-17 22:21:32,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:32,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:32,674 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 53 states. [2020-07-17 22:21:32,674 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 53 states. [2020-07-17 22:21:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,682 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-17 22:21:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-17 22:21:32,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:32,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:32,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:32,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-17 22:21:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-07-17 22:21:32,689 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 43 [2020-07-17 22:21:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:32,689 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-07-17 22:21:32,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 22:21:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-17 22:21:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-17 22:21:32,692 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:32,693 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:32,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:32,894 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:32,894 INFO L82 PathProgramCache]: Analyzing trace with hash 706413819, now seen corresponding path program 3 times [2020-07-17 22:21:32,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:32,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009886547] [2020-07-17 22:21:32,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,933 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} assume true; {1852#true} is VALID [2020-07-17 22:21:32,934 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1852#true} {1852#true} #36#return; {1852#true} is VALID [2020-07-17 22:21:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,135 INFO L280 TraceCheckUtils]: 2: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,136 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,138 INFO L263 TraceCheckUtils]: 2: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,138 INFO L280 TraceCheckUtils]: 3: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,139 INFO L280 TraceCheckUtils]: 4: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,140 INFO L280 TraceCheckUtils]: 5: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,141 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,141 INFO L280 TraceCheckUtils]: 7: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,142 INFO L280 TraceCheckUtils]: 8: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,144 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,145 INFO L263 TraceCheckUtils]: 2: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,146 INFO L280 TraceCheckUtils]: 3: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,147 INFO L263 TraceCheckUtils]: 5: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,147 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,148 INFO L280 TraceCheckUtils]: 7: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,149 INFO L280 TraceCheckUtils]: 8: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,150 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,151 INFO L280 TraceCheckUtils]: 11: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,153 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,153 INFO L280 TraceCheckUtils]: 13: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,154 INFO L280 TraceCheckUtils]: 14: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,155 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,156 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,157 INFO L280 TraceCheckUtils]: 1: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,157 INFO L263 TraceCheckUtils]: 2: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,158 INFO L280 TraceCheckUtils]: 3: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,158 INFO L280 TraceCheckUtils]: 4: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,158 INFO L263 TraceCheckUtils]: 5: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,159 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,160 INFO L280 TraceCheckUtils]: 7: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,160 INFO L263 TraceCheckUtils]: 8: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,161 INFO L280 TraceCheckUtils]: 9: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,161 INFO L280 TraceCheckUtils]: 10: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,162 INFO L280 TraceCheckUtils]: 11: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,163 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,164 INFO L280 TraceCheckUtils]: 13: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,164 INFO L280 TraceCheckUtils]: 14: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,166 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,167 INFO L280 TraceCheckUtils]: 16: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,167 INFO L280 TraceCheckUtils]: 17: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,169 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,169 INFO L280 TraceCheckUtils]: 19: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,170 INFO L280 TraceCheckUtils]: 20: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume true; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,171 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2002#(<= 3 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,173 INFO L263 TraceCheckUtils]: 2: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,174 INFO L280 TraceCheckUtils]: 3: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,175 INFO L280 TraceCheckUtils]: 4: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,175 INFO L263 TraceCheckUtils]: 5: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,175 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,176 INFO L280 TraceCheckUtils]: 7: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,176 INFO L263 TraceCheckUtils]: 8: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,177 INFO L280 TraceCheckUtils]: 9: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,177 INFO L280 TraceCheckUtils]: 10: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,178 INFO L263 TraceCheckUtils]: 11: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,178 INFO L280 TraceCheckUtils]: 12: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,179 INFO L280 TraceCheckUtils]: 13: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,180 INFO L280 TraceCheckUtils]: 14: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,181 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,181 INFO L280 TraceCheckUtils]: 16: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,182 INFO L280 TraceCheckUtils]: 17: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,183 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,184 INFO L280 TraceCheckUtils]: 19: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,185 INFO L280 TraceCheckUtils]: 20: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,186 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,187 INFO L280 TraceCheckUtils]: 22: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,187 INFO L280 TraceCheckUtils]: 23: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume true; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,189 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2002#(<= 3 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,189 INFO L280 TraceCheckUtils]: 25: Hoare triple {1985#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,190 INFO L280 TraceCheckUtils]: 26: Hoare triple {1985#(<= 4 |id_#in~x|)} assume true; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,191 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1985#(<= 4 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,193 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,193 INFO L280 TraceCheckUtils]: 1: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,194 INFO L263 TraceCheckUtils]: 2: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,194 INFO L280 TraceCheckUtils]: 3: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,195 INFO L280 TraceCheckUtils]: 4: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,195 INFO L263 TraceCheckUtils]: 5: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,196 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,196 INFO L280 TraceCheckUtils]: 7: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,196 INFO L263 TraceCheckUtils]: 8: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,197 INFO L280 TraceCheckUtils]: 9: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,198 INFO L280 TraceCheckUtils]: 10: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,198 INFO L263 TraceCheckUtils]: 11: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,199 INFO L280 TraceCheckUtils]: 12: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,199 INFO L280 TraceCheckUtils]: 13: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,199 INFO L263 TraceCheckUtils]: 14: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,200 INFO L280 TraceCheckUtils]: 15: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,201 INFO L280 TraceCheckUtils]: 16: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,202 INFO L280 TraceCheckUtils]: 17: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,203 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,204 INFO L280 TraceCheckUtils]: 19: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,205 INFO L280 TraceCheckUtils]: 20: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,206 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,207 INFO L280 TraceCheckUtils]: 22: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,207 INFO L280 TraceCheckUtils]: 23: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,209 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,210 INFO L280 TraceCheckUtils]: 25: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,210 INFO L280 TraceCheckUtils]: 26: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume true; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,212 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2002#(<= 3 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,212 INFO L280 TraceCheckUtils]: 28: Hoare triple {1985#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,213 INFO L280 TraceCheckUtils]: 29: Hoare triple {1985#(<= 4 |id_#in~x|)} assume true; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,215 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1985#(<= 4 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,215 INFO L280 TraceCheckUtils]: 31: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,216 INFO L280 TraceCheckUtils]: 32: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume true; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,217 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1962#(<= 5 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:21:33,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,220 INFO L263 TraceCheckUtils]: 2: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,221 INFO L280 TraceCheckUtils]: 3: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,221 INFO L280 TraceCheckUtils]: 4: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,222 INFO L263 TraceCheckUtils]: 5: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,222 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,223 INFO L280 TraceCheckUtils]: 7: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,223 INFO L263 TraceCheckUtils]: 8: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,224 INFO L280 TraceCheckUtils]: 9: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,225 INFO L280 TraceCheckUtils]: 10: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,225 INFO L263 TraceCheckUtils]: 11: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,225 INFO L280 TraceCheckUtils]: 12: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,226 INFO L280 TraceCheckUtils]: 13: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,226 INFO L263 TraceCheckUtils]: 14: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,227 INFO L280 TraceCheckUtils]: 15: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,227 INFO L280 TraceCheckUtils]: 16: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,228 INFO L263 TraceCheckUtils]: 17: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,228 INFO L280 TraceCheckUtils]: 18: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,229 INFO L280 TraceCheckUtils]: 19: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,229 INFO L280 TraceCheckUtils]: 20: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,231 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,231 INFO L280 TraceCheckUtils]: 22: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,232 INFO L280 TraceCheckUtils]: 23: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,233 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,234 INFO L280 TraceCheckUtils]: 25: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,235 INFO L280 TraceCheckUtils]: 26: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,236 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,237 INFO L280 TraceCheckUtils]: 28: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,237 INFO L280 TraceCheckUtils]: 29: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume true; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,239 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2002#(<= 3 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,240 INFO L280 TraceCheckUtils]: 31: Hoare triple {1985#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,240 INFO L280 TraceCheckUtils]: 32: Hoare triple {1985#(<= 4 |id_#in~x|)} assume true; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,242 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1985#(<= 4 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,243 INFO L280 TraceCheckUtils]: 34: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,244 INFO L280 TraceCheckUtils]: 35: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume true; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,245 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1962#(<= 5 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:21:33,246 INFO L280 TraceCheckUtils]: 37: Hoare triple {1932#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:21:33,246 INFO L280 TraceCheckUtils]: 38: Hoare triple {1932#(<= 6 |id_#in~x|)} assume true; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:21:33,247 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1932#(<= 6 |id_#in~x|)} {1856#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #40#return; {1853#false} is VALID [2020-07-17 22:21:33,249 INFO L263 TraceCheckUtils]: 0: Hoare triple {1852#true} call ULTIMATE.init(); {1852#true} is VALID [2020-07-17 22:21:33,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {1852#true} assume true; {1852#true} is VALID [2020-07-17 22:21:33,250 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1852#true} {1852#true} #36#return; {1852#true} is VALID [2020-07-17 22:21:33,250 INFO L263 TraceCheckUtils]: 3: Hoare triple {1852#true} call #t~ret3 := main(); {1852#true} is VALID [2020-07-17 22:21:33,251 INFO L280 TraceCheckUtils]: 4: Hoare triple {1852#true} ~input~0 := 5; {1856#(and (<= main_~input~0 5) (<= 5 main_~input~0))} is VALID [2020-07-17 22:21:33,251 INFO L263 TraceCheckUtils]: 5: Hoare triple {1856#(and (<= main_~input~0 5) (<= 5 main_~input~0))} call #t~ret2 := id(~input~0); {1852#true} is VALID [2020-07-17 22:21:33,252 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,253 INFO L280 TraceCheckUtils]: 7: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,253 INFO L263 TraceCheckUtils]: 8: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,253 INFO L280 TraceCheckUtils]: 9: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,254 INFO L280 TraceCheckUtils]: 10: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,254 INFO L263 TraceCheckUtils]: 11: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,255 INFO L280 TraceCheckUtils]: 12: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,256 INFO L280 TraceCheckUtils]: 13: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,256 INFO L263 TraceCheckUtils]: 14: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,257 INFO L280 TraceCheckUtils]: 15: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,257 INFO L280 TraceCheckUtils]: 16: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,258 INFO L263 TraceCheckUtils]: 17: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,258 INFO L280 TraceCheckUtils]: 18: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,259 INFO L280 TraceCheckUtils]: 19: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,259 INFO L263 TraceCheckUtils]: 20: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,260 INFO L280 TraceCheckUtils]: 21: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,261 INFO L280 TraceCheckUtils]: 22: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,261 INFO L263 TraceCheckUtils]: 23: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,262 INFO L280 TraceCheckUtils]: 24: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:33,262 INFO L280 TraceCheckUtils]: 25: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,263 INFO L280 TraceCheckUtils]: 26: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,264 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,265 INFO L280 TraceCheckUtils]: 28: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,265 INFO L280 TraceCheckUtils]: 29: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,267 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,268 INFO L280 TraceCheckUtils]: 31: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,268 INFO L280 TraceCheckUtils]: 32: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,270 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,271 INFO L280 TraceCheckUtils]: 34: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,272 INFO L280 TraceCheckUtils]: 35: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume true; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,273 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2002#(<= 3 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,274 INFO L280 TraceCheckUtils]: 37: Hoare triple {1985#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,275 INFO L280 TraceCheckUtils]: 38: Hoare triple {1985#(<= 4 |id_#in~x|)} assume true; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,276 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1985#(<= 4 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,277 INFO L280 TraceCheckUtils]: 40: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,277 INFO L280 TraceCheckUtils]: 41: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume true; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,279 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1962#(<= 5 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:21:33,279 INFO L280 TraceCheckUtils]: 43: Hoare triple {1932#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:21:33,280 INFO L280 TraceCheckUtils]: 44: Hoare triple {1932#(<= 6 |id_#in~x|)} assume true; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:21:33,281 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1932#(<= 6 |id_#in~x|)} {1856#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #40#return; {1853#false} is VALID [2020-07-17 22:21:33,281 INFO L280 TraceCheckUtils]: 46: Hoare triple {1853#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {1853#false} is VALID [2020-07-17 22:21:33,282 INFO L280 TraceCheckUtils]: 47: Hoare triple {1853#false} assume 5 != ~result~0; {1853#false} is VALID [2020-07-17 22:21:33,282 INFO L280 TraceCheckUtils]: 48: Hoare triple {1853#false} assume !false; {1853#false} is VALID [2020-07-17 22:21:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-17 22:21:33,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009886547] [2020-07-17 22:21:33,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144856255] [2020-07-17 22:21:33,285 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:33,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:21:33,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:21:33,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-17 22:21:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,340 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:33,596 INFO L263 TraceCheckUtils]: 0: Hoare triple {1852#true} call ULTIMATE.init(); {1852#true} is VALID [2020-07-17 22:21:33,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {1852#true} assume true; {1852#true} is VALID [2020-07-17 22:21:33,597 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1852#true} {1852#true} #36#return; {1852#true} is VALID [2020-07-17 22:21:33,597 INFO L263 TraceCheckUtils]: 3: Hoare triple {1852#true} call #t~ret3 := main(); {1852#true} is VALID [2020-07-17 22:21:33,598 INFO L280 TraceCheckUtils]: 4: Hoare triple {1852#true} ~input~0 := 5; {2035#(<= main_~input~0 5)} is VALID [2020-07-17 22:21:33,598 INFO L263 TraceCheckUtils]: 5: Hoare triple {2035#(<= main_~input~0 5)} call #t~ret2 := id(~input~0); {1852#true} is VALID [2020-07-17 22:21:33,599 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:33,600 INFO L280 TraceCheckUtils]: 7: Hoare triple {2042#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:33,600 INFO L263 TraceCheckUtils]: 8: Hoare triple {2042#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,601 INFO L280 TraceCheckUtils]: 9: Hoare triple {1852#true} ~x := #in~x; {2052#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,602 INFO L280 TraceCheckUtils]: 10: Hoare triple {2052#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2052#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,603 INFO L263 TraceCheckUtils]: 11: Hoare triple {2052#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,606 INFO L280 TraceCheckUtils]: 12: Hoare triple {1852#true} ~x := #in~x; {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:33,607 INFO L280 TraceCheckUtils]: 13: Hoare triple {2042#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:33,607 INFO L263 TraceCheckUtils]: 14: Hoare triple {2042#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,608 INFO L280 TraceCheckUtils]: 15: Hoare triple {1852#true} ~x := #in~x; {2052#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,609 INFO L280 TraceCheckUtils]: 16: Hoare triple {2052#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2052#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,609 INFO L263 TraceCheckUtils]: 17: Hoare triple {2052#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,610 INFO L280 TraceCheckUtils]: 18: Hoare triple {1852#true} ~x := #in~x; {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:33,610 INFO L280 TraceCheckUtils]: 19: Hoare triple {2042#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:33,611 INFO L263 TraceCheckUtils]: 20: Hoare triple {2042#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,611 INFO L280 TraceCheckUtils]: 21: Hoare triple {1852#true} ~x := #in~x; {2052#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,612 INFO L280 TraceCheckUtils]: 22: Hoare triple {2052#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2052#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:33,612 INFO L263 TraceCheckUtils]: 23: Hoare triple {2052#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-17 22:21:33,613 INFO L280 TraceCheckUtils]: 24: Hoare triple {1852#true} ~x := #in~x; {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:33,614 INFO L280 TraceCheckUtils]: 25: Hoare triple {2042#(<= id_~x |id_#in~x|)} assume 0 == ~x;#res := 0; {2101#(<= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,615 INFO L280 TraceCheckUtils]: 26: Hoare triple {2101#(<= 0 |id_#in~x|)} assume true; {2101#(<= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:33,616 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2101#(<= 0 |id_#in~x|)} {2052#(<= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,617 INFO L280 TraceCheckUtils]: 28: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,617 INFO L280 TraceCheckUtils]: 29: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,619 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {2042#(<= id_~x |id_#in~x|)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,620 INFO L280 TraceCheckUtils]: 31: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,620 INFO L280 TraceCheckUtils]: 32: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:21:33,622 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {2052#(<= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,623 INFO L280 TraceCheckUtils]: 34: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,623 INFO L280 TraceCheckUtils]: 35: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume true; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,625 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2002#(<= 3 |id2_#in~x|)} {2042#(<= id_~x |id_#in~x|)} #42#return; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,625 INFO L280 TraceCheckUtils]: 37: Hoare triple {1985#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,626 INFO L280 TraceCheckUtils]: 38: Hoare triple {1985#(<= 4 |id_#in~x|)} assume true; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:21:33,628 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1985#(<= 4 |id_#in~x|)} {2052#(<= id2_~x |id2_#in~x|)} #34#return; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,628 INFO L280 TraceCheckUtils]: 40: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,630 INFO L280 TraceCheckUtils]: 41: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume true; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-17 22:21:33,632 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1962#(<= 5 |id2_#in~x|)} {2042#(<= id_~x |id_#in~x|)} #42#return; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:21:33,632 INFO L280 TraceCheckUtils]: 43: Hoare triple {1932#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:21:33,633 INFO L280 TraceCheckUtils]: 44: Hoare triple {1932#(<= 6 |id_#in~x|)} assume true; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:21:33,634 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1932#(<= 6 |id_#in~x|)} {2035#(<= main_~input~0 5)} #40#return; {1853#false} is VALID [2020-07-17 22:21:33,635 INFO L280 TraceCheckUtils]: 46: Hoare triple {1853#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {1853#false} is VALID [2020-07-17 22:21:33,635 INFO L280 TraceCheckUtils]: 47: Hoare triple {1853#false} assume 5 != ~result~0; {1853#false} is VALID [2020-07-17 22:21:33,635 INFO L280 TraceCheckUtils]: 48: Hoare triple {1853#false} assume !false; {1853#false} is VALID [2020-07-17 22:21:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-17 22:21:33,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:21:33,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 16 [2020-07-17 22:21:33,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114577135] [2020-07-17 22:21:33,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2020-07-17 22:21:33,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:33,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-17 22:21:33,710 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-17 22:21:33,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 22:21:33,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:33,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 22:21:33,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:21:33,711 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 12 states. [2020-07-17 22:21:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:34,245 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2020-07-17 22:21:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:21:34,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2020-07-17 22:21:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:21:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2020-07-17 22:21:34,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:21:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2020-07-17 22:21:34,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 48 transitions. [2020-07-17 22:21:34,329 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-17 22:21:34,331 INFO L225 Difference]: With dead ends: 63 [2020-07-17 22:21:34,331 INFO L226 Difference]: Without dead ends: 39 [2020-07-17 22:21:34,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2020-07-17 22:21:34,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-17 22:21:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-17 22:21:34,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:34,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2020-07-17 22:21:34,356 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-17 22:21:34,356 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-17 22:21:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:34,359 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-17 22:21:34,359 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-07-17 22:21:34,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:34,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:34,362 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-17 22:21:34,362 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-17 22:21:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:34,364 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-17 22:21:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-07-17 22:21:34,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:34,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:34,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:34,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-17 22:21:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-07-17 22:21:34,368 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 49 [2020-07-17 22:21:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:34,368 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-07-17 22:21:34,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 22:21:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-07-17 22:21:34,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-17 22:21:34,373 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:34,373 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:34,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 22:21:34,575 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:34,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:34,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1492956279, now seen corresponding path program 3 times [2020-07-17 22:21:34,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:34,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5189377] [2020-07-17 22:21:34,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,617 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} assume true; {2382#true} is VALID [2020-07-17 22:21:34,618 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2382#true} {2382#true} #36#return; {2382#true} is VALID [2020-07-17 22:21:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,857 INFO L280 TraceCheckUtils]: 1: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,858 INFO L280 TraceCheckUtils]: 2: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,859 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,860 INFO L263 TraceCheckUtils]: 2: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,861 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,862 INFO L280 TraceCheckUtils]: 4: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,863 INFO L280 TraceCheckUtils]: 5: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,864 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,865 INFO L280 TraceCheckUtils]: 7: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,866 INFO L280 TraceCheckUtils]: 8: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,867 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,868 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,869 INFO L263 TraceCheckUtils]: 2: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,870 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,870 INFO L280 TraceCheckUtils]: 4: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,871 INFO L263 TraceCheckUtils]: 5: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,871 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,872 INFO L280 TraceCheckUtils]: 7: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,873 INFO L280 TraceCheckUtils]: 8: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,874 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,874 INFO L280 TraceCheckUtils]: 10: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,875 INFO L280 TraceCheckUtils]: 11: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,876 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,877 INFO L280 TraceCheckUtils]: 13: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,878 INFO L280 TraceCheckUtils]: 14: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,879 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,880 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,881 INFO L280 TraceCheckUtils]: 1: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,881 INFO L263 TraceCheckUtils]: 2: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,882 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,882 INFO L280 TraceCheckUtils]: 4: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,883 INFO L263 TraceCheckUtils]: 5: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,883 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,884 INFO L280 TraceCheckUtils]: 7: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,884 INFO L263 TraceCheckUtils]: 8: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,885 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,885 INFO L280 TraceCheckUtils]: 10: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,886 INFO L280 TraceCheckUtils]: 11: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,887 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,888 INFO L280 TraceCheckUtils]: 13: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,888 INFO L280 TraceCheckUtils]: 14: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,890 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,890 INFO L280 TraceCheckUtils]: 16: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,891 INFO L280 TraceCheckUtils]: 17: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,892 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,893 INFO L280 TraceCheckUtils]: 19: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,893 INFO L280 TraceCheckUtils]: 20: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,895 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,897 INFO L263 TraceCheckUtils]: 2: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,897 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,898 INFO L280 TraceCheckUtils]: 4: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,898 INFO L263 TraceCheckUtils]: 5: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,899 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,899 INFO L280 TraceCheckUtils]: 7: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,899 INFO L263 TraceCheckUtils]: 8: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,900 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,901 INFO L280 TraceCheckUtils]: 10: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,901 INFO L263 TraceCheckUtils]: 11: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,901 INFO L280 TraceCheckUtils]: 12: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,902 INFO L280 TraceCheckUtils]: 13: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,903 INFO L280 TraceCheckUtils]: 14: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,904 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,904 INFO L280 TraceCheckUtils]: 16: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,905 INFO L280 TraceCheckUtils]: 17: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,906 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,907 INFO L280 TraceCheckUtils]: 19: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,907 INFO L280 TraceCheckUtils]: 20: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,909 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,909 INFO L280 TraceCheckUtils]: 22: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,910 INFO L280 TraceCheckUtils]: 23: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,912 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,912 INFO L280 TraceCheckUtils]: 25: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,913 INFO L280 TraceCheckUtils]: 26: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume true; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,915 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2562#(<= 4 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:34,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,917 INFO L280 TraceCheckUtils]: 1: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,918 INFO L263 TraceCheckUtils]: 2: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,918 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,919 INFO L280 TraceCheckUtils]: 4: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,919 INFO L263 TraceCheckUtils]: 5: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,920 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,920 INFO L280 TraceCheckUtils]: 7: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,921 INFO L263 TraceCheckUtils]: 8: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,921 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,922 INFO L280 TraceCheckUtils]: 10: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,922 INFO L263 TraceCheckUtils]: 11: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,923 INFO L280 TraceCheckUtils]: 12: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,923 INFO L280 TraceCheckUtils]: 13: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,924 INFO L263 TraceCheckUtils]: 14: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,924 INFO L280 TraceCheckUtils]: 15: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,925 INFO L280 TraceCheckUtils]: 16: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,925 INFO L280 TraceCheckUtils]: 17: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,927 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,927 INFO L280 TraceCheckUtils]: 19: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,928 INFO L280 TraceCheckUtils]: 20: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,929 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,930 INFO L280 TraceCheckUtils]: 22: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,931 INFO L280 TraceCheckUtils]: 23: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,932 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,933 INFO L280 TraceCheckUtils]: 25: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,933 INFO L280 TraceCheckUtils]: 26: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,935 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,935 INFO L280 TraceCheckUtils]: 28: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,936 INFO L280 TraceCheckUtils]: 29: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume true; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,937 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2562#(<= 4 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:34,938 INFO L280 TraceCheckUtils]: 31: Hoare triple {2539#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:34,938 INFO L280 TraceCheckUtils]: 32: Hoare triple {2539#(<= 5 |id_#in~x|)} assume true; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:34,940 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2539#(<= 5 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,942 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,943 INFO L280 TraceCheckUtils]: 1: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,943 INFO L263 TraceCheckUtils]: 2: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,944 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,944 INFO L280 TraceCheckUtils]: 4: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,945 INFO L263 TraceCheckUtils]: 5: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,945 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,946 INFO L280 TraceCheckUtils]: 7: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,946 INFO L263 TraceCheckUtils]: 8: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,947 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,948 INFO L280 TraceCheckUtils]: 10: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,948 INFO L263 TraceCheckUtils]: 11: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,949 INFO L280 TraceCheckUtils]: 12: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,949 INFO L280 TraceCheckUtils]: 13: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,950 INFO L263 TraceCheckUtils]: 14: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,950 INFO L280 TraceCheckUtils]: 15: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,951 INFO L280 TraceCheckUtils]: 16: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,951 INFO L263 TraceCheckUtils]: 17: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,952 INFO L280 TraceCheckUtils]: 18: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,953 INFO L280 TraceCheckUtils]: 19: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,953 INFO L280 TraceCheckUtils]: 20: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,955 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,955 INFO L280 TraceCheckUtils]: 22: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,956 INFO L280 TraceCheckUtils]: 23: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,957 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,958 INFO L280 TraceCheckUtils]: 25: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,959 INFO L280 TraceCheckUtils]: 26: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,960 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,960 INFO L280 TraceCheckUtils]: 28: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,961 INFO L280 TraceCheckUtils]: 29: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,962 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,963 INFO L280 TraceCheckUtils]: 31: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,964 INFO L280 TraceCheckUtils]: 32: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume true; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,965 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2562#(<= 4 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:34,965 INFO L280 TraceCheckUtils]: 34: Hoare triple {2539#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:34,966 INFO L280 TraceCheckUtils]: 35: Hoare triple {2539#(<= 5 |id_#in~x|)} assume true; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:34,967 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2539#(<= 5 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,968 INFO L280 TraceCheckUtils]: 37: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,969 INFO L280 TraceCheckUtils]: 38: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume true; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,970 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2510#(<= 6 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-17 22:21:34,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,973 INFO L280 TraceCheckUtils]: 1: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,974 INFO L263 TraceCheckUtils]: 2: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,974 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,975 INFO L280 TraceCheckUtils]: 4: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,975 INFO L263 TraceCheckUtils]: 5: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,975 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,976 INFO L280 TraceCheckUtils]: 7: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,976 INFO L263 TraceCheckUtils]: 8: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,977 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,977 INFO L280 TraceCheckUtils]: 10: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,978 INFO L263 TraceCheckUtils]: 11: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,978 INFO L280 TraceCheckUtils]: 12: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,979 INFO L280 TraceCheckUtils]: 13: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,979 INFO L263 TraceCheckUtils]: 14: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,980 INFO L280 TraceCheckUtils]: 15: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,981 INFO L280 TraceCheckUtils]: 16: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,981 INFO L263 TraceCheckUtils]: 17: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,982 INFO L280 TraceCheckUtils]: 18: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,982 INFO L280 TraceCheckUtils]: 19: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:34,983 INFO L263 TraceCheckUtils]: 20: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:34,983 INFO L280 TraceCheckUtils]: 21: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:34,984 INFO L280 TraceCheckUtils]: 22: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,985 INFO L280 TraceCheckUtils]: 23: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,986 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,987 INFO L280 TraceCheckUtils]: 25: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,988 INFO L280 TraceCheckUtils]: 26: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:34,989 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,990 INFO L280 TraceCheckUtils]: 28: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,990 INFO L280 TraceCheckUtils]: 29: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,992 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,992 INFO L280 TraceCheckUtils]: 31: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,993 INFO L280 TraceCheckUtils]: 32: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:34,994 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,995 INFO L280 TraceCheckUtils]: 34: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,995 INFO L280 TraceCheckUtils]: 35: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume true; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:34,997 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2562#(<= 4 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:34,997 INFO L280 TraceCheckUtils]: 37: Hoare triple {2539#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:34,998 INFO L280 TraceCheckUtils]: 38: Hoare triple {2539#(<= 5 |id_#in~x|)} assume true; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:34,999 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2539#(<= 5 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,000 INFO L280 TraceCheckUtils]: 40: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,000 INFO L280 TraceCheckUtils]: 41: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume true; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,002 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2510#(<= 6 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-17 22:21:35,002 INFO L280 TraceCheckUtils]: 43: Hoare triple {2474#(<= 7 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-17 22:21:35,003 INFO L280 TraceCheckUtils]: 44: Hoare triple {2474#(<= 7 |id_#in~x|)} assume true; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-17 22:21:35,004 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2474#(<= 7 |id_#in~x|)} {2386#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #40#return; {2383#false} is VALID [2020-07-17 22:21:35,023 INFO L263 TraceCheckUtils]: 0: Hoare triple {2382#true} call ULTIMATE.init(); {2382#true} is VALID [2020-07-17 22:21:35,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {2382#true} assume true; {2382#true} is VALID [2020-07-17 22:21:35,023 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2382#true} {2382#true} #36#return; {2382#true} is VALID [2020-07-17 22:21:35,024 INFO L263 TraceCheckUtils]: 3: Hoare triple {2382#true} call #t~ret3 := main(); {2382#true} is VALID [2020-07-17 22:21:35,025 INFO L280 TraceCheckUtils]: 4: Hoare triple {2382#true} ~input~0 := 5; {2386#(and (<= main_~input~0 5) (<= 5 main_~input~0))} is VALID [2020-07-17 22:21:35,025 INFO L263 TraceCheckUtils]: 5: Hoare triple {2386#(and (<= main_~input~0 5) (<= 5 main_~input~0))} call #t~ret2 := id(~input~0); {2382#true} is VALID [2020-07-17 22:21:35,026 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:35,026 INFO L280 TraceCheckUtils]: 7: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:35,026 INFO L263 TraceCheckUtils]: 8: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,027 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,028 INFO L280 TraceCheckUtils]: 10: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,028 INFO L263 TraceCheckUtils]: 11: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,029 INFO L280 TraceCheckUtils]: 12: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:35,030 INFO L280 TraceCheckUtils]: 13: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:35,030 INFO L263 TraceCheckUtils]: 14: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,030 INFO L280 TraceCheckUtils]: 15: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,031 INFO L280 TraceCheckUtils]: 16: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,031 INFO L263 TraceCheckUtils]: 17: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,032 INFO L280 TraceCheckUtils]: 18: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:35,032 INFO L280 TraceCheckUtils]: 19: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:35,033 INFO L263 TraceCheckUtils]: 20: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,033 INFO L280 TraceCheckUtils]: 21: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,034 INFO L280 TraceCheckUtils]: 22: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,034 INFO L263 TraceCheckUtils]: 23: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,035 INFO L280 TraceCheckUtils]: 24: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:35,035 INFO L280 TraceCheckUtils]: 25: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:35,036 INFO L263 TraceCheckUtils]: 26: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,036 INFO L280 TraceCheckUtils]: 27: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,037 INFO L280 TraceCheckUtils]: 28: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,038 INFO L280 TraceCheckUtils]: 29: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,039 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:35,040 INFO L280 TraceCheckUtils]: 31: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:35,040 INFO L280 TraceCheckUtils]: 32: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:35,042 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,042 INFO L280 TraceCheckUtils]: 34: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,043 INFO L280 TraceCheckUtils]: 35: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,044 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:35,045 INFO L280 TraceCheckUtils]: 37: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:35,046 INFO L280 TraceCheckUtils]: 38: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:35,047 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,047 INFO L280 TraceCheckUtils]: 40: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,048 INFO L280 TraceCheckUtils]: 41: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume true; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,049 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2562#(<= 4 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:35,050 INFO L280 TraceCheckUtils]: 43: Hoare triple {2539#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:35,050 INFO L280 TraceCheckUtils]: 44: Hoare triple {2539#(<= 5 |id_#in~x|)} assume true; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:35,051 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2539#(<= 5 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,052 INFO L280 TraceCheckUtils]: 46: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,052 INFO L280 TraceCheckUtils]: 47: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume true; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,053 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2510#(<= 6 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-17 22:21:35,054 INFO L280 TraceCheckUtils]: 49: Hoare triple {2474#(<= 7 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-17 22:21:35,054 INFO L280 TraceCheckUtils]: 50: Hoare triple {2474#(<= 7 |id_#in~x|)} assume true; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-17 22:21:35,055 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2474#(<= 7 |id_#in~x|)} {2386#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #40#return; {2383#false} is VALID [2020-07-17 22:21:35,056 INFO L280 TraceCheckUtils]: 52: Hoare triple {2383#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {2383#false} is VALID [2020-07-17 22:21:35,056 INFO L280 TraceCheckUtils]: 53: Hoare triple {2383#false} assume 5 != ~result~0; {2383#false} is VALID [2020-07-17 22:21:35,056 INFO L280 TraceCheckUtils]: 54: Hoare triple {2383#false} assume !false; {2383#false} is VALID [2020-07-17 22:21:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-07-17 22:21:35,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5189377] [2020-07-17 22:21:35,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574353798] [2020-07-17 22:21:35,059 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:35,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:21:35,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:21:35,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-17 22:21:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:35,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:35,356 INFO L263 TraceCheckUtils]: 0: Hoare triple {2382#true} call ULTIMATE.init(); {2382#true} is VALID [2020-07-17 22:21:35,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {2382#true} assume true; {2382#true} is VALID [2020-07-17 22:21:35,357 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2382#true} {2382#true} #36#return; {2382#true} is VALID [2020-07-17 22:21:35,357 INFO L263 TraceCheckUtils]: 3: Hoare triple {2382#true} call #t~ret3 := main(); {2382#true} is VALID [2020-07-17 22:21:35,360 INFO L280 TraceCheckUtils]: 4: Hoare triple {2382#true} ~input~0 := 5; {2612#(<= main_~input~0 5)} is VALID [2020-07-17 22:21:35,360 INFO L263 TraceCheckUtils]: 5: Hoare triple {2612#(<= main_~input~0 5)} call #t~ret2 := id(~input~0); {2382#true} is VALID [2020-07-17 22:21:35,361 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:35,361 INFO L280 TraceCheckUtils]: 7: Hoare triple {2619#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:35,361 INFO L263 TraceCheckUtils]: 8: Hoare triple {2619#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,361 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,362 INFO L280 TraceCheckUtils]: 10: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,362 INFO L263 TraceCheckUtils]: 11: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,362 INFO L280 TraceCheckUtils]: 12: Hoare triple {2382#true} ~x := #in~x; {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:35,363 INFO L280 TraceCheckUtils]: 13: Hoare triple {2619#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:35,363 INFO L263 TraceCheckUtils]: 14: Hoare triple {2619#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,363 INFO L280 TraceCheckUtils]: 15: Hoare triple {2382#true} ~x := #in~x; {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,364 INFO L280 TraceCheckUtils]: 16: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,364 INFO L263 TraceCheckUtils]: 17: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,364 INFO L280 TraceCheckUtils]: 18: Hoare triple {2382#true} ~x := #in~x; {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:35,365 INFO L280 TraceCheckUtils]: 19: Hoare triple {2619#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:35,365 INFO L263 TraceCheckUtils]: 20: Hoare triple {2619#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,365 INFO L280 TraceCheckUtils]: 21: Hoare triple {2382#true} ~x := #in~x; {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,366 INFO L280 TraceCheckUtils]: 22: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,366 INFO L263 TraceCheckUtils]: 23: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,367 INFO L280 TraceCheckUtils]: 24: Hoare triple {2382#true} ~x := #in~x; {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:35,369 INFO L280 TraceCheckUtils]: 25: Hoare triple {2619#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:21:35,370 INFO L263 TraceCheckUtils]: 26: Hoare triple {2619#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-17 22:21:35,373 INFO L280 TraceCheckUtils]: 27: Hoare triple {2382#true} ~x := #in~x; {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:35,374 INFO L280 TraceCheckUtils]: 28: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2687#(<= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,375 INFO L280 TraceCheckUtils]: 29: Hoare triple {2687#(<= 0 |id2_#in~x|)} assume true; {2687#(<= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,376 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2687#(<= 0 |id2_#in~x|)} {2619#(<= id_~x |id_#in~x|)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:35,376 INFO L280 TraceCheckUtils]: 31: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:35,377 INFO L280 TraceCheckUtils]: 32: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:21:35,378 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2629#(<= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,379 INFO L280 TraceCheckUtils]: 34: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,379 INFO L280 TraceCheckUtils]: 35: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,380 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2619#(<= id_~x |id_#in~x|)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:35,381 INFO L280 TraceCheckUtils]: 37: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:35,381 INFO L280 TraceCheckUtils]: 38: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:21:35,383 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2629#(<= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,383 INFO L280 TraceCheckUtils]: 40: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,384 INFO L280 TraceCheckUtils]: 41: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume true; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,385 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2562#(<= 4 |id2_#in~x|)} {2619#(<= id_~x |id_#in~x|)} #42#return; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:35,385 INFO L280 TraceCheckUtils]: 43: Hoare triple {2539#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:35,386 INFO L280 TraceCheckUtils]: 44: Hoare triple {2539#(<= 5 |id_#in~x|)} assume true; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:21:35,387 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2539#(<= 5 |id_#in~x|)} {2629#(<= id2_~x |id2_#in~x|)} #34#return; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,388 INFO L280 TraceCheckUtils]: 46: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,388 INFO L280 TraceCheckUtils]: 47: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume true; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-17 22:21:35,389 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2510#(<= 6 |id2_#in~x|)} {2619#(<= id_~x |id_#in~x|)} #42#return; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-17 22:21:35,390 INFO L280 TraceCheckUtils]: 49: Hoare triple {2474#(<= 7 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-17 22:21:35,391 INFO L280 TraceCheckUtils]: 50: Hoare triple {2474#(<= 7 |id_#in~x|)} assume true; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-17 22:21:35,392 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2474#(<= 7 |id_#in~x|)} {2612#(<= main_~input~0 5)} #40#return; {2383#false} is VALID [2020-07-17 22:21:35,392 INFO L280 TraceCheckUtils]: 52: Hoare triple {2383#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {2383#false} is VALID [2020-07-17 22:21:35,392 INFO L280 TraceCheckUtils]: 53: Hoare triple {2383#false} assume 5 != ~result~0; {2383#false} is VALID [2020-07-17 22:21:35,392 INFO L280 TraceCheckUtils]: 54: Hoare triple {2383#false} assume !false; {2383#false} is VALID [2020-07-17 22:21:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-07-17 22:21:35,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:21:35,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 17 [2020-07-17 22:21:35,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769215792] [2020-07-17 22:21:35,396 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-07-17 22:21:35,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:35,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:21:35,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:35,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:21:35,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:35,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:21:35,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:21:35,449 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-07-17 22:21:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:35,959 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-17 22:21:35,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 22:21:35,959 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-07-17 22:21:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:21:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2020-07-17 22:21:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:21:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2020-07-17 22:21:35,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2020-07-17 22:21:36,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:36,033 INFO L225 Difference]: With dead ends: 39 [2020-07-17 22:21:36,033 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:21:36,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2020-07-17 22:21:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:21:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:21:36,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:36,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:36,035 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:36,036 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:36,036 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:21:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:21:36,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:36,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:36,037 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:36,037 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:36,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:36,037 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:21:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:21:36,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:36,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:36,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:36,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:21:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:21:36,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-17 22:21:36,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:36,039 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:21:36,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:21:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:21:36,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:36,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:36,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:21:36,300 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:21:36,300 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:21:36,300 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-07-17 22:21:36,300 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-17 22:21:36,301 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-17 22:21:36,301 INFO L268 CegarLoopResult]: For program point id2EXIT(lines 12 15) no Hoare annotation was computed. [2020-07-17 22:21:36,301 INFO L271 CegarLoopResult]: At program point id2ENTRY(lines 12 15) the Hoare annotation is: true [2020-07-17 22:21:36,301 INFO L268 CegarLoopResult]: For program point id2FINAL(lines 12 15) no Hoare annotation was computed. [2020-07-17 22:21:36,301 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:21:36,301 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:21:36,301 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:21:36,301 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:21:36,302 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2020-07-17 22:21:36,302 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 17 23) the Hoare annotation is: true [2020-07-17 22:21:36,302 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 17 23) no Hoare annotation was computed. [2020-07-17 22:21:36,302 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-17 22:21:36,302 INFO L268 CegarLoopResult]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-07-17 22:21:36,302 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-07-17 22:21:36,302 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-17 22:21:36,302 INFO L268 CegarLoopResult]: For program point L20-2(lines 17 23) no Hoare annotation was computed. [2020-07-17 22:21:36,302 INFO L268 CegarLoopResult]: For program point idFINAL(lines 7 10) no Hoare annotation was computed. [2020-07-17 22:21:36,302 INFO L268 CegarLoopResult]: For program point idEXIT(lines 7 10) no Hoare annotation was computed. [2020-07-17 22:21:36,303 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-17 22:21:36,303 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:21:36,303 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-17 22:21:36,303 INFO L271 CegarLoopResult]: At program point idENTRY(lines 7 10) the Hoare annotation is: true [2020-07-17 22:21:36,307 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:21:36,307 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:21:36,308 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:21:36,308 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:21:36,308 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:21:36,308 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:21:36,308 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:21:36,308 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-17 22:21:36,308 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:21:36,308 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:21:36,308 WARN L170 areAnnotationChecker]: id2FINAL has no Hoare annotation [2020-07-17 22:21:36,308 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: id2EXIT has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-17 22:21:36,309 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-17 22:21:36,310 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:21:36,310 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:21:36,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:21:36 BoogieIcfgContainer [2020-07-17 22:21:36,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:21:36,314 INFO L168 Benchmark]: Toolchain (without parser) took 11752.80 ms. Allocated memory was 144.2 MB in the beginning and 330.8 MB in the end (delta: 186.6 MB). Free memory was 102.2 MB in the beginning and 116.6 MB in the end (delta: -14.4 MB). Peak memory consumption was 172.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:36,315 INFO L168 Benchmark]: CDTParser took 1.58 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:21:36,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.73 ms. Allocated memory is still 144.2 MB. Free memory was 101.8 MB in the beginning and 92.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:36,316 INFO L168 Benchmark]: Boogie Preprocessor took 37.16 ms. Allocated memory is still 144.2 MB. Free memory was 92.2 MB in the beginning and 90.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:36,317 INFO L168 Benchmark]: RCFGBuilder took 411.73 ms. Allocated memory was 144.2 MB in the beginning and 200.3 MB in the end (delta: 56.1 MB). Free memory was 90.6 MB in the beginning and 163.4 MB in the end (delta: -72.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:36,317 INFO L168 Benchmark]: TraceAbstraction took 10921.55 ms. Allocated memory was 200.3 MB in the beginning and 330.8 MB in the end (delta: 130.5 MB). Free memory was 162.7 MB in the beginning and 116.6 MB in the end (delta: 46.0 MB). Peak memory consumption was 176.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:36,321 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 1.58 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 374.73 ms. Allocated memory is still 144.2 MB. Free memory was 101.8 MB in the beginning and 92.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.16 ms. Allocated memory is still 144.2 MB. Free memory was 92.2 MB in the beginning and 90.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 411.73 ms. Allocated memory was 144.2 MB in the beginning and 200.3 MB in the end (delta: 56.1 MB). Free memory was 90.6 MB in the beginning and 163.4 MB in the end (delta: -72.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10921.55 ms. Allocated memory was 200.3 MB in the beginning and 330.8 MB in the end (delta: 130.5 MB). Free memory was 162.7 MB in the beginning and 116.6 MB in the end (delta: 46.0 MB). Peak memory consumption was 176.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.7s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 179 SDtfs, 89 SDslu, 1129 SDs, 0 SdLazy, 516 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 418 GetRequests, 304 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 19 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 512 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 52080 SizeOfPredicates, 33 NumberOfNonLiveVariables, 564 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 282/360 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...