/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/id_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:59:22,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:59:22,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:59:22,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:59:22,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:59:22,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:59:22,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:59:22,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:59:22,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:59:22,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:59:22,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:59:22,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:59:22,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:59:22,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:59:22,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:59:22,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:59:22,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:59:22,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:59:22,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:59:22,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:59:22,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:59:22,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:59:22,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:59:22,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:59:22,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:59:22,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:59:22,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:59:22,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:59:22,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:59:22,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:59:22,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:59:22,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:59:22,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:59:22,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:59:22,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:59:22,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:59:22,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:59:22,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:59:22,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:59:22,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:59:22,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:59:22,328 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-10 14:59:22,344 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:59:22,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:59:22,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:59:22,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:59:22,346 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:59:22,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:59:22,347 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:59:22,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:59:22,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:59:22,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:59:22,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:59:22,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:59:22,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:59:22,348 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:59:22,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:59:22,349 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:59:22,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:59:22,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:59:22,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:59:22,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:59:22,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:59:22,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:59:22,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:59:22,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:59:22,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:59:22,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:59:22,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:59:22,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:59:22,351 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:59:22,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:59:22,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:59:22,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:59:22,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:59:22,676 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:59:22,676 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:59:22,677 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-07-10 14:59:22,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17cbfca7d/471fab1ef35b4645b30a535d6dabffc1/FLAGed18ebac3 [2020-07-10 14:59:23,241 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:59:23,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-07-10 14:59:23,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17cbfca7d/471fab1ef35b4645b30a535d6dabffc1/FLAGed18ebac3 [2020-07-10 14:59:23,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17cbfca7d/471fab1ef35b4645b30a535d6dabffc1 [2020-07-10 14:59:23,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:59:23,646 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:59:23,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:59:23,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:59:23,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:59:23,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:59:23" (1/1) ... [2020-07-10 14:59:23,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102d8181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:59:23, skipping insertion in model container [2020-07-10 14:59:23,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:59:23" (1/1) ... [2020-07-10 14:59:23,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:59:23,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:59:23,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:59:23,862 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:59:23,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:59:23,893 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:59:23,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:59:23 WrapperNode [2020-07-10 14:59:23,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:59:23,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:59:23,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:59:23,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:59:23,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:59:23" (1/1) ... [2020-07-10 14:59:23,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:59:23" (1/1) ... [2020-07-10 14:59:23,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:59:23" (1/1) ... [2020-07-10 14:59:23,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:59:23" (1/1) ... [2020-07-10 14:59:23,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:59:23" (1/1) ... [2020-07-10 14:59:23,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:59:23" (1/1) ... [2020-07-10 14:59:23,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:59:23" (1/1) ... [2020-07-10 14:59:23,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:59:23,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:59:23,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:59:23,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:59:23,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:59:23" (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-10 14:59:24,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:59:24,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:59:24,070 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-10 14:59:24,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:59:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:59:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:59:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-10 14:59:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:59:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:59:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:59:24,283 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:59:24,283 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:59:24,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:59:24 BoogieIcfgContainer [2020-07-10 14:59:24,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:59:24,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:59:24,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:59:24,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:59:24,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:59:23" (1/3) ... [2020-07-10 14:59:24,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400abb44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:59:24, skipping insertion in model container [2020-07-10 14:59:24,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:59:23" (2/3) ... [2020-07-10 14:59:24,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400abb44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:59:24, skipping insertion in model container [2020-07-10 14:59:24,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:59:24" (3/3) ... [2020-07-10 14:59:24,297 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i5_o5-2.c [2020-07-10 14:59:24,309 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:59:24,317 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:59:24,333 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:59:24,359 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:59:24,360 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:59:24,360 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:59:24,360 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:59:24,360 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:59:24,360 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:59:24,361 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:59:24,361 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:59:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-10 14:59:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 14:59:24,400 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:59:24,401 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:59:24,402 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:59:24,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:59:24,411 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-07-10 14:59:24,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:59:24,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206630797] [2020-07-10 14:59:24,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:59:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:24,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 14:59:24,641 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-10 14:59:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:24,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} ~x := #in~x; {32#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:24,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {33#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:24,702 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#(= 0 |id_#in~x|)} assume true; {33#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:24,704 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {33#(= 0 |id_#in~x|)} {27#(<= 5 main_~input~0)} #30#return; {24#false} is VALID [2020-07-10 14:59:24,705 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-10 14:59:24,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 14:59:24,706 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-10 14:59:24,706 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-10 14:59:24,707 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} ~input~0 := 5; {27#(<= 5 main_~input~0)} is VALID [2020-07-10 14:59:24,708 INFO L263 TraceCheckUtils]: 5: Hoare triple {27#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {23#true} is VALID [2020-07-10 14:59:24,709 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#true} ~x := #in~x; {32#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:24,710 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {33#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:24,711 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#(= 0 |id_#in~x|)} assume true; {33#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:24,713 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {33#(= 0 |id_#in~x|)} {27#(<= 5 main_~input~0)} #30#return; {24#false} is VALID [2020-07-10 14:59:24,714 INFO L280 TraceCheckUtils]: 10: Hoare triple {24#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {24#false} is VALID [2020-07-10 14:59:24,714 INFO L280 TraceCheckUtils]: 11: Hoare triple {24#false} assume 5 != ~result~0; {24#false} is VALID [2020-07-10 14:59:24,715 INFO L280 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-10 14:59:24,716 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-10 14:59:24,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206630797] [2020-07-10 14:59:24,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:59:24,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:59:24,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000750734] [2020-07-10 14:59:24,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:59:24,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:59:24,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:59:24,769 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-10 14:59:24,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:59:24,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:59:24,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:59:24,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:59:24,785 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-07-10 14:59:25,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:25,001 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 14:59:25,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:59:25,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:59:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:59:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:59:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-10 14:59:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:59:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-10 14:59:25,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-10 14:59:25,092 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-10 14:59:25,105 INFO L225 Difference]: With dead ends: 30 [2020-07-10 14:59:25,106 INFO L226 Difference]: Without dead ends: 18 [2020-07-10 14:59:25,110 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-10 14:59:25,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-10 14:59:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-10 14:59:25,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:59:25,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-10 14:59:25,167 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 14:59:25,167 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 14:59:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:25,172 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-10 14:59:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 14:59:25,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:25,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:25,174 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 14:59:25,174 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 14:59:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:25,178 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-10 14:59:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 14:59:25,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:25,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:25,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:59:25,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:59:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 14:59:25,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-10 14:59:25,185 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-10 14:59:25,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:59:25,186 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-10 14:59:25,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:59:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 14:59:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 14:59:25,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:59:25,187 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:59:25,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:59:25,188 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:59:25,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:59:25,189 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-07-10 14:59:25,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:59:25,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285808985] [2020-07-10 14:59:25,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:59:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:25,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-10 14:59:25,252 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-10 14:59:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:25,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:25,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {157#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:25,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:25,358 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {157#(= 0 |id_#in~x|)} {151#(= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:25,359 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:25,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#(= |id_#in~x| id_~x)} assume !(0 == ~x); {151#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:25,361 INFO L263 TraceCheckUtils]: 2: Hoare triple {151#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-10 14:59:25,362 INFO L280 TraceCheckUtils]: 3: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:25,363 INFO L280 TraceCheckUtils]: 4: Hoare triple {151#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {157#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:25,364 INFO L280 TraceCheckUtils]: 5: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:25,366 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {157#(= 0 |id_#in~x|)} {151#(= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:25,367 INFO L280 TraceCheckUtils]: 7: Hoare triple {156#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {156#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:25,367 INFO L280 TraceCheckUtils]: 8: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:25,369 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-10 14:59:25,370 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-10 14:59:25,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-10 14:59:25,371 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-10 14:59:25,371 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-10 14:59:25,372 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} ~input~0 := 5; {140#(<= 5 main_~input~0)} is VALID [2020-07-10 14:59:25,373 INFO L263 TraceCheckUtils]: 5: Hoare triple {140#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {136#true} is VALID [2020-07-10 14:59:25,374 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:25,375 INFO L280 TraceCheckUtils]: 7: Hoare triple {151#(= |id_#in~x| id_~x)} assume !(0 == ~x); {151#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:25,375 INFO L263 TraceCheckUtils]: 8: Hoare triple {151#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-10 14:59:25,376 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:25,377 INFO L280 TraceCheckUtils]: 10: Hoare triple {151#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {157#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:25,378 INFO L280 TraceCheckUtils]: 11: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:25,380 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {157#(= 0 |id_#in~x|)} {151#(= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:25,381 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {156#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:25,382 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:25,383 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-10 14:59:25,384 INFO L280 TraceCheckUtils]: 16: Hoare triple {137#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {137#false} is VALID [2020-07-10 14:59:25,384 INFO L280 TraceCheckUtils]: 17: Hoare triple {137#false} assume 5 != ~result~0; {137#false} is VALID [2020-07-10 14:59:25,385 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-10 14:59:25,387 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-10 14:59:25,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285808985] [2020-07-10 14:59:25,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162065974] [2020-07-10 14:59:25,388 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-10 14:59:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:25,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 14:59:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:25,447 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:59:25,581 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-10 14:59:25,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-10 14:59:25,582 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-10 14:59:25,583 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-10 14:59:25,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} ~input~0 := 5; {140#(<= 5 main_~input~0)} is VALID [2020-07-10 14:59:25,584 INFO L263 TraceCheckUtils]: 5: Hoare triple {140#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {136#true} is VALID [2020-07-10 14:59:25,585 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} ~x := #in~x; {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:25,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {179#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:25,586 INFO L263 TraceCheckUtils]: 8: Hoare triple {179#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-10 14:59:25,587 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} ~x := #in~x; {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:25,588 INFO L280 TraceCheckUtils]: 10: Hoare triple {179#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {192#(<= |id_#in~x| 0)} is VALID [2020-07-10 14:59:25,589 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#(<= |id_#in~x| 0)} assume true; {192#(<= |id_#in~x| 0)} is VALID [2020-07-10 14:59:25,591 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {192#(<= |id_#in~x| 0)} {179#(<= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:25,592 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {156#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:25,593 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:25,595 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-10 14:59:25,595 INFO L280 TraceCheckUtils]: 16: Hoare triple {137#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {137#false} is VALID [2020-07-10 14:59:25,595 INFO L280 TraceCheckUtils]: 17: Hoare triple {137#false} assume 5 != ~result~0; {137#false} is VALID [2020-07-10 14:59:25,596 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-10 14:59:25,597 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-10 14:59:25,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:59:25,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-10 14:59:25,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426486084] [2020-07-10 14:59:25,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-10 14:59:25,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:59:25,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 14:59:25,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:59:25,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 14:59:25,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:59:25,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 14:59:25,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 14:59:25,638 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2020-07-10 14:59:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:25,792 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-10 14:59:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:59:25,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-10 14:59:25,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:59:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 14:59:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-10 14:59:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 14:59:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-10 14:59:25,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-10 14:59:25,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:59:25,835 INFO L225 Difference]: With dead ends: 25 [2020-07-10 14:59:25,835 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 14:59:25,837 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:59:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 14:59:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-10 14:59:25,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:59:25,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-10 14:59:25,847 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 14:59:25,847 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 14:59:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:25,850 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-10 14:59:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-10 14:59:25,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:25,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:25,851 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 14:59:25,851 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 14:59:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:25,854 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-10 14:59:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-10 14:59:25,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:25,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:25,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:59:25,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:59:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 14:59:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-10 14:59:25,858 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-07-10 14:59:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:59:25,859 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-10 14:59:25,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 14:59:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-10 14:59:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 14:59:25,860 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:59:25,860 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:59:26,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 14:59:26,074 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:59:26,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:59:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-07-10 14:59:26,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:59:26,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172258283] [2020-07-10 14:59:26,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:59:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:26,122 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-10 14:59:26,123 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-10 14:59:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:26,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,225 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:26,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:26,227 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,228 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,229 INFO L263 TraceCheckUtils]: 2: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-10 14:59:26,230 INFO L280 TraceCheckUtils]: 3: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:26,232 INFO L280 TraceCheckUtils]: 5: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:26,233 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,234 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,235 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,237 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {359#(<= |id_#in~x| 1)} {343#(= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:26,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,240 INFO L263 TraceCheckUtils]: 2: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-10 14:59:26,241 INFO L280 TraceCheckUtils]: 3: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,242 INFO L280 TraceCheckUtils]: 4: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,242 INFO L263 TraceCheckUtils]: 5: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-10 14:59:26,243 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,244 INFO L280 TraceCheckUtils]: 7: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:26,245 INFO L280 TraceCheckUtils]: 8: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:26,247 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,248 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,248 INFO L280 TraceCheckUtils]: 11: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,250 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {359#(<= |id_#in~x| 1)} {343#(= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:26,251 INFO L280 TraceCheckUtils]: 13: Hoare triple {354#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {354#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:26,252 INFO L280 TraceCheckUtils]: 14: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:26,253 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-10 14:59:26,254 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-10 14:59:26,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-10 14:59:26,255 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-10 14:59:26,255 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret2 := main(); {322#true} is VALID [2020-07-10 14:59:26,256 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} ~input~0 := 5; {326#(<= 5 main_~input~0)} is VALID [2020-07-10 14:59:26,257 INFO L263 TraceCheckUtils]: 5: Hoare triple {326#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {322#true} is VALID [2020-07-10 14:59:26,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,259 INFO L263 TraceCheckUtils]: 8: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-10 14:59:26,260 INFO L280 TraceCheckUtils]: 9: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,261 INFO L280 TraceCheckUtils]: 10: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,261 INFO L263 TraceCheckUtils]: 11: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-10 14:59:26,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,263 INFO L280 TraceCheckUtils]: 13: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:26,264 INFO L280 TraceCheckUtils]: 14: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:26,266 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,266 INFO L280 TraceCheckUtils]: 16: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,267 INFO L280 TraceCheckUtils]: 17: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,269 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {359#(<= |id_#in~x| 1)} {343#(= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:26,269 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {354#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:26,270 INFO L280 TraceCheckUtils]: 20: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:26,271 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-10 14:59:26,272 INFO L280 TraceCheckUtils]: 22: Hoare triple {323#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {323#false} is VALID [2020-07-10 14:59:26,272 INFO L280 TraceCheckUtils]: 23: Hoare triple {323#false} assume 5 != ~result~0; {323#false} is VALID [2020-07-10 14:59:26,272 INFO L280 TraceCheckUtils]: 24: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-10 14:59:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 14:59:26,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172258283] [2020-07-10 14:59:26,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204211623] [2020-07-10 14:59:26,275 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 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-10 14:59:26,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:59:26,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:59:26,304 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 14:59:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:26,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:59:26,442 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-10 14:59:26,442 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-10 14:59:26,443 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-10 14:59:26,443 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret2 := main(); {322#true} is VALID [2020-07-10 14:59:26,444 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} ~input~0 := 5; {326#(<= 5 main_~input~0)} is VALID [2020-07-10 14:59:26,445 INFO L263 TraceCheckUtils]: 5: Hoare triple {326#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {322#true} is VALID [2020-07-10 14:59:26,446 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,447 INFO L280 TraceCheckUtils]: 7: Hoare triple {382#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,447 INFO L263 TraceCheckUtils]: 8: Hoare triple {382#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-10 14:59:26,448 INFO L280 TraceCheckUtils]: 9: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,449 INFO L280 TraceCheckUtils]: 10: Hoare triple {382#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,449 INFO L263 TraceCheckUtils]: 11: Hoare triple {382#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-10 14:59:26,450 INFO L280 TraceCheckUtils]: 12: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:26,451 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {404#(<= |id_#in~x| 0)} is VALID [2020-07-10 14:59:26,452 INFO L280 TraceCheckUtils]: 14: Hoare triple {404#(<= |id_#in~x| 0)} assume true; {404#(<= |id_#in~x| 0)} is VALID [2020-07-10 14:59:26,455 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {404#(<= |id_#in~x| 0)} {382#(<= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,456 INFO L280 TraceCheckUtils]: 16: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,457 INFO L280 TraceCheckUtils]: 17: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:26,459 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {359#(<= |id_#in~x| 1)} {382#(<= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:26,460 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {354#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:26,460 INFO L280 TraceCheckUtils]: 20: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:26,462 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-10 14:59:26,462 INFO L280 TraceCheckUtils]: 22: Hoare triple {323#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {323#false} is VALID [2020-07-10 14:59:26,463 INFO L280 TraceCheckUtils]: 23: Hoare triple {323#false} assume 5 != ~result~0; {323#false} is VALID [2020-07-10 14:59:26,463 INFO L280 TraceCheckUtils]: 24: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-10 14:59:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 14:59:26,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:59:26,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-10 14:59:26,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825492057] [2020-07-10 14:59:26,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-10 14:59:26,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:59:26,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 14:59:26,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:59:26,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 14:59:26,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:59:26,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 14:59:26,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:59:26,509 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2020-07-10 14:59:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:26,673 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 14:59:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 14:59:26,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-10 14:59:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:59:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 14:59:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-10 14:59:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 14:59:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-10 14:59:26,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2020-07-10 14:59:26,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:59:26,720 INFO L225 Difference]: With dead ends: 28 [2020-07-10 14:59:26,720 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 14:59:26,721 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-07-10 14:59:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 14:59:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-10 14:59:26,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:59:26,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-10 14:59:26,730 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 14:59:26,730 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 14:59:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:26,733 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-10 14:59:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 14:59:26,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:26,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:26,734 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 14:59:26,734 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 14:59:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:26,737 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-10 14:59:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 14:59:26,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:26,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:26,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:59:26,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:59:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 14:59:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-10 14:59:26,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-07-10 14:59:26,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:59:26,742 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-10 14:59:26,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 14:59:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 14:59:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 14:59:26,743 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:59:26,743 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:59:26,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:59:26,958 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:59:26,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:59:26,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-07-10 14:59:26,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:59:26,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044374990] [2020-07-10 14:59:26,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:59:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:26,999 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-10 14:59:26,999 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-10 14:59:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:27,130 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,131 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:27,132 INFO L280 TraceCheckUtils]: 2: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:27,133 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,135 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-10 14:59:27,136 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,137 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:27,138 INFO L280 TraceCheckUtils]: 5: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:27,139 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,140 INFO L280 TraceCheckUtils]: 7: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,140 INFO L280 TraceCheckUtils]: 8: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,143 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,145 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,146 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-10 14:59:27,146 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,147 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,147 INFO L263 TraceCheckUtils]: 5: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-10 14:59:27,148 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,149 INFO L280 TraceCheckUtils]: 7: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:27,149 INFO L280 TraceCheckUtils]: 8: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:27,151 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,152 INFO L280 TraceCheckUtils]: 11: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,153 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,154 INFO L280 TraceCheckUtils]: 13: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,155 INFO L280 TraceCheckUtils]: 14: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,157 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {612#(<= |id_#in~x| 2)} {584#(= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:27,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,159 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-10 14:59:27,160 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,160 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,161 INFO L263 TraceCheckUtils]: 5: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-10 14:59:27,161 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,162 INFO L280 TraceCheckUtils]: 7: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,163 INFO L263 TraceCheckUtils]: 8: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-10 14:59:27,163 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,164 INFO L280 TraceCheckUtils]: 10: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:27,165 INFO L280 TraceCheckUtils]: 11: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:27,166 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,167 INFO L280 TraceCheckUtils]: 13: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,168 INFO L280 TraceCheckUtils]: 14: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,169 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,170 INFO L280 TraceCheckUtils]: 16: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,171 INFO L280 TraceCheckUtils]: 17: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,173 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {612#(<= |id_#in~x| 2)} {584#(= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:27,173 INFO L280 TraceCheckUtils]: 19: Hoare triple {601#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {601#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:27,174 INFO L280 TraceCheckUtils]: 20: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:27,175 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-10 14:59:27,176 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2020-07-10 14:59:27,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-10 14:59:27,177 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-10 14:59:27,177 INFO L263 TraceCheckUtils]: 3: Hoare triple {557#true} call #t~ret2 := main(); {557#true} is VALID [2020-07-10 14:59:27,178 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} ~input~0 := 5; {561#(<= 5 main_~input~0)} is VALID [2020-07-10 14:59:27,178 INFO L263 TraceCheckUtils]: 5: Hoare triple {561#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {557#true} is VALID [2020-07-10 14:59:27,179 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,180 INFO L280 TraceCheckUtils]: 7: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,180 INFO L263 TraceCheckUtils]: 8: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-10 14:59:27,181 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,181 INFO L280 TraceCheckUtils]: 10: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,182 INFO L263 TraceCheckUtils]: 11: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-10 14:59:27,182 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,183 INFO L280 TraceCheckUtils]: 13: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,183 INFO L263 TraceCheckUtils]: 14: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-10 14:59:27,184 INFO L280 TraceCheckUtils]: 15: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,185 INFO L280 TraceCheckUtils]: 16: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:27,185 INFO L280 TraceCheckUtils]: 17: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:27,187 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,188 INFO L280 TraceCheckUtils]: 19: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,189 INFO L280 TraceCheckUtils]: 20: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,190 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,191 INFO L280 TraceCheckUtils]: 22: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,192 INFO L280 TraceCheckUtils]: 23: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,194 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {612#(<= |id_#in~x| 2)} {584#(= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:27,194 INFO L280 TraceCheckUtils]: 25: Hoare triple {601#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {601#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:27,195 INFO L280 TraceCheckUtils]: 26: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:27,196 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-10 14:59:27,197 INFO L280 TraceCheckUtils]: 28: Hoare triple {558#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {558#false} is VALID [2020-07-10 14:59:27,197 INFO L280 TraceCheckUtils]: 29: Hoare triple {558#false} assume 5 != ~result~0; {558#false} is VALID [2020-07-10 14:59:27,197 INFO L280 TraceCheckUtils]: 30: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-10 14:59:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-10 14:59:27,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044374990] [2020-07-10 14:59:27,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141861042] [2020-07-10 14:59:27,199 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 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-10 14:59:27,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-10 14:59:27,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:59:27,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-10 14:59:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:27,242 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:59:27,365 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2020-07-10 14:59:27,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-10 14:59:27,366 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-10 14:59:27,366 INFO L263 TraceCheckUtils]: 3: Hoare triple {557#true} call #t~ret2 := main(); {557#true} is VALID [2020-07-10 14:59:27,367 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} ~input~0 := 5; {561#(<= 5 main_~input~0)} is VALID [2020-07-10 14:59:27,367 INFO L263 TraceCheckUtils]: 5: Hoare triple {561#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {557#true} is VALID [2020-07-10 14:59:27,368 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,369 INFO L280 TraceCheckUtils]: 7: Hoare triple {640#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,369 INFO L263 TraceCheckUtils]: 8: Hoare triple {640#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-10 14:59:27,370 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,370 INFO L280 TraceCheckUtils]: 10: Hoare triple {640#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,371 INFO L263 TraceCheckUtils]: 11: Hoare triple {640#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-10 14:59:27,371 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} ~x := #in~x; {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,372 INFO L280 TraceCheckUtils]: 13: Hoare triple {640#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,372 INFO L263 TraceCheckUtils]: 14: Hoare triple {640#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-10 14:59:27,373 INFO L280 TraceCheckUtils]: 15: Hoare triple {557#true} ~x := #in~x; {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:27,374 INFO L280 TraceCheckUtils]: 16: Hoare triple {640#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {671#(<= |id_#in~x| 0)} is VALID [2020-07-10 14:59:27,375 INFO L280 TraceCheckUtils]: 17: Hoare triple {671#(<= |id_#in~x| 0)} assume true; {671#(<= |id_#in~x| 0)} is VALID [2020-07-10 14:59:27,376 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {671#(<= |id_#in~x| 0)} {640#(<= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,377 INFO L280 TraceCheckUtils]: 19: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,378 INFO L280 TraceCheckUtils]: 20: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:27,379 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {617#(<= |id_#in~x| 1)} {640#(<= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,380 INFO L280 TraceCheckUtils]: 22: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,380 INFO L280 TraceCheckUtils]: 23: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:27,382 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {612#(<= |id_#in~x| 2)} {640#(<= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:27,383 INFO L280 TraceCheckUtils]: 25: Hoare triple {601#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {601#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:27,384 INFO L280 TraceCheckUtils]: 26: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:27,385 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-10 14:59:27,385 INFO L280 TraceCheckUtils]: 28: Hoare triple {558#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {558#false} is VALID [2020-07-10 14:59:27,385 INFO L280 TraceCheckUtils]: 29: Hoare triple {558#false} assume 5 != ~result~0; {558#false} is VALID [2020-07-10 14:59:27,386 INFO L280 TraceCheckUtils]: 30: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-10 14:59:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-10 14:59:27,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:59:27,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-10 14:59:27,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369603377] [2020-07-10 14:59:27,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-10 14:59:27,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:59:27,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 14:59:27,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:59:27,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 14:59:27,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:59:27,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 14:59:27,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:59:27,441 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2020-07-10 14:59:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:27,687 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-10 14:59:27,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:59:27,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-10 14:59:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:59:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:59:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2020-07-10 14:59:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:59:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2020-07-10 14:59:27,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2020-07-10 14:59:27,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:59:27,739 INFO L225 Difference]: With dead ends: 31 [2020-07-10 14:59:27,739 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 14:59:27,740 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-07-10 14:59:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 14:59:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-10 14:59:27,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:59:27,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-10 14:59:27,750 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 14:59:27,750 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 14:59:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:27,753 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-10 14:59:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-10 14:59:27,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:27,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:27,754 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 14:59:27,754 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 14:59:27,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:27,757 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-10 14:59:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-10 14:59:27,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:27,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:27,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:59:27,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:59:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 14:59:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-10 14:59:27,762 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-07-10 14:59:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:59:27,763 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-10 14:59:27,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 14:59:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-10 14:59:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 14:59:27,764 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:59:27,765 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:59:27,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:59:27,966 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:59:27,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:59:27,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-07-10 14:59:27,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:59:27,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820067967] [2020-07-10 14:59:27,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:59:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:28,048 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} assume true; {847#true} is VALID [2020-07-10 14:59:28,048 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {847#true} {847#true} #26#return; {847#true} is VALID [2020-07-10 14:59:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:28,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:28,205 INFO L280 TraceCheckUtils]: 2: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:28,207 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,208 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,209 INFO L263 TraceCheckUtils]: 2: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,209 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,210 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:28,211 INFO L280 TraceCheckUtils]: 5: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:28,212 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,213 INFO L280 TraceCheckUtils]: 7: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,214 INFO L280 TraceCheckUtils]: 8: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,215 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,217 INFO L263 TraceCheckUtils]: 2: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,218 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,218 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,219 INFO L263 TraceCheckUtils]: 5: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,220 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:28,221 INFO L280 TraceCheckUtils]: 8: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:28,222 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,223 INFO L280 TraceCheckUtils]: 10: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,224 INFO L280 TraceCheckUtils]: 11: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,226 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,226 INFO L280 TraceCheckUtils]: 13: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,227 INFO L280 TraceCheckUtils]: 14: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,229 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {931#(<= |id_#in~x| 2)} {880#(= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,230 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,231 INFO L263 TraceCheckUtils]: 2: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,231 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,232 INFO L263 TraceCheckUtils]: 5: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,233 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,234 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,234 INFO L263 TraceCheckUtils]: 8: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,235 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,235 INFO L280 TraceCheckUtils]: 10: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:28,236 INFO L280 TraceCheckUtils]: 11: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:28,238 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,239 INFO L280 TraceCheckUtils]: 13: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,241 INFO L280 TraceCheckUtils]: 14: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,243 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,245 INFO L280 TraceCheckUtils]: 16: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,247 INFO L280 TraceCheckUtils]: 17: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,248 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {931#(<= |id_#in~x| 2)} {880#(= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,249 INFO L280 TraceCheckUtils]: 19: Hoare triple {920#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,249 INFO L280 TraceCheckUtils]: 20: Hoare triple {920#(<= |id_#in~x| 3)} assume true; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,251 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {920#(<= |id_#in~x| 3)} {880#(= |id_#in~x| id_~x)} #32#return; {903#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:59:28,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,253 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,253 INFO L263 TraceCheckUtils]: 2: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,255 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,256 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,257 INFO L263 TraceCheckUtils]: 5: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,260 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,261 INFO L263 TraceCheckUtils]: 8: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,262 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,262 INFO L280 TraceCheckUtils]: 10: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,262 INFO L263 TraceCheckUtils]: 11: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,263 INFO L280 TraceCheckUtils]: 12: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,264 INFO L280 TraceCheckUtils]: 13: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:28,264 INFO L280 TraceCheckUtils]: 14: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:28,266 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,266 INFO L280 TraceCheckUtils]: 16: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,267 INFO L280 TraceCheckUtils]: 17: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,269 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,269 INFO L280 TraceCheckUtils]: 19: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,270 INFO L280 TraceCheckUtils]: 20: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,272 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {931#(<= |id_#in~x| 2)} {880#(= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,272 INFO L280 TraceCheckUtils]: 22: Hoare triple {920#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,273 INFO L280 TraceCheckUtils]: 23: Hoare triple {920#(<= |id_#in~x| 3)} assume true; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,274 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {920#(<= |id_#in~x| 3)} {880#(= |id_#in~x| id_~x)} #32#return; {903#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:59:28,275 INFO L280 TraceCheckUtils]: 25: Hoare triple {903#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {903#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:59:28,276 INFO L280 TraceCheckUtils]: 26: Hoare triple {903#(<= |id_#in~x| 4)} assume true; {903#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:59:28,277 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {903#(<= |id_#in~x| 4)} {851#(<= 5 main_~input~0)} #30#return; {848#false} is VALID [2020-07-10 14:59:28,278 INFO L263 TraceCheckUtils]: 0: Hoare triple {847#true} call ULTIMATE.init(); {847#true} is VALID [2020-07-10 14:59:28,279 INFO L280 TraceCheckUtils]: 1: Hoare triple {847#true} assume true; {847#true} is VALID [2020-07-10 14:59:28,279 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {847#true} {847#true} #26#return; {847#true} is VALID [2020-07-10 14:59:28,279 INFO L263 TraceCheckUtils]: 3: Hoare triple {847#true} call #t~ret2 := main(); {847#true} is VALID [2020-07-10 14:59:28,280 INFO L280 TraceCheckUtils]: 4: Hoare triple {847#true} ~input~0 := 5; {851#(<= 5 main_~input~0)} is VALID [2020-07-10 14:59:28,280 INFO L263 TraceCheckUtils]: 5: Hoare triple {851#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {847#true} is VALID [2020-07-10 14:59:28,281 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,282 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,282 INFO L263 TraceCheckUtils]: 8: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,283 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,283 INFO L280 TraceCheckUtils]: 10: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,283 INFO L263 TraceCheckUtils]: 11: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,284 INFO L280 TraceCheckUtils]: 12: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,285 INFO L280 TraceCheckUtils]: 13: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,285 INFO L263 TraceCheckUtils]: 14: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,286 INFO L280 TraceCheckUtils]: 15: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,286 INFO L280 TraceCheckUtils]: 16: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,286 INFO L263 TraceCheckUtils]: 17: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,287 INFO L280 TraceCheckUtils]: 18: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,288 INFO L280 TraceCheckUtils]: 19: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:28,288 INFO L280 TraceCheckUtils]: 20: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:28,290 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,290 INFO L280 TraceCheckUtils]: 22: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,291 INFO L280 TraceCheckUtils]: 23: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,293 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,293 INFO L280 TraceCheckUtils]: 25: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,294 INFO L280 TraceCheckUtils]: 26: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,296 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {931#(<= |id_#in~x| 2)} {880#(= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,296 INFO L280 TraceCheckUtils]: 28: Hoare triple {920#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,297 INFO L280 TraceCheckUtils]: 29: Hoare triple {920#(<= |id_#in~x| 3)} assume true; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,299 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {920#(<= |id_#in~x| 3)} {880#(= |id_#in~x| id_~x)} #32#return; {903#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:59:28,300 INFO L280 TraceCheckUtils]: 31: Hoare triple {903#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {903#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:59:28,300 INFO L280 TraceCheckUtils]: 32: Hoare triple {903#(<= |id_#in~x| 4)} assume true; {903#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:59:28,304 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {903#(<= |id_#in~x| 4)} {851#(<= 5 main_~input~0)} #30#return; {848#false} is VALID [2020-07-10 14:59:28,304 INFO L280 TraceCheckUtils]: 34: Hoare triple {848#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {848#false} is VALID [2020-07-10 14:59:28,305 INFO L280 TraceCheckUtils]: 35: Hoare triple {848#false} assume 5 != ~result~0; {848#false} is VALID [2020-07-10 14:59:28,305 INFO L280 TraceCheckUtils]: 36: Hoare triple {848#false} assume !false; {848#false} is VALID [2020-07-10 14:59:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-10 14:59:28,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820067967] [2020-07-10 14:59:28,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384842227] [2020-07-10 14:59:28,307 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-10 14:59:28,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 14:59:28,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:59:28,344 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-10 14:59:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:28,356 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:59:28,506 INFO L263 TraceCheckUtils]: 0: Hoare triple {847#true} call ULTIMATE.init(); {847#true} is VALID [2020-07-10 14:59:28,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {847#true} assume true; {847#true} is VALID [2020-07-10 14:59:28,506 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {847#true} {847#true} #26#return; {847#true} is VALID [2020-07-10 14:59:28,507 INFO L263 TraceCheckUtils]: 3: Hoare triple {847#true} call #t~ret2 := main(); {847#true} is VALID [2020-07-10 14:59:28,507 INFO L280 TraceCheckUtils]: 4: Hoare triple {847#true} ~input~0 := 5; {851#(<= 5 main_~input~0)} is VALID [2020-07-10 14:59:28,508 INFO L263 TraceCheckUtils]: 5: Hoare triple {851#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {847#true} is VALID [2020-07-10 14:59:28,508 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,509 INFO L280 TraceCheckUtils]: 7: Hoare triple {959#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,509 INFO L263 TraceCheckUtils]: 8: Hoare triple {959#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,510 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,510 INFO L280 TraceCheckUtils]: 10: Hoare triple {959#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,511 INFO L263 TraceCheckUtils]: 11: Hoare triple {959#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,511 INFO L280 TraceCheckUtils]: 12: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,512 INFO L280 TraceCheckUtils]: 13: Hoare triple {959#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,512 INFO L263 TraceCheckUtils]: 14: Hoare triple {959#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,513 INFO L280 TraceCheckUtils]: 15: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,513 INFO L280 TraceCheckUtils]: 16: Hoare triple {959#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,514 INFO L263 TraceCheckUtils]: 17: Hoare triple {959#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-10 14:59:28,514 INFO L280 TraceCheckUtils]: 18: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:28,515 INFO L280 TraceCheckUtils]: 19: Hoare triple {959#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {999#(<= |id_#in~x| 0)} is VALID [2020-07-10 14:59:28,516 INFO L280 TraceCheckUtils]: 20: Hoare triple {999#(<= |id_#in~x| 0)} assume true; {999#(<= |id_#in~x| 0)} is VALID [2020-07-10 14:59:28,517 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {999#(<= |id_#in~x| 0)} {959#(<= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,518 INFO L280 TraceCheckUtils]: 22: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,519 INFO L280 TraceCheckUtils]: 23: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:59:28,520 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {936#(<= |id_#in~x| 1)} {959#(<= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,521 INFO L280 TraceCheckUtils]: 25: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,522 INFO L280 TraceCheckUtils]: 26: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:59:28,523 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {931#(<= |id_#in~x| 2)} {959#(<= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,524 INFO L280 TraceCheckUtils]: 28: Hoare triple {920#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,525 INFO L280 TraceCheckUtils]: 29: Hoare triple {920#(<= |id_#in~x| 3)} assume true; {920#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:59:28,526 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {920#(<= |id_#in~x| 3)} {959#(<= |id_#in~x| id_~x)} #32#return; {903#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:59:28,527 INFO L280 TraceCheckUtils]: 31: Hoare triple {903#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {903#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:59:28,527 INFO L280 TraceCheckUtils]: 32: Hoare triple {903#(<= |id_#in~x| 4)} assume true; {903#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:59:28,529 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {903#(<= |id_#in~x| 4)} {851#(<= 5 main_~input~0)} #30#return; {848#false} is VALID [2020-07-10 14:59:28,529 INFO L280 TraceCheckUtils]: 34: Hoare triple {848#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {848#false} is VALID [2020-07-10 14:59:28,529 INFO L280 TraceCheckUtils]: 35: Hoare triple {848#false} assume 5 != ~result~0; {848#false} is VALID [2020-07-10 14:59:28,529 INFO L280 TraceCheckUtils]: 36: Hoare triple {848#false} assume !false; {848#false} is VALID [2020-07-10 14:59:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-10 14:59:28,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:59:28,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-07-10 14:59:28,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896885289] [2020-07-10 14:59:28,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-10 14:59:28,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:59:28,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 14:59:28,587 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-10 14:59:28,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 14:59:28,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:59:28,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 14:59:28,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-10 14:59:28,589 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 11 states. [2020-07-10 14:59:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:28,831 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-10 14:59:28,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 14:59:28,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-10 14:59:28,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:59:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 14:59:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-10 14:59:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 14:59:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-10 14:59:28,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-10 14:59:28,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:59:28,901 INFO L225 Difference]: With dead ends: 34 [2020-07-10 14:59:28,902 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 14:59:28,903 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2020-07-10 14:59:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 14:59:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-10 14:59:28,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:59:28,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-10 14:59:28,914 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 14:59:28,915 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 14:59:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:28,918 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-10 14:59:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-10 14:59:28,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:28,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:28,921 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 14:59:28,921 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 14:59:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:28,923 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-10 14:59:28,924 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-10 14:59:28,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:28,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:28,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:59:28,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:59:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 14:59:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-10 14:59:28,927 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-07-10 14:59:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:59:28,928 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-10 14:59:28,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 14:59:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-10 14:59:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 14:59:28,929 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:59:28,929 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:59:29,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:59:29,141 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:59:29,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:59:29,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-07-10 14:59:29,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:59:29,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291816971] [2020-07-10 14:59:29,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:59:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:29,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} assume true; {1198#true} is VALID [2020-07-10 14:59:29,250 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1198#true} {1198#true} #26#return; {1198#true} is VALID [2020-07-10 14:59:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:29,581 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,583 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:59:29,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,584 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,585 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,585 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,586 INFO L280 TraceCheckUtils]: 5: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,587 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:59:29,588 INFO L280 TraceCheckUtils]: 7: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,589 INFO L280 TraceCheckUtils]: 8: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,590 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,591 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,591 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,591 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,592 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,592 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,592 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,593 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,594 INFO L280 TraceCheckUtils]: 8: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,595 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:59:29,596 INFO L280 TraceCheckUtils]: 10: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,596 INFO L280 TraceCheckUtils]: 11: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,598 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,599 INFO L280 TraceCheckUtils]: 13: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-10 14:59:29,599 INFO L280 TraceCheckUtils]: 14: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-10 14:59:29,600 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,602 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,602 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,602 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,603 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,603 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,603 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,604 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,605 INFO L280 TraceCheckUtils]: 11: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,606 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:59:29,607 INFO L280 TraceCheckUtils]: 13: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,608 INFO L280 TraceCheckUtils]: 14: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,609 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,611 INFO L280 TraceCheckUtils]: 16: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-10 14:59:29,613 INFO L280 TraceCheckUtils]: 17: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-10 14:59:29,614 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,615 INFO L280 TraceCheckUtils]: 19: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:59:29,616 INFO L280 TraceCheckUtils]: 20: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:59:29,617 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,619 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,619 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,620 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,620 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,621 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,621 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,621 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,621 INFO L263 TraceCheckUtils]: 11: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,621 INFO L280 TraceCheckUtils]: 12: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,624 INFO L280 TraceCheckUtils]: 13: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,625 INFO L280 TraceCheckUtils]: 14: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,627 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:59:29,627 INFO L280 TraceCheckUtils]: 16: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,628 INFO L280 TraceCheckUtils]: 17: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,629 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,630 INFO L280 TraceCheckUtils]: 19: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-10 14:59:29,631 INFO L280 TraceCheckUtils]: 20: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-10 14:59:29,633 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,634 INFO L280 TraceCheckUtils]: 22: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:59:29,635 INFO L280 TraceCheckUtils]: 23: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:59:29,636 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,637 INFO L280 TraceCheckUtils]: 25: Hoare triple {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-10 14:59:29,638 INFO L280 TraceCheckUtils]: 26: Hoare triple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-10 14:59:29,640 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1198#true} #32#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-10 14:59:29,642 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,643 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,643 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,643 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,644 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,644 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,644 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,644 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,644 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,645 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,645 INFO L263 TraceCheckUtils]: 11: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,645 INFO L280 TraceCheckUtils]: 13: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,645 INFO L263 TraceCheckUtils]: 14: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,646 INFO L280 TraceCheckUtils]: 15: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,647 INFO L280 TraceCheckUtils]: 16: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,658 INFO L280 TraceCheckUtils]: 17: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,661 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:59:29,667 INFO L280 TraceCheckUtils]: 19: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,667 INFO L280 TraceCheckUtils]: 20: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,668 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,669 INFO L280 TraceCheckUtils]: 22: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-10 14:59:29,670 INFO L280 TraceCheckUtils]: 23: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-10 14:59:29,671 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,672 INFO L280 TraceCheckUtils]: 25: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:59:29,673 INFO L280 TraceCheckUtils]: 26: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:59:29,674 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,675 INFO L280 TraceCheckUtils]: 28: Hoare triple {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-10 14:59:29,675 INFO L280 TraceCheckUtils]: 29: Hoare triple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-10 14:59:29,676 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1198#true} #32#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-10 14:59:29,677 INFO L280 TraceCheckUtils]: 31: Hoare triple {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-10 14:59:29,678 INFO L280 TraceCheckUtils]: 32: Hoare triple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-10 14:59:29,679 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1198#true} #30#return; {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} is VALID [2020-07-10 14:59:29,681 INFO L263 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2020-07-10 14:59:29,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2020-07-10 14:59:29,682 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #26#return; {1198#true} is VALID [2020-07-10 14:59:29,682 INFO L263 TraceCheckUtils]: 3: Hoare triple {1198#true} call #t~ret2 := main(); {1198#true} is VALID [2020-07-10 14:59:29,682 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} ~input~0 := 5; {1198#true} is VALID [2020-07-10 14:59:29,682 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret1 := id(~input~0); {1198#true} is VALID [2020-07-10 14:59:29,682 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,683 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,683 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,683 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,683 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,683 INFO L263 TraceCheckUtils]: 11: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,684 INFO L280 TraceCheckUtils]: 12: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,684 INFO L280 TraceCheckUtils]: 13: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,684 INFO L263 TraceCheckUtils]: 14: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,684 INFO L280 TraceCheckUtils]: 15: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,684 INFO L280 TraceCheckUtils]: 16: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,685 INFO L263 TraceCheckUtils]: 17: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,685 INFO L280 TraceCheckUtils]: 18: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,685 INFO L280 TraceCheckUtils]: 19: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,685 INFO L263 TraceCheckUtils]: 20: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,685 INFO L280 TraceCheckUtils]: 21: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,687 INFO L280 TraceCheckUtils]: 22: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,687 INFO L280 TraceCheckUtils]: 23: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,689 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:59:29,689 INFO L280 TraceCheckUtils]: 25: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,690 INFO L280 TraceCheckUtils]: 26: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,691 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,692 INFO L280 TraceCheckUtils]: 28: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-10 14:59:29,693 INFO L280 TraceCheckUtils]: 29: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-10 14:59:29,694 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,695 INFO L280 TraceCheckUtils]: 31: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:59:29,695 INFO L280 TraceCheckUtils]: 32: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:59:29,697 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-10 14:59:29,698 INFO L280 TraceCheckUtils]: 34: Hoare triple {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-10 14:59:29,698 INFO L280 TraceCheckUtils]: 35: Hoare triple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-10 14:59:29,701 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1198#true} #32#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-10 14:59:29,702 INFO L280 TraceCheckUtils]: 37: Hoare triple {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-10 14:59:29,703 INFO L280 TraceCheckUtils]: 38: Hoare triple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-10 14:59:29,704 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1198#true} #30#return; {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} is VALID [2020-07-10 14:59:29,705 INFO L280 TraceCheckUtils]: 40: Hoare triple {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {1237#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-10 14:59:29,705 INFO L280 TraceCheckUtils]: 41: Hoare triple {1237#(and (< 4 main_~result~0) (<= main_~result~0 5))} assume 5 != ~result~0; {1199#false} is VALID [2020-07-10 14:59:29,706 INFO L280 TraceCheckUtils]: 42: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2020-07-10 14:59:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-10 14:59:29,709 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291816971] [2020-07-10 14:59:29,710 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651148045] [2020-07-10 14:59:29,710 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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-10 14:59:29,751 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-10 14:59:29,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:59:29,753 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-10 14:59:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:29,765 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:59:29,988 INFO L263 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2020-07-10 14:59:29,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2020-07-10 14:59:29,988 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #26#return; {1198#true} is VALID [2020-07-10 14:59:29,989 INFO L263 TraceCheckUtils]: 3: Hoare triple {1198#true} call #t~ret2 := main(); {1198#true} is VALID [2020-07-10 14:59:29,989 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} ~input~0 := 5; {1198#true} is VALID [2020-07-10 14:59:29,989 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret1 := id(~input~0); {1198#true} is VALID [2020-07-10 14:59:29,989 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,990 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,990 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,990 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,990 INFO L263 TraceCheckUtils]: 11: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,990 INFO L280 TraceCheckUtils]: 12: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,990 INFO L280 TraceCheckUtils]: 13: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,991 INFO L263 TraceCheckUtils]: 14: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,991 INFO L280 TraceCheckUtils]: 15: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,991 INFO L280 TraceCheckUtils]: 16: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,991 INFO L263 TraceCheckUtils]: 17: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,991 INFO L280 TraceCheckUtils]: 18: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,992 INFO L280 TraceCheckUtils]: 19: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-10 14:59:29,992 INFO L263 TraceCheckUtils]: 20: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-10 14:59:29,992 INFO L280 TraceCheckUtils]: 21: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-10 14:59:29,994 INFO L280 TraceCheckUtils]: 22: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,995 INFO L280 TraceCheckUtils]: 23: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:59:29,997 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:59:29,998 INFO L280 TraceCheckUtils]: 25: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:29,999 INFO L280 TraceCheckUtils]: 26: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:59:30,000 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-10 14:59:30,002 INFO L280 TraceCheckUtils]: 28: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-10 14:59:30,003 INFO L280 TraceCheckUtils]: 29: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-10 14:59:30,004 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-10 14:59:30,006 INFO L280 TraceCheckUtils]: 31: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:59:30,008 INFO L280 TraceCheckUtils]: 32: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:59:30,009 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-10 14:59:30,011 INFO L280 TraceCheckUtils]: 34: Hoare triple {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-10 14:59:30,012 INFO L280 TraceCheckUtils]: 35: Hoare triple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-10 14:59:30,014 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1198#true} #32#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-10 14:59:30,015 INFO L280 TraceCheckUtils]: 37: Hoare triple {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-10 14:59:30,016 INFO L280 TraceCheckUtils]: 38: Hoare triple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-10 14:59:30,017 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1198#true} #30#return; {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} is VALID [2020-07-10 14:59:30,019 INFO L280 TraceCheckUtils]: 40: Hoare triple {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {1237#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-10 14:59:30,020 INFO L280 TraceCheckUtils]: 41: Hoare triple {1237#(and (< 4 main_~result~0) (<= main_~result~0 5))} assume 5 != ~result~0; {1199#false} is VALID [2020-07-10 14:59:30,021 INFO L280 TraceCheckUtils]: 42: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2020-07-10 14:59:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-10 14:59:30,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:59:30,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2020-07-10 14:59:30,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426874349] [2020-07-10 14:59:30,025 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-07-10 14:59:30,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:59:30,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 14:59:30,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:59:30,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 14:59:30,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:59:30,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 14:59:30,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-10 14:59:30,067 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2020-07-10 14:59:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:30,577 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-07-10 14:59:30,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 14:59:30,577 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-07-10 14:59:30,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:59:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:59:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2020-07-10 14:59:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:59:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2020-07-10 14:59:30,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 38 transitions. [2020-07-10 14:59:30,639 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-10 14:59:30,641 INFO L225 Difference]: With dead ends: 37 [2020-07-10 14:59:30,641 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 14:59:30,642 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-10 14:59:30,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 14:59:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-10 14:59:30,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:59:30,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-10 14:59:30,649 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 14:59:30,649 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 14:59:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:30,652 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-10 14:59:30,652 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-10 14:59:30,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:30,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:30,653 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 14:59:30,653 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 14:59:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:30,656 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-10 14:59:30,656 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-10 14:59:30,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:30,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:30,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:59:30,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:59:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 14:59:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-10 14:59:30,659 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-07-10 14:59:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:59:30,659 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-10 14:59:30,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 14:59:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-10 14:59:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 14:59:30,661 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:59:30,661 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:59:30,873 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-10 14:59:30,874 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:59:30,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:59:30,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-07-10 14:59:30,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:59:30,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342074854] [2020-07-10 14:59:30,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:59:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:30,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} assume true; {1607#true} is VALID [2020-07-10 14:59:30,913 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1607#true} {1607#true} #26#return; {1607#true} is VALID [2020-07-10 14:59:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:31,105 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,107 INFO L280 TraceCheckUtils]: 2: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,108 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,109 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,110 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,111 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,112 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,113 INFO L280 TraceCheckUtils]: 5: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,114 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,115 INFO L280 TraceCheckUtils]: 7: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,116 INFO L280 TraceCheckUtils]: 8: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,118 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,120 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,122 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,124 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,125 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,126 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,129 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,130 INFO L280 TraceCheckUtils]: 8: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,132 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,132 INFO L280 TraceCheckUtils]: 10: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,133 INFO L280 TraceCheckUtils]: 11: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,134 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,135 INFO L280 TraceCheckUtils]: 13: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,136 INFO L280 TraceCheckUtils]: 14: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,138 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,140 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,141 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,141 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,142 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,142 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,143 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,143 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,144 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,144 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,145 INFO L280 TraceCheckUtils]: 11: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,146 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,147 INFO L280 TraceCheckUtils]: 13: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,147 INFO L280 TraceCheckUtils]: 14: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,149 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,149 INFO L280 TraceCheckUtils]: 16: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,150 INFO L280 TraceCheckUtils]: 17: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,151 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,152 INFO L280 TraceCheckUtils]: 19: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,153 INFO L280 TraceCheckUtils]: 20: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,154 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,156 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,156 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,157 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,157 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,158 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,158 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,159 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,159 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,160 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,160 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,161 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,161 INFO L263 TraceCheckUtils]: 11: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,162 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,163 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,163 INFO L280 TraceCheckUtils]: 14: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,165 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,166 INFO L280 TraceCheckUtils]: 16: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,166 INFO L280 TraceCheckUtils]: 17: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,168 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,169 INFO L280 TraceCheckUtils]: 19: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,170 INFO L280 TraceCheckUtils]: 20: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,171 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,172 INFO L280 TraceCheckUtils]: 22: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,173 INFO L280 TraceCheckUtils]: 23: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,175 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,175 INFO L280 TraceCheckUtils]: 25: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,176 INFO L280 TraceCheckUtils]: 26: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,178 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,181 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,182 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,183 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,183 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,184 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,184 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,185 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,186 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,186 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,187 INFO L263 TraceCheckUtils]: 11: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,188 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,188 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,189 INFO L263 TraceCheckUtils]: 14: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,190 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,190 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,191 INFO L280 TraceCheckUtils]: 17: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,193 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,194 INFO L280 TraceCheckUtils]: 19: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,194 INFO L280 TraceCheckUtils]: 20: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,196 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,197 INFO L280 TraceCheckUtils]: 22: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,197 INFO L280 TraceCheckUtils]: 23: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,199 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,200 INFO L280 TraceCheckUtils]: 25: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,200 INFO L280 TraceCheckUtils]: 26: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,202 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,203 INFO L280 TraceCheckUtils]: 28: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,204 INFO L280 TraceCheckUtils]: 29: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,205 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,206 INFO L280 TraceCheckUtils]: 31: Hoare triple {1716#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,207 INFO L280 TraceCheckUtils]: 32: Hoare triple {1716#(<= 5 |id_#in~x|)} assume true; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,209 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1716#(<= 5 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:59:31,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,212 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,213 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,214 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,214 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,215 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,216 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,216 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,217 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,218 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,218 INFO L263 TraceCheckUtils]: 11: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,219 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,220 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,220 INFO L263 TraceCheckUtils]: 14: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,221 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,222 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,222 INFO L263 TraceCheckUtils]: 17: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,223 INFO L280 TraceCheckUtils]: 18: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,224 INFO L280 TraceCheckUtils]: 19: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,225 INFO L280 TraceCheckUtils]: 20: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,226 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,227 INFO L280 TraceCheckUtils]: 22: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,228 INFO L280 TraceCheckUtils]: 23: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,229 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,230 INFO L280 TraceCheckUtils]: 25: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,230 INFO L280 TraceCheckUtils]: 26: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,231 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,232 INFO L280 TraceCheckUtils]: 28: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,233 INFO L280 TraceCheckUtils]: 29: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,234 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,235 INFO L280 TraceCheckUtils]: 31: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,235 INFO L280 TraceCheckUtils]: 32: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,237 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,237 INFO L280 TraceCheckUtils]: 34: Hoare triple {1716#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,238 INFO L280 TraceCheckUtils]: 35: Hoare triple {1716#(<= 5 |id_#in~x|)} assume true; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,239 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1716#(<= 5 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:59:31,240 INFO L280 TraceCheckUtils]: 37: Hoare triple {1687#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:59:31,241 INFO L280 TraceCheckUtils]: 38: Hoare triple {1687#(<= 6 |id_#in~x|)} assume true; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:59:31,242 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1687#(<= 6 |id_#in~x|)} {1611#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #30#return; {1608#false} is VALID [2020-07-10 14:59:31,244 INFO L263 TraceCheckUtils]: 0: Hoare triple {1607#true} call ULTIMATE.init(); {1607#true} is VALID [2020-07-10 14:59:31,245 INFO L280 TraceCheckUtils]: 1: Hoare triple {1607#true} assume true; {1607#true} is VALID [2020-07-10 14:59:31,245 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1607#true} {1607#true} #26#return; {1607#true} is VALID [2020-07-10 14:59:31,245 INFO L263 TraceCheckUtils]: 3: Hoare triple {1607#true} call #t~ret2 := main(); {1607#true} is VALID [2020-07-10 14:59:31,246 INFO L280 TraceCheckUtils]: 4: Hoare triple {1607#true} ~input~0 := 5; {1611#(and (<= main_~input~0 5) (<= 5 main_~input~0))} is VALID [2020-07-10 14:59:31,246 INFO L263 TraceCheckUtils]: 5: Hoare triple {1611#(and (<= main_~input~0 5) (<= 5 main_~input~0))} call #t~ret1 := id(~input~0); {1607#true} is VALID [2020-07-10 14:59:31,247 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,247 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,248 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,248 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,249 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,249 INFO L263 TraceCheckUtils]: 11: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,250 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,250 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,250 INFO L263 TraceCheckUtils]: 14: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,251 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,251 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,252 INFO L263 TraceCheckUtils]: 17: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,253 INFO L280 TraceCheckUtils]: 18: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,253 INFO L280 TraceCheckUtils]: 19: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,254 INFO L263 TraceCheckUtils]: 20: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,254 INFO L280 TraceCheckUtils]: 21: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,255 INFO L280 TraceCheckUtils]: 22: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,255 INFO L263 TraceCheckUtils]: 23: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,256 INFO L280 TraceCheckUtils]: 24: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:59:31,257 INFO L280 TraceCheckUtils]: 25: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,257 INFO L280 TraceCheckUtils]: 26: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,259 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,260 INFO L280 TraceCheckUtils]: 28: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,260 INFO L280 TraceCheckUtils]: 29: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,262 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,263 INFO L280 TraceCheckUtils]: 31: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,263 INFO L280 TraceCheckUtils]: 32: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,265 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,266 INFO L280 TraceCheckUtils]: 34: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,267 INFO L280 TraceCheckUtils]: 35: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,268 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,269 INFO L280 TraceCheckUtils]: 37: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,270 INFO L280 TraceCheckUtils]: 38: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,272 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,273 INFO L280 TraceCheckUtils]: 40: Hoare triple {1716#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,273 INFO L280 TraceCheckUtils]: 41: Hoare triple {1716#(<= 5 |id_#in~x|)} assume true; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,275 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1716#(<= 5 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:59:31,276 INFO L280 TraceCheckUtils]: 43: Hoare triple {1687#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:59:31,277 INFO L280 TraceCheckUtils]: 44: Hoare triple {1687#(<= 6 |id_#in~x|)} assume true; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:59:31,279 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1687#(<= 6 |id_#in~x|)} {1611#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #30#return; {1608#false} is VALID [2020-07-10 14:59:31,279 INFO L280 TraceCheckUtils]: 46: Hoare triple {1608#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {1608#false} is VALID [2020-07-10 14:59:31,279 INFO L280 TraceCheckUtils]: 47: Hoare triple {1608#false} assume 5 != ~result~0; {1608#false} is VALID [2020-07-10 14:59:31,279 INFO L280 TraceCheckUtils]: 48: Hoare triple {1608#false} assume !false; {1608#false} is VALID [2020-07-10 14:59:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-07-10 14:59:31,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342074854] [2020-07-10 14:59:31,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521049181] [2020-07-10 14:59:31,284 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-10 14:59:31,333 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-10 14:59:31,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:59:31,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-10 14:59:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:59:31,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:59:31,550 INFO L263 TraceCheckUtils]: 0: Hoare triple {1607#true} call ULTIMATE.init(); {1607#true} is VALID [2020-07-10 14:59:31,551 INFO L280 TraceCheckUtils]: 1: Hoare triple {1607#true} assume true; {1607#true} is VALID [2020-07-10 14:59:31,551 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1607#true} {1607#true} #26#return; {1607#true} is VALID [2020-07-10 14:59:31,551 INFO L263 TraceCheckUtils]: 3: Hoare triple {1607#true} call #t~ret2 := main(); {1607#true} is VALID [2020-07-10 14:59:31,552 INFO L280 TraceCheckUtils]: 4: Hoare triple {1607#true} ~input~0 := 5; {1789#(<= main_~input~0 5)} is VALID [2020-07-10 14:59:31,552 INFO L263 TraceCheckUtils]: 5: Hoare triple {1789#(<= main_~input~0 5)} call #t~ret1 := id(~input~0); {1607#true} is VALID [2020-07-10 14:59:31,552 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,553 INFO L280 TraceCheckUtils]: 7: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,553 INFO L263 TraceCheckUtils]: 8: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,554 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,554 INFO L280 TraceCheckUtils]: 10: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,555 INFO L263 TraceCheckUtils]: 11: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,555 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,556 INFO L280 TraceCheckUtils]: 13: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,556 INFO L263 TraceCheckUtils]: 14: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,558 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,558 INFO L280 TraceCheckUtils]: 16: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,559 INFO L263 TraceCheckUtils]: 17: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,559 INFO L280 TraceCheckUtils]: 18: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,560 INFO L280 TraceCheckUtils]: 19: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,560 INFO L263 TraceCheckUtils]: 20: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,560 INFO L280 TraceCheckUtils]: 21: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,561 INFO L280 TraceCheckUtils]: 22: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,561 INFO L263 TraceCheckUtils]: 23: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-10 14:59:31,563 INFO L280 TraceCheckUtils]: 24: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:59:31,563 INFO L280 TraceCheckUtils]: 25: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume 0 == ~x;#res := 0; {1854#(<= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,564 INFO L280 TraceCheckUtils]: 26: Hoare triple {1854#(<= 0 |id_#in~x|)} assume true; {1854#(<= 0 |id_#in~x|)} is VALID [2020-07-10 14:59:31,566 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1854#(<= 0 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,567 INFO L280 TraceCheckUtils]: 28: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,567 INFO L280 TraceCheckUtils]: 29: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:59:31,569 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,569 INFO L280 TraceCheckUtils]: 31: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,570 INFO L280 TraceCheckUtils]: 32: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:59:31,572 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,572 INFO L280 TraceCheckUtils]: 34: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,573 INFO L280 TraceCheckUtils]: 35: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:59:31,574 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,575 INFO L280 TraceCheckUtils]: 37: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,575 INFO L280 TraceCheckUtils]: 38: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:59:31,577 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,577 INFO L280 TraceCheckUtils]: 40: Hoare triple {1716#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,578 INFO L280 TraceCheckUtils]: 41: Hoare triple {1716#(<= 5 |id_#in~x|)} assume true; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:59:31,579 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1716#(<= 5 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:59:31,580 INFO L280 TraceCheckUtils]: 43: Hoare triple {1687#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:59:31,580 INFO L280 TraceCheckUtils]: 44: Hoare triple {1687#(<= 6 |id_#in~x|)} assume true; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:59:31,582 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1687#(<= 6 |id_#in~x|)} {1789#(<= main_~input~0 5)} #30#return; {1608#false} is VALID [2020-07-10 14:59:31,582 INFO L280 TraceCheckUtils]: 46: Hoare triple {1608#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {1608#false} is VALID [2020-07-10 14:59:31,582 INFO L280 TraceCheckUtils]: 47: Hoare triple {1608#false} assume 5 != ~result~0; {1608#false} is VALID [2020-07-10 14:59:31,582 INFO L280 TraceCheckUtils]: 48: Hoare triple {1608#false} assume !false; {1608#false} is VALID [2020-07-10 14:59:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-07-10 14:59:31,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 14:59:31,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 14 [2020-07-10 14:59:31,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755161161] [2020-07-10 14:59:31,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-07-10 14:59:31,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:59:31,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 14:59:31,628 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-10 14:59:31,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 14:59:31,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:59:31,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 14:59:31,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-07-10 14:59:31,629 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-07-10 14:59:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:31,979 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-10 14:59:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 14:59:31,980 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-07-10 14:59:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:59:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 14:59:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2020-07-10 14:59:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 14:59:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2020-07-10 14:59:31,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 34 transitions. [2020-07-10 14:59:32,047 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-10 14:59:32,047 INFO L225 Difference]: With dead ends: 33 [2020-07-10 14:59:32,048 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:59:32,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2020-07-10 14:59:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:59:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:59:32,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:59:32,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:59:32,050 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:59:32,050 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:59:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:32,051 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:59:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:59:32,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:32,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:32,051 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:59:32,052 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:59:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:59:32,052 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:59:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:59:32,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:32,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:59:32,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:59:32,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:59:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:59:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:59:32,053 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2020-07-10 14:59:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:59:32,063 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:59:32,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 14:59:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:59:32,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:59:32,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:59:32,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:59:32,323 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:59:32,323 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:59:32,323 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:59:32,323 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:59:32,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:59:32,324 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:59:32,324 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2020-07-10 14:59:32,324 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-07-10 14:59:32,324 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 9 15) no Hoare annotation was computed. [2020-07-10 14:59:32,324 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-10 14:59:32,325 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-07-10 14:59:32,325 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-07-10 14:59:32,325 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-10 14:59:32,325 INFO L268 CegarLoopResult]: For program point L12-2(lines 9 15) no Hoare annotation was computed. [2020-07-10 14:59:32,325 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2020-07-10 14:59:32,325 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2020-07-10 14:59:32,325 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-07-10 14:59:32,325 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-10 14:59:32,326 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 14:59:32,326 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-10 14:59:32,330 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:59:32,331 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 14:59:32,331 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:59:32,331 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:59:32,331 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-10 14:59:32,331 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 14:59:32,331 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 14:59:32,331 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:59:32,331 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-10 14:59:32,331 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-10 14:59:32,331 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-10 14:59:32,331 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 14:59:32,331 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 14:59:32,332 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-10 14:59:32,332 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-10 14:59:32,332 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-10 14:59:32,332 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 14:59:32,332 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 14:59:32,332 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-10 14:59:32,332 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:59:32,332 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 14:59:32,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:59:32 BoogieIcfgContainer [2020-07-10 14:59:32,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:59:32,337 INFO L168 Benchmark]: Toolchain (without parser) took 8691.14 ms. Allocated memory was 139.5 MB in the beginning and 300.4 MB in the end (delta: 161.0 MB). Free memory was 104.2 MB in the beginning and 265.1 MB in the end (delta: -160.8 MB). Peak memory consumption was 141.2 kB. Max. memory is 7.1 GB. [2020-07-10 14:59:32,338 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 14:59:32,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.37 ms. Allocated memory is still 139.5 MB. Free memory was 104.0 MB in the beginning and 94.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-10 14:59:32,339 INFO L168 Benchmark]: Boogie Preprocessor took 26.14 ms. Allocated memory is still 139.5 MB. Free memory was 94.8 MB in the beginning and 93.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:59:32,340 INFO L168 Benchmark]: RCFGBuilder took 366.41 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 93.3 MB in the beginning and 167.4 MB in the end (delta: -74.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:59:32,340 INFO L168 Benchmark]: TraceAbstraction took 8045.66 ms. Allocated memory was 202.4 MB in the beginning and 300.4 MB in the end (delta: 98.0 MB). Free memory was 167.4 MB in the beginning and 265.1 MB in the end (delta: -97.6 MB). Peak memory consumption was 396.5 kB. Max. memory is 7.1 GB. [2020-07-10 14:59:32,343 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 246.37 ms. Allocated memory is still 139.5 MB. Free memory was 104.0 MB in the beginning and 94.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.14 ms. Allocated memory is still 139.5 MB. Free memory was 94.8 MB in the beginning and 93.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 366.41 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 93.3 MB in the beginning and 167.4 MB in the end (delta: -74.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8045.66 ms. Allocated memory was 202.4 MB in the beginning and 300.4 MB in the end (delta: 98.0 MB). Free memory was 167.4 MB in the beginning and 265.1 MB in the end (delta: -97.6 MB). Peak memory consumption was 396.5 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: 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 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.9s, OverallIterations: 7, TraceHistogramMax: 7, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 115 SDtfs, 78 SDslu, 549 SDs, 0 SdLazy, 276 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 261 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 15 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 421 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 38256 SizeOfPredicates, 27 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 396/588 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...