./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i5_o5-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i5_o5-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e05793781d8e05fe8376a30b6751438f3b1a9d08 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 19:12:04,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:12:04,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:12:04,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:12:04,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:12:04,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:12:04,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:12:04,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:12:04,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:12:04,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:12:04,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:12:04,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:12:04,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:12:04,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:12:04,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:12:04,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:12:04,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:12:04,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:12:04,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:12:04,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:12:04,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:12:04,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:12:04,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:12:04,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:12:04,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:12:04,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:12:04,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:12:04,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:12:04,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:12:04,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:12:04,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:12:04,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:12:04,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:12:04,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:12:04,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:12:04,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:12:04,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:12:04,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:12:04,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:12:04,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:12:04,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:12:04,618 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 19:12:04,633 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:12:04,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:12:04,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:12:04,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:12:04,636 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:12:04,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:12:04,636 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:12:04,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 19:12:04,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:12:04,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:12:04,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:12:04,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:12:04,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:12:04,638 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:12:04,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:12:04,639 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:12:04,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:12:04,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:12:04,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:12:04,640 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:12:04,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:12:04,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:12:04,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:12:04,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:12:04,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:12:04,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 19:12:04,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 19:12:04,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:12:04,642 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:12:04,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e05793781d8e05fe8376a30b6751438f3b1a9d08 [2020-07-28 19:12:04,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:12:04,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:12:04,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:12:04,948 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:12:04,948 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:12:04,949 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i5_o5-2.c [2020-07-28 19:12:05,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36c4f2b8/326927975dbd4c23824a9dc9ecc28a40/FLAG23f8832a2 [2020-07-28 19:12:05,379 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:12:05,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i5_o5-2.c [2020-07-28 19:12:05,385 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36c4f2b8/326927975dbd4c23824a9dc9ecc28a40/FLAG23f8832a2 [2020-07-28 19:12:05,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36c4f2b8/326927975dbd4c23824a9dc9ecc28a40 [2020-07-28 19:12:05,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:12:05,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:12:05,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:12:05,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:12:05,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:12:05,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:12:05" (1/1) ... [2020-07-28 19:12:05,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77239e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05, skipping insertion in model container [2020-07-28 19:12:05,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:12:05" (1/1) ... [2020-07-28 19:12:05,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:12:05,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:12:05,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:12:05,595 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:12:05,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:12:05,624 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:12:05,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05 WrapperNode [2020-07-28 19:12:05,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:12:05,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:12:05,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:12:05,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:12:05,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05" (1/1) ... [2020-07-28 19:12:05,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05" (1/1) ... [2020-07-28 19:12:05,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:12:05,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:12:05,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:12:05,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:12:05,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05" (1/1) ... [2020-07-28 19:12:05,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05" (1/1) ... [2020-07-28 19:12:05,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05" (1/1) ... [2020-07-28 19:12:05,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05" (1/1) ... [2020-07-28 19:12:05,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05" (1/1) ... [2020-07-28 19:12:05,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05" (1/1) ... [2020-07-28 19:12:05,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05" (1/1) ... [2020-07-28 19:12:05,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:12:05,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:12:05,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:12:05,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:12:05,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05" (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-28 19:12:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:12:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:12:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-28 19:12:05,813 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-28 19:12:06,079 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:12:06,080 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 19:12:06,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:12:06 BoogieIcfgContainer [2020-07-28 19:12:06,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:12:06,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:12:06,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:12:06,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:12:06,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:12:05" (1/3) ... [2020-07-28 19:12:06,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b202c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:12:06, skipping insertion in model container [2020-07-28 19:12:06,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:12:05" (2/3) ... [2020-07-28 19:12:06,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b202c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:12:06, skipping insertion in model container [2020-07-28 19:12:06,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:12:06" (3/3) ... [2020-07-28 19:12:06,095 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i5_o5-2.c [2020-07-28 19:12:06,107 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:12:06,116 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:12:06,134 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:12:06,159 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:12:06,159 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:12:06,159 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:12:06,160 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:12:06,160 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:12:06,160 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:12:06,160 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:12:06,160 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:12:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-07-28 19:12:06,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 19:12:06,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:12:06,197 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:12:06,197 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:12:06,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:12:06,204 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2020-07-28 19:12:06,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:12:06,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181977454] [2020-07-28 19:12:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:12:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:06,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:12:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:06,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#true} ~x := #in~x; {25#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:06,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {26#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:06,472 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#(= 0 |id_#in~x|)} assume true; {26#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:06,474 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {26#(= 0 |id_#in~x|)} {20#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {19#false} is VALID [2020-07-28 19:12:06,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {20#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:12:06,479 INFO L263 TraceCheckUtils]: 1: Hoare triple {20#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret1 := id(main_~input~0); {18#true} is VALID [2020-07-28 19:12:06,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {18#true} ~x := #in~x; {25#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:06,482 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {26#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:06,483 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#(= 0 |id_#in~x|)} assume true; {26#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:06,487 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {26#(= 0 |id_#in~x|)} {20#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {19#false} is VALID [2020-07-28 19:12:06,488 INFO L280 TraceCheckUtils]: 6: Hoare triple {19#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {19#false} is VALID [2020-07-28 19:12:06,489 INFO L280 TraceCheckUtils]: 7: Hoare triple {19#false} assume 5 != main_~result~0; {19#false} is VALID [2020-07-28 19:12:06,489 INFO L280 TraceCheckUtils]: 8: Hoare triple {19#false} assume !false; {19#false} is VALID [2020-07-28 19:12:06,490 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-28 19:12:06,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181977454] [2020-07-28 19:12:06,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:12:06,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 19:12:06,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111193800] [2020-07-28 19:12:06,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 19:12:06,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:12:06,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 19:12:06,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:12:06,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 19:12:06,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:12:06,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 19:12:06,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:12:06,550 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2020-07-28 19:12:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:06,724 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-07-28 19:12:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:12:06,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 19:12:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:12:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:12:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 19:12:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:12:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 19:12:06,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-28 19:12:06,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:12:06,810 INFO L225 Difference]: With dead ends: 24 [2020-07-28 19:12:06,811 INFO L226 Difference]: Without dead ends: 14 [2020-07-28 19:12:06,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-28 19:12:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-28 19:12:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-28 19:12:06,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:12:06,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-28 19:12:06,860 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 19:12:06,861 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 19:12:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:06,867 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-28 19:12:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 19:12:06,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:06,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:06,869 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 19:12:06,869 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 19:12:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:06,874 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-28 19:12:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 19:12:06,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:06,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:06,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:12:06,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:12:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 19:12:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-28 19:12:06,886 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2020-07-28 19:12:06,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:12:06,889 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-28 19:12:06,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 19:12:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 19:12:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 19:12:06,891 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:12:06,891 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:12:06,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 19:12:06,892 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:12:06,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:12:06,895 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2020-07-28 19:12:06,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:12:06,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607870313] [2020-07-28 19:12:06,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:12:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:07,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:12:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:07,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:07,098 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#true} ~x := #in~x; {116#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:07,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {116#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {122#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:07,100 INFO L280 TraceCheckUtils]: 2: Hoare triple {122#(= 0 |id_#in~x|)} assume true; {122#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:07,102 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {122#(= 0 |id_#in~x|)} {116#(= |id_#in~x| id_~x)} #26#return; {121#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:07,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#true} ~x := #in~x; {116#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:07,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {116#(= |id_#in~x| id_~x)} assume !(0 == ~x); {116#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:07,105 INFO L263 TraceCheckUtils]: 2: Hoare triple {116#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {103#true} is VALID [2020-07-28 19:12:07,106 INFO L280 TraceCheckUtils]: 3: Hoare triple {103#true} ~x := #in~x; {116#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:07,107 INFO L280 TraceCheckUtils]: 4: Hoare triple {116#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {122#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:07,108 INFO L280 TraceCheckUtils]: 5: Hoare triple {122#(= 0 |id_#in~x|)} assume true; {122#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:07,110 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {122#(= 0 |id_#in~x|)} {116#(= |id_#in~x| id_~x)} #26#return; {121#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:07,111 INFO L280 TraceCheckUtils]: 7: Hoare triple {121#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {121#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:07,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {121#(<= |id_#in~x| 1)} assume true; {121#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:07,114 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {121#(<= |id_#in~x| 1)} {105#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {104#false} is VALID [2020-07-28 19:12:07,116 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {105#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:12:07,116 INFO L263 TraceCheckUtils]: 1: Hoare triple {105#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret1 := id(main_~input~0); {103#true} is VALID [2020-07-28 19:12:07,117 INFO L280 TraceCheckUtils]: 2: Hoare triple {103#true} ~x := #in~x; {116#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:07,118 INFO L280 TraceCheckUtils]: 3: Hoare triple {116#(= |id_#in~x| id_~x)} assume !(0 == ~x); {116#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:07,119 INFO L263 TraceCheckUtils]: 4: Hoare triple {116#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {103#true} is VALID [2020-07-28 19:12:07,120 INFO L280 TraceCheckUtils]: 5: Hoare triple {103#true} ~x := #in~x; {116#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:07,122 INFO L280 TraceCheckUtils]: 6: Hoare triple {116#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {122#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:07,123 INFO L280 TraceCheckUtils]: 7: Hoare triple {122#(= 0 |id_#in~x|)} assume true; {122#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:07,125 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {122#(= 0 |id_#in~x|)} {116#(= |id_#in~x| id_~x)} #26#return; {121#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:07,126 INFO L280 TraceCheckUtils]: 9: Hoare triple {121#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {121#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:07,127 INFO L280 TraceCheckUtils]: 10: Hoare triple {121#(<= |id_#in~x| 1)} assume true; {121#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:07,129 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {121#(<= |id_#in~x| 1)} {105#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {104#false} is VALID [2020-07-28 19:12:07,129 INFO L280 TraceCheckUtils]: 12: Hoare triple {104#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {104#false} is VALID [2020-07-28 19:12:07,130 INFO L280 TraceCheckUtils]: 13: Hoare triple {104#false} assume 5 != main_~result~0; {104#false} is VALID [2020-07-28 19:12:07,130 INFO L280 TraceCheckUtils]: 14: Hoare triple {104#false} assume !false; {104#false} is VALID [2020-07-28 19:12:07,135 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-28 19:12:07,135 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607870313] [2020-07-28 19:12:07,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587662152] [2020-07-28 19:12:07,136 INFO L95 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-28 19:12:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:07,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 19:12:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:07,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:12:07,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {105#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:12:07,506 INFO L263 TraceCheckUtils]: 1: Hoare triple {105#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret1 := id(main_~input~0); {103#true} is VALID [2020-07-28 19:12:07,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {103#true} ~x := #in~x; {132#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:07,509 INFO L280 TraceCheckUtils]: 3: Hoare triple {132#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {132#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:07,509 INFO L263 TraceCheckUtils]: 4: Hoare triple {132#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {103#true} is VALID [2020-07-28 19:12:07,510 INFO L280 TraceCheckUtils]: 5: Hoare triple {103#true} ~x := #in~x; {132#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:07,511 INFO L280 TraceCheckUtils]: 6: Hoare triple {132#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {145#(<= |id_#in~x| 0)} is VALID [2020-07-28 19:12:07,512 INFO L280 TraceCheckUtils]: 7: Hoare triple {145#(<= |id_#in~x| 0)} assume true; {145#(<= |id_#in~x| 0)} is VALID [2020-07-28 19:12:07,515 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {145#(<= |id_#in~x| 0)} {132#(<= |id_#in~x| id_~x)} #26#return; {121#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:07,516 INFO L280 TraceCheckUtils]: 9: Hoare triple {121#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {121#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:07,517 INFO L280 TraceCheckUtils]: 10: Hoare triple {121#(<= |id_#in~x| 1)} assume true; {121#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:07,519 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {121#(<= |id_#in~x| 1)} {105#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {104#false} is VALID [2020-07-28 19:12:07,519 INFO L280 TraceCheckUtils]: 12: Hoare triple {104#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {104#false} is VALID [2020-07-28 19:12:07,520 INFO L280 TraceCheckUtils]: 13: Hoare triple {104#false} assume 5 != main_~result~0; {104#false} is VALID [2020-07-28 19:12:07,520 INFO L280 TraceCheckUtils]: 14: Hoare triple {104#false} assume !false; {104#false} is VALID [2020-07-28 19:12:07,522 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-28 19:12:07,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:12:07,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-28 19:12:07,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145877763] [2020-07-28 19:12:07,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-28 19:12:07,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:12:07,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 19:12:07,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:12:07,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 19:12:07,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:12:07,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 19:12:07,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-28 19:12:07,561 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 8 states. [2020-07-28 19:12:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:07,720 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 19:12:07,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 19:12:07,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-28 19:12:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:12:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 19:12:07,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-28 19:12:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 19:12:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-28 19:12:07,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2020-07-28 19:12:07,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:12:07,769 INFO L225 Difference]: With dead ends: 21 [2020-07-28 19:12:07,769 INFO L226 Difference]: Without dead ends: 17 [2020-07-28 19:12:07,770 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:12:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-28 19:12:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-28 19:12:07,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:12:07,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-28 19:12:07,780 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-28 19:12:07,780 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-28 19:12:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:07,783 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 19:12:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 19:12:07,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:07,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:07,785 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-28 19:12:07,785 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-28 19:12:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:07,788 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 19:12:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 19:12:07,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:07,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:07,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:12:07,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:12:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 19:12:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-07-28 19:12:07,792 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2020-07-28 19:12:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:12:07,793 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-07-28 19:12:07,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 19:12:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 19:12:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 19:12:07,794 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:12:07,795 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:12:08,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-28 19:12:08,009 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:12:08,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:12:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2020-07-28 19:12:08,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:12:08,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358423153] [2020-07-28 19:12:08,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:12:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:08,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:12:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:08,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:08,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:08,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {251#true} ~x := #in~x; {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {270#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {287#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:08,201 INFO L280 TraceCheckUtils]: 2: Hoare triple {287#(= 0 |id_#in~x|)} assume true; {287#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:08,202 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {287#(= 0 |id_#in~x|)} {270#(= |id_#in~x| id_~x)} #26#return; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {251#true} ~x := #in~x; {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {270#(= |id_#in~x| id_~x)} assume !(0 == ~x); {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,205 INFO L263 TraceCheckUtils]: 2: Hoare triple {270#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {251#true} is VALID [2020-07-28 19:12:08,206 INFO L280 TraceCheckUtils]: 3: Hoare triple {251#true} ~x := #in~x; {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,207 INFO L280 TraceCheckUtils]: 4: Hoare triple {270#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {287#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:08,208 INFO L280 TraceCheckUtils]: 5: Hoare triple {287#(= 0 |id_#in~x|)} assume true; {287#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:08,209 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {287#(= 0 |id_#in~x|)} {270#(= |id_#in~x| id_~x)} #26#return; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,210 INFO L280 TraceCheckUtils]: 7: Hoare triple {286#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,211 INFO L280 TraceCheckUtils]: 8: Hoare triple {286#(<= |id_#in~x| 1)} assume true; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,213 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {286#(<= |id_#in~x| 1)} {270#(= |id_#in~x| id_~x)} #26#return; {281#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:08,215 INFO L280 TraceCheckUtils]: 0: Hoare triple {251#true} ~x := #in~x; {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {270#(= |id_#in~x| id_~x)} assume !(0 == ~x); {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,216 INFO L263 TraceCheckUtils]: 2: Hoare triple {270#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {251#true} is VALID [2020-07-28 19:12:08,217 INFO L280 TraceCheckUtils]: 3: Hoare triple {251#true} ~x := #in~x; {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,218 INFO L280 TraceCheckUtils]: 4: Hoare triple {270#(= |id_#in~x| id_~x)} assume !(0 == ~x); {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,218 INFO L263 TraceCheckUtils]: 5: Hoare triple {270#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {251#true} is VALID [2020-07-28 19:12:08,219 INFO L280 TraceCheckUtils]: 6: Hoare triple {251#true} ~x := #in~x; {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {270#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {287#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:08,221 INFO L280 TraceCheckUtils]: 8: Hoare triple {287#(= 0 |id_#in~x|)} assume true; {287#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:08,223 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {287#(= 0 |id_#in~x|)} {270#(= |id_#in~x| id_~x)} #26#return; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,224 INFO L280 TraceCheckUtils]: 10: Hoare triple {286#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,224 INFO L280 TraceCheckUtils]: 11: Hoare triple {286#(<= |id_#in~x| 1)} assume true; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,226 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {286#(<= |id_#in~x| 1)} {270#(= |id_#in~x| id_~x)} #26#return; {281#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:08,227 INFO L280 TraceCheckUtils]: 13: Hoare triple {281#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {281#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:08,228 INFO L280 TraceCheckUtils]: 14: Hoare triple {281#(<= |id_#in~x| 2)} assume true; {281#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:08,230 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {281#(<= |id_#in~x| 2)} {253#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {252#false} is VALID [2020-07-28 19:12:08,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {251#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {253#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:12:08,232 INFO L263 TraceCheckUtils]: 1: Hoare triple {253#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret1 := id(main_~input~0); {251#true} is VALID [2020-07-28 19:12:08,233 INFO L280 TraceCheckUtils]: 2: Hoare triple {251#true} ~x := #in~x; {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,234 INFO L280 TraceCheckUtils]: 3: Hoare triple {270#(= |id_#in~x| id_~x)} assume !(0 == ~x); {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,235 INFO L263 TraceCheckUtils]: 4: Hoare triple {270#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {251#true} is VALID [2020-07-28 19:12:08,236 INFO L280 TraceCheckUtils]: 5: Hoare triple {251#true} ~x := #in~x; {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,237 INFO L280 TraceCheckUtils]: 6: Hoare triple {270#(= |id_#in~x| id_~x)} assume !(0 == ~x); {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,237 INFO L263 TraceCheckUtils]: 7: Hoare triple {270#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {251#true} is VALID [2020-07-28 19:12:08,238 INFO L280 TraceCheckUtils]: 8: Hoare triple {251#true} ~x := #in~x; {270#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,239 INFO L280 TraceCheckUtils]: 9: Hoare triple {270#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {287#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:08,240 INFO L280 TraceCheckUtils]: 10: Hoare triple {287#(= 0 |id_#in~x|)} assume true; {287#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:08,241 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {287#(= 0 |id_#in~x|)} {270#(= |id_#in~x| id_~x)} #26#return; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,242 INFO L280 TraceCheckUtils]: 12: Hoare triple {286#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,243 INFO L280 TraceCheckUtils]: 13: Hoare triple {286#(<= |id_#in~x| 1)} assume true; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,245 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {286#(<= |id_#in~x| 1)} {270#(= |id_#in~x| id_~x)} #26#return; {281#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:08,246 INFO L280 TraceCheckUtils]: 15: Hoare triple {281#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {281#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:08,247 INFO L280 TraceCheckUtils]: 16: Hoare triple {281#(<= |id_#in~x| 2)} assume true; {281#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:08,248 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {281#(<= |id_#in~x| 2)} {253#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {252#false} is VALID [2020-07-28 19:12:08,249 INFO L280 TraceCheckUtils]: 18: Hoare triple {252#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {252#false} is VALID [2020-07-28 19:12:08,249 INFO L280 TraceCheckUtils]: 19: Hoare triple {252#false} assume 5 != main_~result~0; {252#false} is VALID [2020-07-28 19:12:08,249 INFO L280 TraceCheckUtils]: 20: Hoare triple {252#false} assume !false; {252#false} is VALID [2020-07-28 19:12:08,250 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-28 19:12:08,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358423153] [2020-07-28 19:12:08,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040764331] [2020-07-28 19:12:08,252 INFO L93 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-28 19:12:08,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 19:12:08,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 19:12:08,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 19:12:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:08,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:12:08,575 INFO L280 TraceCheckUtils]: 0: Hoare triple {251#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {253#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:12:08,576 INFO L263 TraceCheckUtils]: 1: Hoare triple {253#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret1 := id(main_~input~0); {251#true} is VALID [2020-07-28 19:12:08,577 INFO L280 TraceCheckUtils]: 2: Hoare triple {251#true} ~x := #in~x; {297#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,577 INFO L280 TraceCheckUtils]: 3: Hoare triple {297#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {297#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,578 INFO L263 TraceCheckUtils]: 4: Hoare triple {297#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {251#true} is VALID [2020-07-28 19:12:08,579 INFO L280 TraceCheckUtils]: 5: Hoare triple {251#true} ~x := #in~x; {297#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,580 INFO L280 TraceCheckUtils]: 6: Hoare triple {297#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {297#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,580 INFO L263 TraceCheckUtils]: 7: Hoare triple {297#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {251#true} is VALID [2020-07-28 19:12:08,581 INFO L280 TraceCheckUtils]: 8: Hoare triple {251#true} ~x := #in~x; {297#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:08,582 INFO L280 TraceCheckUtils]: 9: Hoare triple {297#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {319#(<= |id_#in~x| 0)} is VALID [2020-07-28 19:12:08,583 INFO L280 TraceCheckUtils]: 10: Hoare triple {319#(<= |id_#in~x| 0)} assume true; {319#(<= |id_#in~x| 0)} is VALID [2020-07-28 19:12:08,584 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {319#(<= |id_#in~x| 0)} {297#(<= |id_#in~x| id_~x)} #26#return; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,585 INFO L280 TraceCheckUtils]: 12: Hoare triple {286#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,595 INFO L280 TraceCheckUtils]: 13: Hoare triple {286#(<= |id_#in~x| 1)} assume true; {286#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:08,601 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {286#(<= |id_#in~x| 1)} {297#(<= |id_#in~x| id_~x)} #26#return; {281#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:08,602 INFO L280 TraceCheckUtils]: 15: Hoare triple {281#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {281#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:08,603 INFO L280 TraceCheckUtils]: 16: Hoare triple {281#(<= |id_#in~x| 2)} assume true; {281#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:08,604 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {281#(<= |id_#in~x| 2)} {253#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {252#false} is VALID [2020-07-28 19:12:08,604 INFO L280 TraceCheckUtils]: 18: Hoare triple {252#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {252#false} is VALID [2020-07-28 19:12:08,605 INFO L280 TraceCheckUtils]: 19: Hoare triple {252#false} assume 5 != main_~result~0; {252#false} is VALID [2020-07-28 19:12:08,605 INFO L280 TraceCheckUtils]: 20: Hoare triple {252#false} assume !false; {252#false} is VALID [2020-07-28 19:12:08,606 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-28 19:12:08,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:12:08,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-28 19:12:08,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531312458] [2020-07-28 19:12:08,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-28 19:12:08,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:12:08,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 19:12:08,640 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-28 19:12:08,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 19:12:08,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:12:08,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 19:12:08,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-28 19:12:08,641 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2020-07-28 19:12:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:08,786 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-28 19:12:08,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 19:12:08,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-28 19:12:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:12:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:12:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2020-07-28 19:12:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:12:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2020-07-28 19:12:08,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 25 transitions. [2020-07-28 19:12:08,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:12:08,830 INFO L225 Difference]: With dead ends: 24 [2020-07-28 19:12:08,830 INFO L226 Difference]: Without dead ends: 20 [2020-07-28 19:12:08,831 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-07-28 19:12:08,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-28 19:12:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-28 19:12:08,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:12:08,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-28 19:12:08,838 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 19:12:08,839 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 19:12:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:08,842 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-28 19:12:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-28 19:12:08,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:08,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:08,843 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 19:12:08,843 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 19:12:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:08,846 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-28 19:12:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-28 19:12:08,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:08,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:08,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:12:08,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:12:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-28 19:12:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-28 19:12:08,851 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2020-07-28 19:12:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:12:08,851 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-28 19:12:08,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 19:12:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-28 19:12:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-28 19:12:08,853 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:12:08,853 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:12:09,068 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:12:09,070 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:12:09,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:12:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2020-07-28 19:12:09,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:12:09,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974681680] [2020-07-28 19:12:09,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:12:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:09,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:12:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:09,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:09,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:09,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:09,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {473#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {507#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:09,279 INFO L280 TraceCheckUtils]: 2: Hoare triple {507#(= 0 |id_#in~x|)} assume true; {507#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:09,280 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {507#(= 0 |id_#in~x|)} {473#(= |id_#in~x| id_~x)} #26#return; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {473#(= |id_#in~x| id_~x)} assume !(0 == ~x); {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,282 INFO L263 TraceCheckUtils]: 2: Hoare triple {473#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {448#true} is VALID [2020-07-28 19:12:09,283 INFO L280 TraceCheckUtils]: 3: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,284 INFO L280 TraceCheckUtils]: 4: Hoare triple {473#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {507#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:09,284 INFO L280 TraceCheckUtils]: 5: Hoare triple {507#(= 0 |id_#in~x|)} assume true; {507#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:09,286 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {507#(= 0 |id_#in~x|)} {473#(= |id_#in~x| id_~x)} #26#return; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,287 INFO L280 TraceCheckUtils]: 7: Hoare triple {506#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {506#(<= |id_#in~x| 1)} assume true; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,289 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {506#(<= |id_#in~x| 1)} {473#(= |id_#in~x| id_~x)} #26#return; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,290 INFO L280 TraceCheckUtils]: 0: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,291 INFO L280 TraceCheckUtils]: 1: Hoare triple {473#(= |id_#in~x| id_~x)} assume !(0 == ~x); {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,291 INFO L263 TraceCheckUtils]: 2: Hoare triple {473#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {448#true} is VALID [2020-07-28 19:12:09,292 INFO L280 TraceCheckUtils]: 3: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,292 INFO L280 TraceCheckUtils]: 4: Hoare triple {473#(= |id_#in~x| id_~x)} assume !(0 == ~x); {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,293 INFO L263 TraceCheckUtils]: 5: Hoare triple {473#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {448#true} is VALID [2020-07-28 19:12:09,293 INFO L280 TraceCheckUtils]: 6: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,295 INFO L280 TraceCheckUtils]: 7: Hoare triple {473#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {507#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:09,295 INFO L280 TraceCheckUtils]: 8: Hoare triple {507#(= 0 |id_#in~x|)} assume true; {507#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:09,296 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {507#(= 0 |id_#in~x|)} {473#(= |id_#in~x| id_~x)} #26#return; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,297 INFO L280 TraceCheckUtils]: 10: Hoare triple {506#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,298 INFO L280 TraceCheckUtils]: 11: Hoare triple {506#(<= |id_#in~x| 1)} assume true; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,299 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {506#(<= |id_#in~x| 1)} {473#(= |id_#in~x| id_~x)} #26#return; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,300 INFO L280 TraceCheckUtils]: 13: Hoare triple {501#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,300 INFO L280 TraceCheckUtils]: 14: Hoare triple {501#(<= |id_#in~x| 2)} assume true; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,304 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {501#(<= |id_#in~x| 2)} {473#(= |id_#in~x| id_~x)} #26#return; {490#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:09,305 INFO L280 TraceCheckUtils]: 0: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {473#(= |id_#in~x| id_~x)} assume !(0 == ~x); {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,306 INFO L263 TraceCheckUtils]: 2: Hoare triple {473#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {448#true} is VALID [2020-07-28 19:12:09,307 INFO L280 TraceCheckUtils]: 3: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,307 INFO L280 TraceCheckUtils]: 4: Hoare triple {473#(= |id_#in~x| id_~x)} assume !(0 == ~x); {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,307 INFO L263 TraceCheckUtils]: 5: Hoare triple {473#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {448#true} is VALID [2020-07-28 19:12:09,308 INFO L280 TraceCheckUtils]: 6: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,309 INFO L280 TraceCheckUtils]: 7: Hoare triple {473#(= |id_#in~x| id_~x)} assume !(0 == ~x); {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,310 INFO L263 TraceCheckUtils]: 8: Hoare triple {473#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {448#true} is VALID [2020-07-28 19:12:09,310 INFO L280 TraceCheckUtils]: 9: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,312 INFO L280 TraceCheckUtils]: 10: Hoare triple {473#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {507#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:09,315 INFO L280 TraceCheckUtils]: 11: Hoare triple {507#(= 0 |id_#in~x|)} assume true; {507#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:09,317 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {507#(= 0 |id_#in~x|)} {473#(= |id_#in~x| id_~x)} #26#return; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,321 INFO L280 TraceCheckUtils]: 13: Hoare triple {506#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,322 INFO L280 TraceCheckUtils]: 14: Hoare triple {506#(<= |id_#in~x| 1)} assume true; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,324 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {506#(<= |id_#in~x| 1)} {473#(= |id_#in~x| id_~x)} #26#return; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,325 INFO L280 TraceCheckUtils]: 16: Hoare triple {501#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,326 INFO L280 TraceCheckUtils]: 17: Hoare triple {501#(<= |id_#in~x| 2)} assume true; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,327 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {501#(<= |id_#in~x| 2)} {473#(= |id_#in~x| id_~x)} #26#return; {490#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:09,328 INFO L280 TraceCheckUtils]: 19: Hoare triple {490#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {490#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:09,329 INFO L280 TraceCheckUtils]: 20: Hoare triple {490#(<= |id_#in~x| 3)} assume true; {490#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:09,330 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {490#(<= |id_#in~x| 3)} {450#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {449#false} is VALID [2020-07-28 19:12:09,337 INFO L280 TraceCheckUtils]: 0: Hoare triple {448#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {450#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:12:09,338 INFO L263 TraceCheckUtils]: 1: Hoare triple {450#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret1 := id(main_~input~0); {448#true} is VALID [2020-07-28 19:12:09,339 INFO L280 TraceCheckUtils]: 2: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,342 INFO L280 TraceCheckUtils]: 3: Hoare triple {473#(= |id_#in~x| id_~x)} assume !(0 == ~x); {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,342 INFO L263 TraceCheckUtils]: 4: Hoare triple {473#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {448#true} is VALID [2020-07-28 19:12:09,344 INFO L280 TraceCheckUtils]: 5: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,346 INFO L280 TraceCheckUtils]: 6: Hoare triple {473#(= |id_#in~x| id_~x)} assume !(0 == ~x); {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,347 INFO L263 TraceCheckUtils]: 7: Hoare triple {473#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {448#true} is VALID [2020-07-28 19:12:09,349 INFO L280 TraceCheckUtils]: 8: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,350 INFO L280 TraceCheckUtils]: 9: Hoare triple {473#(= |id_#in~x| id_~x)} assume !(0 == ~x); {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,350 INFO L263 TraceCheckUtils]: 10: Hoare triple {473#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {448#true} is VALID [2020-07-28 19:12:09,359 INFO L280 TraceCheckUtils]: 11: Hoare triple {448#true} ~x := #in~x; {473#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,360 INFO L280 TraceCheckUtils]: 12: Hoare triple {473#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {507#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:09,361 INFO L280 TraceCheckUtils]: 13: Hoare triple {507#(= 0 |id_#in~x|)} assume true; {507#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:09,364 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {507#(= 0 |id_#in~x|)} {473#(= |id_#in~x| id_~x)} #26#return; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,365 INFO L280 TraceCheckUtils]: 15: Hoare triple {506#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,365 INFO L280 TraceCheckUtils]: 16: Hoare triple {506#(<= |id_#in~x| 1)} assume true; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,367 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {506#(<= |id_#in~x| 1)} {473#(= |id_#in~x| id_~x)} #26#return; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,368 INFO L280 TraceCheckUtils]: 18: Hoare triple {501#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,369 INFO L280 TraceCheckUtils]: 19: Hoare triple {501#(<= |id_#in~x| 2)} assume true; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,371 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {501#(<= |id_#in~x| 2)} {473#(= |id_#in~x| id_~x)} #26#return; {490#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:09,372 INFO L280 TraceCheckUtils]: 21: Hoare triple {490#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {490#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:09,373 INFO L280 TraceCheckUtils]: 22: Hoare triple {490#(<= |id_#in~x| 3)} assume true; {490#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:09,375 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {490#(<= |id_#in~x| 3)} {450#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {449#false} is VALID [2020-07-28 19:12:09,375 INFO L280 TraceCheckUtils]: 24: Hoare triple {449#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {449#false} is VALID [2020-07-28 19:12:09,376 INFO L280 TraceCheckUtils]: 25: Hoare triple {449#false} assume 5 != main_~result~0; {449#false} is VALID [2020-07-28 19:12:09,376 INFO L280 TraceCheckUtils]: 26: Hoare triple {449#false} assume !false; {449#false} is VALID [2020-07-28 19:12:09,378 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-28 19:12:09,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974681680] [2020-07-28 19:12:09,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454007216] [2020-07-28 19:12:09,380 INFO L93 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-28 19:12:09,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-28 19:12:09,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 19:12:09,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 19:12:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:09,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:12:09,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {448#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {450#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:12:09,779 INFO L263 TraceCheckUtils]: 1: Hoare triple {450#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret1 := id(main_~input~0); {448#true} is VALID [2020-07-28 19:12:09,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {448#true} ~x := #in~x; {517#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,781 INFO L280 TraceCheckUtils]: 3: Hoare triple {517#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {517#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,781 INFO L263 TraceCheckUtils]: 4: Hoare triple {517#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {448#true} is VALID [2020-07-28 19:12:09,782 INFO L280 TraceCheckUtils]: 5: Hoare triple {448#true} ~x := #in~x; {517#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,783 INFO L280 TraceCheckUtils]: 6: Hoare triple {517#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {517#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,783 INFO L263 TraceCheckUtils]: 7: Hoare triple {517#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {448#true} is VALID [2020-07-28 19:12:09,784 INFO L280 TraceCheckUtils]: 8: Hoare triple {448#true} ~x := #in~x; {517#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {517#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {517#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,785 INFO L263 TraceCheckUtils]: 10: Hoare triple {517#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {448#true} is VALID [2020-07-28 19:12:09,786 INFO L280 TraceCheckUtils]: 11: Hoare triple {448#true} ~x := #in~x; {517#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:09,787 INFO L280 TraceCheckUtils]: 12: Hoare triple {517#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {548#(<= |id_#in~x| 0)} is VALID [2020-07-28 19:12:09,787 INFO L280 TraceCheckUtils]: 13: Hoare triple {548#(<= |id_#in~x| 0)} assume true; {548#(<= |id_#in~x| 0)} is VALID [2020-07-28 19:12:09,789 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {548#(<= |id_#in~x| 0)} {517#(<= |id_#in~x| id_~x)} #26#return; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,790 INFO L280 TraceCheckUtils]: 15: Hoare triple {506#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,791 INFO L280 TraceCheckUtils]: 16: Hoare triple {506#(<= |id_#in~x| 1)} assume true; {506#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:09,792 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {506#(<= |id_#in~x| 1)} {517#(<= |id_#in~x| id_~x)} #26#return; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,793 INFO L280 TraceCheckUtils]: 18: Hoare triple {501#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,794 INFO L280 TraceCheckUtils]: 19: Hoare triple {501#(<= |id_#in~x| 2)} assume true; {501#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:09,795 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {501#(<= |id_#in~x| 2)} {517#(<= |id_#in~x| id_~x)} #26#return; {490#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:09,796 INFO L280 TraceCheckUtils]: 21: Hoare triple {490#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {490#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:09,796 INFO L280 TraceCheckUtils]: 22: Hoare triple {490#(<= |id_#in~x| 3)} assume true; {490#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:09,797 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {490#(<= |id_#in~x| 3)} {450#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {449#false} is VALID [2020-07-28 19:12:09,798 INFO L280 TraceCheckUtils]: 24: Hoare triple {449#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {449#false} is VALID [2020-07-28 19:12:09,798 INFO L280 TraceCheckUtils]: 25: Hoare triple {449#false} assume 5 != main_~result~0; {449#false} is VALID [2020-07-28 19:12:09,798 INFO L280 TraceCheckUtils]: 26: Hoare triple {449#false} assume !false; {449#false} is VALID [2020-07-28 19:12:09,799 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-28 19:12:09,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:12:09,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-28 19:12:09,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300789912] [2020-07-28 19:12:09,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-28 19:12:09,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:12:09,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 19:12:09,841 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-28 19:12:09,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 19:12:09,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:12:09,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 19:12:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:12:09,843 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 10 states. [2020-07-28 19:12:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:10,032 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-28 19:12:10,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 19:12:10,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-28 19:12:10,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:12:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:12:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2020-07-28 19:12:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:12:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2020-07-28 19:12:10,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 28 transitions. [2020-07-28 19:12:10,083 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-28 19:12:10,085 INFO L225 Difference]: With dead ends: 27 [2020-07-28 19:12:10,085 INFO L226 Difference]: Without dead ends: 23 [2020-07-28 19:12:10,086 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 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-28 19:12:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-28 19:12:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-28 19:12:10,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:12:10,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-28 19:12:10,097 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-28 19:12:10,097 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-28 19:12:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:10,102 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-28 19:12:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-28 19:12:10,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:10,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:10,103 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-28 19:12:10,103 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-28 19:12:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:10,114 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-28 19:12:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-28 19:12:10,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:10,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:10,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:12:10,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:12:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 19:12:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-28 19:12:10,121 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2020-07-28 19:12:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:12:10,121 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-28 19:12:10,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 19:12:10,122 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-28 19:12:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-28 19:12:10,125 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:12:10,125 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:12:10,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:12:10,340 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:12:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:12:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2020-07-28 19:12:10,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:12:10,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049753741] [2020-07-28 19:12:10,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:12:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:10,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:12:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:10,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:10,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:10,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:10,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:10,536 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,537 INFO L280 TraceCheckUtils]: 1: Hoare triple {731#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {788#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:10,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {788#(= 0 |id_#in~x|)} assume true; {788#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:10,539 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {788#(= 0 |id_#in~x|)} {731#(= |id_#in~x| id_~x)} #26#return; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,541 INFO L280 TraceCheckUtils]: 1: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,541 INFO L263 TraceCheckUtils]: 2: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,542 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,543 INFO L280 TraceCheckUtils]: 4: Hoare triple {731#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {788#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:10,543 INFO L280 TraceCheckUtils]: 5: Hoare triple {788#(= 0 |id_#in~x|)} assume true; {788#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:10,545 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {788#(= 0 |id_#in~x|)} {731#(= |id_#in~x| id_~x)} #26#return; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,545 INFO L280 TraceCheckUtils]: 7: Hoare triple {787#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,546 INFO L280 TraceCheckUtils]: 8: Hoare triple {787#(<= |id_#in~x| 1)} assume true; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,548 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {787#(<= |id_#in~x| 1)} {731#(= |id_#in~x| id_~x)} #26#return; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,549 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,550 INFO L263 TraceCheckUtils]: 2: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,550 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,551 INFO L280 TraceCheckUtils]: 4: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,551 INFO L263 TraceCheckUtils]: 5: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,552 INFO L280 TraceCheckUtils]: 6: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,553 INFO L280 TraceCheckUtils]: 7: Hoare triple {731#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {788#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:10,554 INFO L280 TraceCheckUtils]: 8: Hoare triple {788#(= 0 |id_#in~x|)} assume true; {788#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:10,555 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {788#(= 0 |id_#in~x|)} {731#(= |id_#in~x| id_~x)} #26#return; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,556 INFO L280 TraceCheckUtils]: 10: Hoare triple {787#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,556 INFO L280 TraceCheckUtils]: 11: Hoare triple {787#(<= |id_#in~x| 1)} assume true; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,558 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {787#(<= |id_#in~x| 1)} {731#(= |id_#in~x| id_~x)} #26#return; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,558 INFO L280 TraceCheckUtils]: 13: Hoare triple {782#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,559 INFO L280 TraceCheckUtils]: 14: Hoare triple {782#(<= |id_#in~x| 2)} assume true; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,560 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {782#(<= |id_#in~x| 2)} {731#(= |id_#in~x| id_~x)} #26#return; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:10,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,563 INFO L263 TraceCheckUtils]: 2: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,563 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,564 INFO L280 TraceCheckUtils]: 4: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,564 INFO L263 TraceCheckUtils]: 5: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,565 INFO L280 TraceCheckUtils]: 6: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,566 INFO L280 TraceCheckUtils]: 7: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,566 INFO L263 TraceCheckUtils]: 8: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,567 INFO L280 TraceCheckUtils]: 9: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,568 INFO L280 TraceCheckUtils]: 10: Hoare triple {731#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {788#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:10,568 INFO L280 TraceCheckUtils]: 11: Hoare triple {788#(= 0 |id_#in~x|)} assume true; {788#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:10,570 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {788#(= 0 |id_#in~x|)} {731#(= |id_#in~x| id_~x)} #26#return; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,570 INFO L280 TraceCheckUtils]: 13: Hoare triple {787#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,571 INFO L280 TraceCheckUtils]: 14: Hoare triple {787#(<= |id_#in~x| 1)} assume true; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,572 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {787#(<= |id_#in~x| 1)} {731#(= |id_#in~x| id_~x)} #26#return; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,573 INFO L280 TraceCheckUtils]: 16: Hoare triple {782#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,574 INFO L280 TraceCheckUtils]: 17: Hoare triple {782#(<= |id_#in~x| 2)} assume true; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,575 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {782#(<= |id_#in~x| 2)} {731#(= |id_#in~x| id_~x)} #26#return; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:10,576 INFO L280 TraceCheckUtils]: 19: Hoare triple {771#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:10,577 INFO L280 TraceCheckUtils]: 20: Hoare triple {771#(<= |id_#in~x| 3)} assume true; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:10,578 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {771#(<= |id_#in~x| 3)} {731#(= |id_#in~x| id_~x)} #26#return; {754#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:12:10,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,580 INFO L280 TraceCheckUtils]: 1: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,581 INFO L263 TraceCheckUtils]: 2: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,581 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,582 INFO L280 TraceCheckUtils]: 4: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,582 INFO L263 TraceCheckUtils]: 5: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,583 INFO L280 TraceCheckUtils]: 6: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,584 INFO L280 TraceCheckUtils]: 7: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,584 INFO L263 TraceCheckUtils]: 8: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,585 INFO L280 TraceCheckUtils]: 9: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,585 INFO L280 TraceCheckUtils]: 10: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,586 INFO L263 TraceCheckUtils]: 11: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,586 INFO L280 TraceCheckUtils]: 12: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,587 INFO L280 TraceCheckUtils]: 13: Hoare triple {731#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {788#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:10,588 INFO L280 TraceCheckUtils]: 14: Hoare triple {788#(= 0 |id_#in~x|)} assume true; {788#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:10,589 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {788#(= 0 |id_#in~x|)} {731#(= |id_#in~x| id_~x)} #26#return; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,590 INFO L280 TraceCheckUtils]: 16: Hoare triple {787#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,590 INFO L280 TraceCheckUtils]: 17: Hoare triple {787#(<= |id_#in~x| 1)} assume true; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,592 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {787#(<= |id_#in~x| 1)} {731#(= |id_#in~x| id_~x)} #26#return; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,592 INFO L280 TraceCheckUtils]: 19: Hoare triple {782#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,593 INFO L280 TraceCheckUtils]: 20: Hoare triple {782#(<= |id_#in~x| 2)} assume true; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,594 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {782#(<= |id_#in~x| 2)} {731#(= |id_#in~x| id_~x)} #26#return; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:10,595 INFO L280 TraceCheckUtils]: 22: Hoare triple {771#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:10,596 INFO L280 TraceCheckUtils]: 23: Hoare triple {771#(<= |id_#in~x| 3)} assume true; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:10,597 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {771#(<= |id_#in~x| 3)} {731#(= |id_#in~x| id_~x)} #26#return; {754#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:12:10,598 INFO L280 TraceCheckUtils]: 25: Hoare triple {754#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {754#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:12:10,598 INFO L280 TraceCheckUtils]: 26: Hoare triple {754#(<= |id_#in~x| 4)} assume true; {754#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:12:10,599 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {754#(<= |id_#in~x| 4)} {702#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {701#false} is VALID [2020-07-28 19:12:10,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {702#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:12:10,601 INFO L263 TraceCheckUtils]: 1: Hoare triple {702#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret1 := id(main_~input~0); {700#true} is VALID [2020-07-28 19:12:10,602 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,603 INFO L280 TraceCheckUtils]: 3: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,603 INFO L263 TraceCheckUtils]: 4: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,604 INFO L280 TraceCheckUtils]: 5: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,604 INFO L280 TraceCheckUtils]: 6: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,605 INFO L263 TraceCheckUtils]: 7: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,605 INFO L280 TraceCheckUtils]: 8: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,606 INFO L280 TraceCheckUtils]: 9: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,606 INFO L263 TraceCheckUtils]: 10: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,607 INFO L280 TraceCheckUtils]: 11: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,607 INFO L280 TraceCheckUtils]: 12: Hoare triple {731#(= |id_#in~x| id_~x)} assume !(0 == ~x); {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,608 INFO L263 TraceCheckUtils]: 13: Hoare triple {731#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:10,608 INFO L280 TraceCheckUtils]: 14: Hoare triple {700#true} ~x := #in~x; {731#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:10,609 INFO L280 TraceCheckUtils]: 15: Hoare triple {731#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {788#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:10,610 INFO L280 TraceCheckUtils]: 16: Hoare triple {788#(= 0 |id_#in~x|)} assume true; {788#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:10,611 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {788#(= 0 |id_#in~x|)} {731#(= |id_#in~x| id_~x)} #26#return; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,612 INFO L280 TraceCheckUtils]: 18: Hoare triple {787#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,612 INFO L280 TraceCheckUtils]: 19: Hoare triple {787#(<= |id_#in~x| 1)} assume true; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:10,613 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {787#(<= |id_#in~x| 1)} {731#(= |id_#in~x| id_~x)} #26#return; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,614 INFO L280 TraceCheckUtils]: 21: Hoare triple {782#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,615 INFO L280 TraceCheckUtils]: 22: Hoare triple {782#(<= |id_#in~x| 2)} assume true; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:10,616 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {782#(<= |id_#in~x| 2)} {731#(= |id_#in~x| id_~x)} #26#return; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:10,617 INFO L280 TraceCheckUtils]: 24: Hoare triple {771#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:10,618 INFO L280 TraceCheckUtils]: 25: Hoare triple {771#(<= |id_#in~x| 3)} assume true; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:10,619 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {771#(<= |id_#in~x| 3)} {731#(= |id_#in~x| id_~x)} #26#return; {754#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:12:10,620 INFO L280 TraceCheckUtils]: 27: Hoare triple {754#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {754#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:12:10,620 INFO L280 TraceCheckUtils]: 28: Hoare triple {754#(<= |id_#in~x| 4)} assume true; {754#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:12:10,621 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {754#(<= |id_#in~x| 4)} {702#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {701#false} is VALID [2020-07-28 19:12:10,622 INFO L280 TraceCheckUtils]: 30: Hoare triple {701#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {701#false} is VALID [2020-07-28 19:12:10,622 INFO L280 TraceCheckUtils]: 31: Hoare triple {701#false} assume 5 != main_~result~0; {701#false} is VALID [2020-07-28 19:12:10,622 INFO L280 TraceCheckUtils]: 32: Hoare triple {701#false} assume !false; {701#false} is VALID [2020-07-28 19:12:10,623 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-28 19:12:10,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049753741] [2020-07-28 19:12:10,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774932856] [2020-07-28 19:12:10,624 INFO L93 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-28 19:12:10,646 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-28 19:12:10,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 19:12:10,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-28 19:12:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:10,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:12:11,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {702#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:12:11,023 INFO L263 TraceCheckUtils]: 1: Hoare triple {702#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret1 := id(main_~input~0); {700#true} is VALID [2020-07-28 19:12:11,023 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} ~x := #in~x; {798#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:11,024 INFO L280 TraceCheckUtils]: 3: Hoare triple {798#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {798#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:11,024 INFO L263 TraceCheckUtils]: 4: Hoare triple {798#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:11,025 INFO L280 TraceCheckUtils]: 5: Hoare triple {700#true} ~x := #in~x; {798#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:11,025 INFO L280 TraceCheckUtils]: 6: Hoare triple {798#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {798#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:11,026 INFO L263 TraceCheckUtils]: 7: Hoare triple {798#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:11,027 INFO L280 TraceCheckUtils]: 8: Hoare triple {700#true} ~x := #in~x; {798#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:11,027 INFO L280 TraceCheckUtils]: 9: Hoare triple {798#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {798#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:11,028 INFO L263 TraceCheckUtils]: 10: Hoare triple {798#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:11,028 INFO L280 TraceCheckUtils]: 11: Hoare triple {700#true} ~x := #in~x; {798#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:11,028 INFO L280 TraceCheckUtils]: 12: Hoare triple {798#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {798#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:11,029 INFO L263 TraceCheckUtils]: 13: Hoare triple {798#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {700#true} is VALID [2020-07-28 19:12:11,029 INFO L280 TraceCheckUtils]: 14: Hoare triple {700#true} ~x := #in~x; {798#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:11,030 INFO L280 TraceCheckUtils]: 15: Hoare triple {798#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {838#(<= |id_#in~x| 0)} is VALID [2020-07-28 19:12:11,031 INFO L280 TraceCheckUtils]: 16: Hoare triple {838#(<= |id_#in~x| 0)} assume true; {838#(<= |id_#in~x| 0)} is VALID [2020-07-28 19:12:11,033 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {838#(<= |id_#in~x| 0)} {798#(<= |id_#in~x| id_~x)} #26#return; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:11,034 INFO L280 TraceCheckUtils]: 18: Hoare triple {787#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:11,034 INFO L280 TraceCheckUtils]: 19: Hoare triple {787#(<= |id_#in~x| 1)} assume true; {787#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:12:11,035 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {787#(<= |id_#in~x| 1)} {798#(<= |id_#in~x| id_~x)} #26#return; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:11,035 INFO L280 TraceCheckUtils]: 21: Hoare triple {782#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:11,036 INFO L280 TraceCheckUtils]: 22: Hoare triple {782#(<= |id_#in~x| 2)} assume true; {782#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:12:11,038 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {782#(<= |id_#in~x| 2)} {798#(<= |id_#in~x| id_~x)} #26#return; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:11,039 INFO L280 TraceCheckUtils]: 24: Hoare triple {771#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:11,039 INFO L280 TraceCheckUtils]: 25: Hoare triple {771#(<= |id_#in~x| 3)} assume true; {771#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:12:11,040 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {771#(<= |id_#in~x| 3)} {798#(<= |id_#in~x| id_~x)} #26#return; {754#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:12:11,040 INFO L280 TraceCheckUtils]: 27: Hoare triple {754#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {754#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:12:11,041 INFO L280 TraceCheckUtils]: 28: Hoare triple {754#(<= |id_#in~x| 4)} assume true; {754#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:12:11,043 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {754#(<= |id_#in~x| 4)} {702#(<= 5 ULTIMATE.start_main_~input~0)} #24#return; {701#false} is VALID [2020-07-28 19:12:11,043 INFO L280 TraceCheckUtils]: 30: Hoare triple {701#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {701#false} is VALID [2020-07-28 19:12:11,043 INFO L280 TraceCheckUtils]: 31: Hoare triple {701#false} assume 5 != main_~result~0; {701#false} is VALID [2020-07-28 19:12:11,043 INFO L280 TraceCheckUtils]: 32: Hoare triple {701#false} assume !false; {701#false} is VALID [2020-07-28 19:12:11,046 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-28 19:12:11,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:12:11,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-07-28 19:12:11,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472148629] [2020-07-28 19:12:11,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2020-07-28 19:12:11,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:12:11,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-28 19:12:11,084 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-28 19:12:11,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-28 19:12:11,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:12:11,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-28 19:12:11,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-28 19:12:11,085 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 11 states. [2020-07-28 19:12:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:11,264 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-28 19:12:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 19:12:11,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2020-07-28 19:12:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:12:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 19:12:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2020-07-28 19:12:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 19:12:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2020-07-28 19:12:11,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2020-07-28 19:12:11,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:12:11,318 INFO L225 Difference]: With dead ends: 30 [2020-07-28 19:12:11,318 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 19:12:11,319 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 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-28 19:12:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 19:12:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-28 19:12:11,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:12:11,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-28 19:12:11,326 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 19:12:11,327 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 19:12:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:11,329 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-28 19:12:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-28 19:12:11,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:11,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:11,330 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 19:12:11,330 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 19:12:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:11,335 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-28 19:12:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-28 19:12:11,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:11,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:11,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:12:11,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:12:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 19:12:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-07-28 19:12:11,340 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2020-07-28 19:12:11,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:12:11,341 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-07-28 19:12:11,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-28 19:12:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-28 19:12:11,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-28 19:12:11,346 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:12:11,346 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:12:11,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:12:11,560 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:12:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:12:11,561 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2020-07-28 19:12:11,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:12:11,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574903121] [2020-07-28 19:12:11,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:12:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:11,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:12:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:11,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:11,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:11,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:11,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:11,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:11,990 INFO L280 TraceCheckUtils]: 0: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:11,990 INFO L280 TraceCheckUtils]: 1: Hoare triple {1013#true} assume 0 == ~x;#res := 0; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:11,991 INFO L280 TraceCheckUtils]: 2: Hoare triple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:11,993 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1013#true} #26#return; {1139#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:12:11,993 INFO L280 TraceCheckUtils]: 0: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:11,994 INFO L280 TraceCheckUtils]: 1: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:11,994 INFO L263 TraceCheckUtils]: 2: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:11,994 INFO L280 TraceCheckUtils]: 3: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:11,996 INFO L280 TraceCheckUtils]: 4: Hoare triple {1013#true} assume 0 == ~x;#res := 0; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:11,996 INFO L280 TraceCheckUtils]: 5: Hoare triple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:11,998 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1013#true} #26#return; {1139#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:12:11,999 INFO L280 TraceCheckUtils]: 7: Hoare triple {1139#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,000 INFO L280 TraceCheckUtils]: 8: Hoare triple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,001 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1013#true} #26#return; {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,002 INFO L280 TraceCheckUtils]: 0: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,003 INFO L280 TraceCheckUtils]: 1: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,003 INFO L263 TraceCheckUtils]: 2: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,003 INFO L280 TraceCheckUtils]: 3: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,004 INFO L280 TraceCheckUtils]: 4: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,004 INFO L263 TraceCheckUtils]: 5: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,004 INFO L280 TraceCheckUtils]: 6: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,007 INFO L280 TraceCheckUtils]: 7: Hoare triple {1013#true} assume 0 == ~x;#res := 0; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:12,008 INFO L280 TraceCheckUtils]: 8: Hoare triple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:12,010 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1013#true} #26#return; {1139#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:12:12,011 INFO L280 TraceCheckUtils]: 10: Hoare triple {1139#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,011 INFO L280 TraceCheckUtils]: 11: Hoare triple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,012 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1013#true} #26#return; {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,013 INFO L280 TraceCheckUtils]: 13: Hoare triple {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-28 19:12:12,014 INFO L280 TraceCheckUtils]: 14: Hoare triple {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-28 19:12:12,015 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1013#true} #26#return; {1121#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,015 INFO L280 TraceCheckUtils]: 0: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,016 INFO L263 TraceCheckUtils]: 2: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,016 INFO L280 TraceCheckUtils]: 3: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,016 INFO L280 TraceCheckUtils]: 4: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,017 INFO L263 TraceCheckUtils]: 5: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,017 INFO L280 TraceCheckUtils]: 6: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,017 INFO L280 TraceCheckUtils]: 7: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,017 INFO L263 TraceCheckUtils]: 8: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,018 INFO L280 TraceCheckUtils]: 9: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,020 INFO L280 TraceCheckUtils]: 10: Hoare triple {1013#true} assume 0 == ~x;#res := 0; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:12,024 INFO L280 TraceCheckUtils]: 11: Hoare triple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:12,026 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1013#true} #26#return; {1139#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:12:12,027 INFO L280 TraceCheckUtils]: 13: Hoare triple {1139#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,028 INFO L280 TraceCheckUtils]: 14: Hoare triple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,029 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1013#true} #26#return; {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,030 INFO L280 TraceCheckUtils]: 16: Hoare triple {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-28 19:12:12,031 INFO L280 TraceCheckUtils]: 17: Hoare triple {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-28 19:12:12,032 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1013#true} #26#return; {1121#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,033 INFO L280 TraceCheckUtils]: 19: Hoare triple {1121#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:12:12,034 INFO L280 TraceCheckUtils]: 20: Hoare triple {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:12:12,035 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1013#true} #26#return; {1103#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,037 INFO L263 TraceCheckUtils]: 2: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,038 INFO L280 TraceCheckUtils]: 3: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,038 INFO L280 TraceCheckUtils]: 4: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,038 INFO L263 TraceCheckUtils]: 5: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,038 INFO L280 TraceCheckUtils]: 6: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,039 INFO L280 TraceCheckUtils]: 7: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,039 INFO L263 TraceCheckUtils]: 8: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,039 INFO L280 TraceCheckUtils]: 9: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,039 INFO L280 TraceCheckUtils]: 10: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,040 INFO L263 TraceCheckUtils]: 11: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,040 INFO L280 TraceCheckUtils]: 12: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,041 INFO L280 TraceCheckUtils]: 13: Hoare triple {1013#true} assume 0 == ~x;#res := 0; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:12,042 INFO L280 TraceCheckUtils]: 14: Hoare triple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:12,043 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1013#true} #26#return; {1139#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:12:12,044 INFO L280 TraceCheckUtils]: 16: Hoare triple {1139#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,045 INFO L280 TraceCheckUtils]: 17: Hoare triple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,046 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1013#true} #26#return; {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,047 INFO L280 TraceCheckUtils]: 19: Hoare triple {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-28 19:12:12,048 INFO L280 TraceCheckUtils]: 20: Hoare triple {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-28 19:12:12,049 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1013#true} #26#return; {1121#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,050 INFO L280 TraceCheckUtils]: 22: Hoare triple {1121#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:12:12,051 INFO L280 TraceCheckUtils]: 23: Hoare triple {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:12:12,052 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1013#true} #26#return; {1103#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,053 INFO L280 TraceCheckUtils]: 25: Hoare triple {1103#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-28 19:12:12,054 INFO L280 TraceCheckUtils]: 26: Hoare triple {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-28 19:12:12,056 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1013#true} #26#return; {1079#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-28 19:12:12,058 INFO L280 TraceCheckUtils]: 0: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,058 INFO L263 TraceCheckUtils]: 2: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,058 INFO L280 TraceCheckUtils]: 3: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,059 INFO L280 TraceCheckUtils]: 4: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,059 INFO L263 TraceCheckUtils]: 5: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,059 INFO L280 TraceCheckUtils]: 6: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,060 INFO L280 TraceCheckUtils]: 7: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,060 INFO L263 TraceCheckUtils]: 8: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,060 INFO L280 TraceCheckUtils]: 9: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,060 INFO L280 TraceCheckUtils]: 10: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,061 INFO L263 TraceCheckUtils]: 11: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,061 INFO L280 TraceCheckUtils]: 12: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,061 INFO L280 TraceCheckUtils]: 13: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,062 INFO L263 TraceCheckUtils]: 14: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,062 INFO L280 TraceCheckUtils]: 15: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,063 INFO L280 TraceCheckUtils]: 16: Hoare triple {1013#true} assume 0 == ~x;#res := 0; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:12,064 INFO L280 TraceCheckUtils]: 17: Hoare triple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:12,065 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1013#true} #26#return; {1139#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:12:12,066 INFO L280 TraceCheckUtils]: 19: Hoare triple {1139#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,067 INFO L280 TraceCheckUtils]: 20: Hoare triple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,068 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1013#true} #26#return; {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,069 INFO L280 TraceCheckUtils]: 22: Hoare triple {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-28 19:12:12,070 INFO L280 TraceCheckUtils]: 23: Hoare triple {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-28 19:12:12,071 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1013#true} #26#return; {1121#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,072 INFO L280 TraceCheckUtils]: 25: Hoare triple {1121#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:12:12,073 INFO L280 TraceCheckUtils]: 26: Hoare triple {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:12:12,074 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1013#true} #26#return; {1103#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,075 INFO L280 TraceCheckUtils]: 28: Hoare triple {1103#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-28 19:12:12,076 INFO L280 TraceCheckUtils]: 29: Hoare triple {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-28 19:12:12,077 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1013#true} #26#return; {1079#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-28 19:12:12,079 INFO L280 TraceCheckUtils]: 31: Hoare triple {1079#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1080#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-28 19:12:12,079 INFO L280 TraceCheckUtils]: 32: Hoare triple {1080#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1080#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-28 19:12:12,081 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1080#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1013#true} #24#return; {1049#(and (<= 5 |ULTIMATE.start_main_#t~ret1|) (<= |ULTIMATE.start_main_#t~ret1| 5))} is VALID [2020-07-28 19:12:12,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {1013#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {1013#true} is VALID [2020-07-28 19:12:12,083 INFO L263 TraceCheckUtils]: 1: Hoare triple {1013#true} call main_#t~ret1 := id(main_~input~0); {1013#true} is VALID [2020-07-28 19:12:12,084 INFO L280 TraceCheckUtils]: 2: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,084 INFO L280 TraceCheckUtils]: 3: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,084 INFO L263 TraceCheckUtils]: 4: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,085 INFO L280 TraceCheckUtils]: 5: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,085 INFO L280 TraceCheckUtils]: 6: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,085 INFO L263 TraceCheckUtils]: 7: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,085 INFO L280 TraceCheckUtils]: 8: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,085 INFO L280 TraceCheckUtils]: 9: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,086 INFO L263 TraceCheckUtils]: 10: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,086 INFO L280 TraceCheckUtils]: 11: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,086 INFO L280 TraceCheckUtils]: 12: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,087 INFO L263 TraceCheckUtils]: 13: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,087 INFO L280 TraceCheckUtils]: 14: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,087 INFO L280 TraceCheckUtils]: 15: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,088 INFO L263 TraceCheckUtils]: 16: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,088 INFO L280 TraceCheckUtils]: 17: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,089 INFO L280 TraceCheckUtils]: 18: Hoare triple {1013#true} assume 0 == ~x;#res := 0; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:12,090 INFO L280 TraceCheckUtils]: 19: Hoare triple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:12,091 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1013#true} #26#return; {1139#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:12:12,092 INFO L280 TraceCheckUtils]: 21: Hoare triple {1139#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,093 INFO L280 TraceCheckUtils]: 22: Hoare triple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,094 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1013#true} #26#return; {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,095 INFO L280 TraceCheckUtils]: 24: Hoare triple {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-28 19:12:12,096 INFO L280 TraceCheckUtils]: 25: Hoare triple {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-28 19:12:12,097 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1013#true} #26#return; {1121#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,099 INFO L280 TraceCheckUtils]: 27: Hoare triple {1121#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:12:12,099 INFO L280 TraceCheckUtils]: 28: Hoare triple {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:12:12,101 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1013#true} #26#return; {1103#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,102 INFO L280 TraceCheckUtils]: 30: Hoare triple {1103#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-28 19:12:12,103 INFO L280 TraceCheckUtils]: 31: Hoare triple {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-28 19:12:12,104 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1013#true} #26#return; {1079#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-28 19:12:12,105 INFO L280 TraceCheckUtils]: 33: Hoare triple {1079#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1080#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-28 19:12:12,106 INFO L280 TraceCheckUtils]: 34: Hoare triple {1080#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1080#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-28 19:12:12,108 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1080#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1013#true} #24#return; {1049#(and (<= 5 |ULTIMATE.start_main_#t~ret1|) (<= |ULTIMATE.start_main_#t~ret1| 5))} is VALID [2020-07-28 19:12:12,109 INFO L280 TraceCheckUtils]: 36: Hoare triple {1049#(and (<= 5 |ULTIMATE.start_main_#t~ret1|) (<= |ULTIMATE.start_main_#t~ret1| 5))} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {1050#(and (<= ULTIMATE.start_main_~result~0 5) (<= 5 ULTIMATE.start_main_~result~0))} is VALID [2020-07-28 19:12:12,110 INFO L280 TraceCheckUtils]: 37: Hoare triple {1050#(and (<= ULTIMATE.start_main_~result~0 5) (<= 5 ULTIMATE.start_main_~result~0))} assume 5 != main_~result~0; {1014#false} is VALID [2020-07-28 19:12:12,110 INFO L280 TraceCheckUtils]: 38: Hoare triple {1014#false} assume !false; {1014#false} is VALID [2020-07-28 19:12:12,113 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-28 19:12:12,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574903121] [2020-07-28 19:12:12,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317288019] [2020-07-28 19:12:12,114 INFO L93 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-28 19:12:12,150 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-28 19:12:12,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 19:12:12,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-28 19:12:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:12,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:12:12,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {1013#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {1013#true} is VALID [2020-07-28 19:12:12,356 INFO L263 TraceCheckUtils]: 1: Hoare triple {1013#true} call main_#t~ret1 := id(main_~input~0); {1013#true} is VALID [2020-07-28 19:12:12,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,356 INFO L280 TraceCheckUtils]: 3: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,356 INFO L263 TraceCheckUtils]: 4: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,356 INFO L280 TraceCheckUtils]: 5: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,356 INFO L280 TraceCheckUtils]: 6: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,356 INFO L263 TraceCheckUtils]: 7: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,357 INFO L280 TraceCheckUtils]: 8: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,357 INFO L280 TraceCheckUtils]: 9: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,357 INFO L263 TraceCheckUtils]: 10: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,357 INFO L280 TraceCheckUtils]: 11: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,357 INFO L280 TraceCheckUtils]: 12: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,357 INFO L263 TraceCheckUtils]: 13: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,357 INFO L280 TraceCheckUtils]: 14: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,358 INFO L280 TraceCheckUtils]: 15: Hoare triple {1013#true} assume !(0 == ~x); {1013#true} is VALID [2020-07-28 19:12:12,358 INFO L263 TraceCheckUtils]: 16: Hoare triple {1013#true} call #t~ret0 := id(~x - 1); {1013#true} is VALID [2020-07-28 19:12:12,358 INFO L280 TraceCheckUtils]: 17: Hoare triple {1013#true} ~x := #in~x; {1013#true} is VALID [2020-07-28 19:12:12,358 INFO L280 TraceCheckUtils]: 18: Hoare triple {1013#true} assume 0 == ~x;#res := 0; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:12,359 INFO L280 TraceCheckUtils]: 19: Hoare triple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:12:12,360 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1141#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1013#true} #26#return; {1139#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:12:12,360 INFO L280 TraceCheckUtils]: 21: Hoare triple {1139#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,361 INFO L280 TraceCheckUtils]: 22: Hoare triple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:12:12,361 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1140#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1013#true} #26#return; {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,362 INFO L280 TraceCheckUtils]: 24: Hoare triple {1133#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-28 19:12:12,363 INFO L280 TraceCheckUtils]: 25: Hoare triple {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-28 19:12:12,363 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1134#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1013#true} #26#return; {1121#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,364 INFO L280 TraceCheckUtils]: 27: Hoare triple {1121#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:12:12,364 INFO L280 TraceCheckUtils]: 28: Hoare triple {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:12:12,365 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1122#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1013#true} #26#return; {1103#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-28 19:12:12,367 INFO L280 TraceCheckUtils]: 30: Hoare triple {1103#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-28 19:12:12,368 INFO L280 TraceCheckUtils]: 31: Hoare triple {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-28 19:12:12,369 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1104#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1013#true} #26#return; {1079#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-28 19:12:12,370 INFO L280 TraceCheckUtils]: 33: Hoare triple {1079#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1080#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-28 19:12:12,375 INFO L280 TraceCheckUtils]: 34: Hoare triple {1080#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1080#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-28 19:12:12,376 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1080#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1013#true} #24#return; {1049#(and (<= 5 |ULTIMATE.start_main_#t~ret1|) (<= |ULTIMATE.start_main_#t~ret1| 5))} is VALID [2020-07-28 19:12:12,376 INFO L280 TraceCheckUtils]: 36: Hoare triple {1049#(and (<= 5 |ULTIMATE.start_main_#t~ret1|) (<= |ULTIMATE.start_main_#t~ret1| 5))} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {1050#(and (<= ULTIMATE.start_main_~result~0 5) (<= 5 ULTIMATE.start_main_~result~0))} is VALID [2020-07-28 19:12:12,377 INFO L280 TraceCheckUtils]: 37: Hoare triple {1050#(and (<= ULTIMATE.start_main_~result~0 5) (<= 5 ULTIMATE.start_main_~result~0))} assume 5 != main_~result~0; {1014#false} is VALID [2020-07-28 19:12:12,377 INFO L280 TraceCheckUtils]: 38: Hoare triple {1014#false} assume !false; {1014#false} is VALID [2020-07-28 19:12:12,379 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-28 19:12:12,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:12:12,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2020-07-28 19:12:12,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702611670] [2020-07-28 19:12:12,380 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2020-07-28 19:12:12,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:12:12,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-28 19:12:12,433 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-28 19:12:12,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-28 19:12:12,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:12:12,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-28 19:12:12,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-28 19:12:12,434 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 15 states. [2020-07-28 19:12:12,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:12,901 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-28 19:12:12,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-28 19:12:12,901 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2020-07-28 19:12:12,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:12:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 19:12:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 34 transitions. [2020-07-28 19:12:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 19:12:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 34 transitions. [2020-07-28 19:12:12,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 34 transitions. [2020-07-28 19:12:12,949 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-28 19:12:12,951 INFO L225 Difference]: With dead ends: 33 [2020-07-28 19:12:12,951 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 19:12:12,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-28 19:12:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 19:12:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-28 19:12:12,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:12:12,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-28 19:12:12,958 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-28 19:12:12,958 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-28 19:12:12,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:12,961 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-28 19:12:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-28 19:12:12,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:12,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:12,962 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-28 19:12:12,962 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-28 19:12:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:12,964 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-28 19:12:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-28 19:12:12,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:12,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:12,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:12:12,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:12:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-28 19:12:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-28 19:12:12,968 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2020-07-28 19:12:12,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:12:12,968 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-28 19:12:12,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-28 19:12:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-28 19:12:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-28 19:12:12,970 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:12:12,970 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:12:13,181 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-28 19:12:13,182 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:12:13,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:12:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2020-07-28 19:12:13,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:12:13,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324154542] [2020-07-28 19:12:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:12:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:13,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:12:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:13,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:13,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:13,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:13,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:13,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:13,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:12:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:13,414 INFO L280 TraceCheckUtils]: 0: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {1427#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,416 INFO L280 TraceCheckUtils]: 2: Hoare triple {1548#(= 0 |id_#in~x|)} assume true; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,417 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1548#(= 0 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,418 INFO L280 TraceCheckUtils]: 0: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,418 INFO L280 TraceCheckUtils]: 1: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,419 INFO L263 TraceCheckUtils]: 2: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,419 INFO L280 TraceCheckUtils]: 3: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,420 INFO L280 TraceCheckUtils]: 4: Hoare triple {1427#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,420 INFO L280 TraceCheckUtils]: 5: Hoare triple {1548#(= 0 |id_#in~x|)} assume true; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,422 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1548#(= 0 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,422 INFO L280 TraceCheckUtils]: 7: Hoare triple {1547#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,423 INFO L280 TraceCheckUtils]: 8: Hoare triple {1547#(<= 1 |id_#in~x|)} assume true; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,425 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1547#(<= 1 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,425 INFO L280 TraceCheckUtils]: 0: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,426 INFO L280 TraceCheckUtils]: 1: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,426 INFO L263 TraceCheckUtils]: 2: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,427 INFO L280 TraceCheckUtils]: 3: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,428 INFO L280 TraceCheckUtils]: 4: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,428 INFO L263 TraceCheckUtils]: 5: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,428 INFO L280 TraceCheckUtils]: 6: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,429 INFO L280 TraceCheckUtils]: 7: Hoare triple {1427#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,430 INFO L280 TraceCheckUtils]: 8: Hoare triple {1548#(= 0 |id_#in~x|)} assume true; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,431 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1548#(= 0 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,432 INFO L280 TraceCheckUtils]: 10: Hoare triple {1547#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,432 INFO L280 TraceCheckUtils]: 11: Hoare triple {1547#(<= 1 |id_#in~x|)} assume true; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,434 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1547#(<= 1 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,434 INFO L280 TraceCheckUtils]: 13: Hoare triple {1542#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,435 INFO L280 TraceCheckUtils]: 14: Hoare triple {1542#(<= 2 |id_#in~x|)} assume true; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,436 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1542#(<= 2 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,437 INFO L280 TraceCheckUtils]: 0: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,437 INFO L280 TraceCheckUtils]: 1: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,438 INFO L263 TraceCheckUtils]: 2: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,438 INFO L280 TraceCheckUtils]: 3: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,439 INFO L280 TraceCheckUtils]: 4: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,439 INFO L263 TraceCheckUtils]: 5: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,440 INFO L280 TraceCheckUtils]: 6: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,440 INFO L280 TraceCheckUtils]: 7: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,440 INFO L263 TraceCheckUtils]: 8: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,441 INFO L280 TraceCheckUtils]: 9: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,442 INFO L280 TraceCheckUtils]: 10: Hoare triple {1427#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,442 INFO L280 TraceCheckUtils]: 11: Hoare triple {1548#(= 0 |id_#in~x|)} assume true; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,443 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1548#(= 0 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,444 INFO L280 TraceCheckUtils]: 13: Hoare triple {1547#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,444 INFO L280 TraceCheckUtils]: 14: Hoare triple {1547#(<= 1 |id_#in~x|)} assume true; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,446 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1547#(<= 1 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,446 INFO L280 TraceCheckUtils]: 16: Hoare triple {1542#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,447 INFO L280 TraceCheckUtils]: 17: Hoare triple {1542#(<= 2 |id_#in~x|)} assume true; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,448 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1542#(<= 2 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,448 INFO L280 TraceCheckUtils]: 19: Hoare triple {1531#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,449 INFO L280 TraceCheckUtils]: 20: Hoare triple {1531#(<= 3 |id_#in~x|)} assume true; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,450 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1531#(<= 3 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,452 INFO L263 TraceCheckUtils]: 2: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,453 INFO L280 TraceCheckUtils]: 3: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,453 INFO L280 TraceCheckUtils]: 4: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,453 INFO L263 TraceCheckUtils]: 5: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,454 INFO L280 TraceCheckUtils]: 6: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,454 INFO L280 TraceCheckUtils]: 7: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,455 INFO L263 TraceCheckUtils]: 8: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,455 INFO L280 TraceCheckUtils]: 9: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,456 INFO L280 TraceCheckUtils]: 10: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,456 INFO L263 TraceCheckUtils]: 11: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,456 INFO L280 TraceCheckUtils]: 12: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,457 INFO L280 TraceCheckUtils]: 13: Hoare triple {1427#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,458 INFO L280 TraceCheckUtils]: 14: Hoare triple {1548#(= 0 |id_#in~x|)} assume true; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,459 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1548#(= 0 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,459 INFO L280 TraceCheckUtils]: 16: Hoare triple {1547#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,460 INFO L280 TraceCheckUtils]: 17: Hoare triple {1547#(<= 1 |id_#in~x|)} assume true; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,461 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1547#(<= 1 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,462 INFO L280 TraceCheckUtils]: 19: Hoare triple {1542#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,462 INFO L280 TraceCheckUtils]: 20: Hoare triple {1542#(<= 2 |id_#in~x|)} assume true; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,464 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1542#(<= 2 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,464 INFO L280 TraceCheckUtils]: 22: Hoare triple {1531#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,465 INFO L280 TraceCheckUtils]: 23: Hoare triple {1531#(<= 3 |id_#in~x|)} assume true; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,466 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1531#(<= 3 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,467 INFO L280 TraceCheckUtils]: 25: Hoare triple {1514#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,467 INFO L280 TraceCheckUtils]: 26: Hoare triple {1514#(<= 4 |id_#in~x|)} assume true; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,469 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1514#(<= 4 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:13,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,471 INFO L263 TraceCheckUtils]: 2: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,471 INFO L280 TraceCheckUtils]: 3: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,472 INFO L280 TraceCheckUtils]: 4: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,472 INFO L263 TraceCheckUtils]: 5: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,473 INFO L280 TraceCheckUtils]: 6: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,473 INFO L280 TraceCheckUtils]: 7: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,473 INFO L263 TraceCheckUtils]: 8: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,474 INFO L280 TraceCheckUtils]: 9: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,474 INFO L280 TraceCheckUtils]: 10: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,475 INFO L263 TraceCheckUtils]: 11: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,475 INFO L280 TraceCheckUtils]: 12: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,476 INFO L280 TraceCheckUtils]: 13: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,476 INFO L263 TraceCheckUtils]: 14: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,476 INFO L280 TraceCheckUtils]: 15: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,477 INFO L280 TraceCheckUtils]: 16: Hoare triple {1427#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,478 INFO L280 TraceCheckUtils]: 17: Hoare triple {1548#(= 0 |id_#in~x|)} assume true; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,479 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1548#(= 0 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,479 INFO L280 TraceCheckUtils]: 19: Hoare triple {1547#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,480 INFO L280 TraceCheckUtils]: 20: Hoare triple {1547#(<= 1 |id_#in~x|)} assume true; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,481 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1547#(<= 1 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,482 INFO L280 TraceCheckUtils]: 22: Hoare triple {1542#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,482 INFO L280 TraceCheckUtils]: 23: Hoare triple {1542#(<= 2 |id_#in~x|)} assume true; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,484 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1542#(<= 2 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,484 INFO L280 TraceCheckUtils]: 25: Hoare triple {1531#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,485 INFO L280 TraceCheckUtils]: 26: Hoare triple {1531#(<= 3 |id_#in~x|)} assume true; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,486 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1531#(<= 3 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,487 INFO L280 TraceCheckUtils]: 28: Hoare triple {1514#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,487 INFO L280 TraceCheckUtils]: 29: Hoare triple {1514#(<= 4 |id_#in~x|)} assume true; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,489 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1514#(<= 4 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:13,490 INFO L280 TraceCheckUtils]: 31: Hoare triple {1491#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:13,490 INFO L280 TraceCheckUtils]: 32: Hoare triple {1491#(<= 5 |id_#in~x|)} assume true; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:13,492 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1491#(<= 5 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1462#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:12:13,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,494 INFO L263 TraceCheckUtils]: 2: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,495 INFO L280 TraceCheckUtils]: 3: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,495 INFO L280 TraceCheckUtils]: 4: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,496 INFO L263 TraceCheckUtils]: 5: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,496 INFO L280 TraceCheckUtils]: 6: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,497 INFO L280 TraceCheckUtils]: 7: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,497 INFO L263 TraceCheckUtils]: 8: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,497 INFO L280 TraceCheckUtils]: 9: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,498 INFO L280 TraceCheckUtils]: 10: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,498 INFO L263 TraceCheckUtils]: 11: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,499 INFO L280 TraceCheckUtils]: 12: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,499 INFO L280 TraceCheckUtils]: 13: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,499 INFO L263 TraceCheckUtils]: 14: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,500 INFO L280 TraceCheckUtils]: 15: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,500 INFO L280 TraceCheckUtils]: 16: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,501 INFO L263 TraceCheckUtils]: 17: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,501 INFO L280 TraceCheckUtils]: 18: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,502 INFO L280 TraceCheckUtils]: 19: Hoare triple {1427#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,502 INFO L280 TraceCheckUtils]: 20: Hoare triple {1548#(= 0 |id_#in~x|)} assume true; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,504 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1548#(= 0 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,504 INFO L280 TraceCheckUtils]: 22: Hoare triple {1547#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,505 INFO L280 TraceCheckUtils]: 23: Hoare triple {1547#(<= 1 |id_#in~x|)} assume true; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,506 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1547#(<= 1 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,506 INFO L280 TraceCheckUtils]: 25: Hoare triple {1542#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,507 INFO L280 TraceCheckUtils]: 26: Hoare triple {1542#(<= 2 |id_#in~x|)} assume true; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,508 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1542#(<= 2 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,509 INFO L280 TraceCheckUtils]: 28: Hoare triple {1531#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,509 INFO L280 TraceCheckUtils]: 29: Hoare triple {1531#(<= 3 |id_#in~x|)} assume true; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,511 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1531#(<= 3 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,511 INFO L280 TraceCheckUtils]: 31: Hoare triple {1514#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,512 INFO L280 TraceCheckUtils]: 32: Hoare triple {1514#(<= 4 |id_#in~x|)} assume true; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,513 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1514#(<= 4 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:13,513 INFO L280 TraceCheckUtils]: 34: Hoare triple {1491#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:13,514 INFO L280 TraceCheckUtils]: 35: Hoare triple {1491#(<= 5 |id_#in~x|)} assume true; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:13,515 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1491#(<= 5 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1462#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:12:13,516 INFO L280 TraceCheckUtils]: 37: Hoare triple {1462#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1462#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:12:13,516 INFO L280 TraceCheckUtils]: 38: Hoare triple {1462#(<= 6 |id_#in~x|)} assume true; {1462#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:12:13,517 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1462#(<= 6 |id_#in~x|)} {1386#(<= ULTIMATE.start_main_~input~0 5)} #24#return; {1385#false} is VALID [2020-07-28 19:12:13,520 INFO L280 TraceCheckUtils]: 0: Hoare triple {1384#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {1386#(<= ULTIMATE.start_main_~input~0 5)} is VALID [2020-07-28 19:12:13,520 INFO L263 TraceCheckUtils]: 1: Hoare triple {1386#(<= ULTIMATE.start_main_~input~0 5)} call main_#t~ret1 := id(main_~input~0); {1384#true} is VALID [2020-07-28 19:12:13,521 INFO L280 TraceCheckUtils]: 2: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,521 INFO L280 TraceCheckUtils]: 3: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,521 INFO L263 TraceCheckUtils]: 4: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,522 INFO L280 TraceCheckUtils]: 5: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,523 INFO L280 TraceCheckUtils]: 6: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,523 INFO L263 TraceCheckUtils]: 7: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,523 INFO L280 TraceCheckUtils]: 8: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,524 INFO L280 TraceCheckUtils]: 9: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,524 INFO L263 TraceCheckUtils]: 10: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,525 INFO L280 TraceCheckUtils]: 11: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,525 INFO L280 TraceCheckUtils]: 12: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,525 INFO L263 TraceCheckUtils]: 13: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,526 INFO L280 TraceCheckUtils]: 14: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,526 INFO L280 TraceCheckUtils]: 15: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,527 INFO L263 TraceCheckUtils]: 16: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,527 INFO L280 TraceCheckUtils]: 17: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,528 INFO L280 TraceCheckUtils]: 18: Hoare triple {1427#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,528 INFO L263 TraceCheckUtils]: 19: Hoare triple {1427#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:13,528 INFO L280 TraceCheckUtils]: 20: Hoare triple {1384#true} ~x := #in~x; {1427#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:12:13,529 INFO L280 TraceCheckUtils]: 21: Hoare triple {1427#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,529 INFO L280 TraceCheckUtils]: 22: Hoare triple {1548#(= 0 |id_#in~x|)} assume true; {1548#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:13,531 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1548#(= 0 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,531 INFO L280 TraceCheckUtils]: 24: Hoare triple {1547#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,533 INFO L280 TraceCheckUtils]: 25: Hoare triple {1547#(<= 1 |id_#in~x|)} assume true; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:13,535 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1547#(<= 1 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,535 INFO L280 TraceCheckUtils]: 27: Hoare triple {1542#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,536 INFO L280 TraceCheckUtils]: 28: Hoare triple {1542#(<= 2 |id_#in~x|)} assume true; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:13,537 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1542#(<= 2 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,538 INFO L280 TraceCheckUtils]: 30: Hoare triple {1531#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,538 INFO L280 TraceCheckUtils]: 31: Hoare triple {1531#(<= 3 |id_#in~x|)} assume true; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:13,539 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1531#(<= 3 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,540 INFO L280 TraceCheckUtils]: 33: Hoare triple {1514#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,540 INFO L280 TraceCheckUtils]: 34: Hoare triple {1514#(<= 4 |id_#in~x|)} assume true; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:13,542 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1514#(<= 4 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:13,542 INFO L280 TraceCheckUtils]: 36: Hoare triple {1491#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:13,543 INFO L280 TraceCheckUtils]: 37: Hoare triple {1491#(<= 5 |id_#in~x|)} assume true; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:13,544 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1491#(<= 5 |id_#in~x|)} {1427#(= |id_#in~x| id_~x)} #26#return; {1462#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:12:13,544 INFO L280 TraceCheckUtils]: 39: Hoare triple {1462#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1462#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:12:13,545 INFO L280 TraceCheckUtils]: 40: Hoare triple {1462#(<= 6 |id_#in~x|)} assume true; {1462#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:12:13,546 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1462#(<= 6 |id_#in~x|)} {1386#(<= ULTIMATE.start_main_~input~0 5)} #24#return; {1385#false} is VALID [2020-07-28 19:12:13,546 INFO L280 TraceCheckUtils]: 42: Hoare triple {1385#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {1385#false} is VALID [2020-07-28 19:12:13,546 INFO L280 TraceCheckUtils]: 43: Hoare triple {1385#false} assume 5 != main_~result~0; {1385#false} is VALID [2020-07-28 19:12:13,546 INFO L280 TraceCheckUtils]: 44: Hoare triple {1385#false} assume !false; {1385#false} is VALID [2020-07-28 19:12:13,549 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-28 19:12:13,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324154542] [2020-07-28 19:12:13,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976950434] [2020-07-28 19:12:13,549 INFO L93 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-28 19:12:13,586 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-28 19:12:13,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 19:12:13,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-28 19:12:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:12:13,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:12:14,073 INFO L280 TraceCheckUtils]: 0: Hoare triple {1384#true} havoc main_#res;havoc main_#t~ret1, main_~input~0, main_~result~0;main_~input~0 := 5; {1386#(<= ULTIMATE.start_main_~input~0 5)} is VALID [2020-07-28 19:12:14,074 INFO L263 TraceCheckUtils]: 1: Hoare triple {1386#(<= ULTIMATE.start_main_~input~0 5)} call main_#t~ret1 := id(main_~input~0); {1384#true} is VALID [2020-07-28 19:12:14,074 INFO L280 TraceCheckUtils]: 2: Hoare triple {1384#true} ~x := #in~x; {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,075 INFO L280 TraceCheckUtils]: 3: Hoare triple {1558#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,075 INFO L263 TraceCheckUtils]: 4: Hoare triple {1558#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:14,076 INFO L280 TraceCheckUtils]: 5: Hoare triple {1384#true} ~x := #in~x; {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,076 INFO L280 TraceCheckUtils]: 6: Hoare triple {1558#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,077 INFO L263 TraceCheckUtils]: 7: Hoare triple {1558#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:14,077 INFO L280 TraceCheckUtils]: 8: Hoare triple {1384#true} ~x := #in~x; {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,078 INFO L280 TraceCheckUtils]: 9: Hoare triple {1558#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,078 INFO L263 TraceCheckUtils]: 10: Hoare triple {1558#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:14,079 INFO L280 TraceCheckUtils]: 11: Hoare triple {1384#true} ~x := #in~x; {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,079 INFO L280 TraceCheckUtils]: 12: Hoare triple {1558#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,079 INFO L263 TraceCheckUtils]: 13: Hoare triple {1558#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:14,080 INFO L280 TraceCheckUtils]: 14: Hoare triple {1384#true} ~x := #in~x; {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,080 INFO L280 TraceCheckUtils]: 15: Hoare triple {1558#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,081 INFO L263 TraceCheckUtils]: 16: Hoare triple {1558#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:14,081 INFO L280 TraceCheckUtils]: 17: Hoare triple {1384#true} ~x := #in~x; {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,082 INFO L280 TraceCheckUtils]: 18: Hoare triple {1558#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,082 INFO L263 TraceCheckUtils]: 19: Hoare triple {1558#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1384#true} is VALID [2020-07-28 19:12:14,083 INFO L280 TraceCheckUtils]: 20: Hoare triple {1384#true} ~x := #in~x; {1558#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:12:14,083 INFO L280 TraceCheckUtils]: 21: Hoare triple {1558#(<= id_~x |id_#in~x|)} assume 0 == ~x;#res := 0; {1616#(<= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:14,084 INFO L280 TraceCheckUtils]: 22: Hoare triple {1616#(<= 0 |id_#in~x|)} assume true; {1616#(<= 0 |id_#in~x|)} is VALID [2020-07-28 19:12:14,085 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1616#(<= 0 |id_#in~x|)} {1558#(<= id_~x |id_#in~x|)} #26#return; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:14,086 INFO L280 TraceCheckUtils]: 24: Hoare triple {1547#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:14,087 INFO L280 TraceCheckUtils]: 25: Hoare triple {1547#(<= 1 |id_#in~x|)} assume true; {1547#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:12:14,088 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1547#(<= 1 |id_#in~x|)} {1558#(<= id_~x |id_#in~x|)} #26#return; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:14,089 INFO L280 TraceCheckUtils]: 27: Hoare triple {1542#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:14,089 INFO L280 TraceCheckUtils]: 28: Hoare triple {1542#(<= 2 |id_#in~x|)} assume true; {1542#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:12:14,091 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1542#(<= 2 |id_#in~x|)} {1558#(<= id_~x |id_#in~x|)} #26#return; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:14,091 INFO L280 TraceCheckUtils]: 30: Hoare triple {1531#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:14,092 INFO L280 TraceCheckUtils]: 31: Hoare triple {1531#(<= 3 |id_#in~x|)} assume true; {1531#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:12:14,093 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1531#(<= 3 |id_#in~x|)} {1558#(<= id_~x |id_#in~x|)} #26#return; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:14,096 INFO L280 TraceCheckUtils]: 33: Hoare triple {1514#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:14,098 INFO L280 TraceCheckUtils]: 34: Hoare triple {1514#(<= 4 |id_#in~x|)} assume true; {1514#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:12:14,100 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1514#(<= 4 |id_#in~x|)} {1558#(<= id_~x |id_#in~x|)} #26#return; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:14,100 INFO L280 TraceCheckUtils]: 36: Hoare triple {1491#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:14,101 INFO L280 TraceCheckUtils]: 37: Hoare triple {1491#(<= 5 |id_#in~x|)} assume true; {1491#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:12:14,102 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1491#(<= 5 |id_#in~x|)} {1558#(<= id_~x |id_#in~x|)} #26#return; {1462#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:12:14,103 INFO L280 TraceCheckUtils]: 39: Hoare triple {1462#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1462#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:12:14,103 INFO L280 TraceCheckUtils]: 40: Hoare triple {1462#(<= 6 |id_#in~x|)} assume true; {1462#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:12:14,104 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1462#(<= 6 |id_#in~x|)} {1386#(<= ULTIMATE.start_main_~input~0 5)} #24#return; {1385#false} is VALID [2020-07-28 19:12:14,105 INFO L280 TraceCheckUtils]: 42: Hoare triple {1385#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {1385#false} is VALID [2020-07-28 19:12:14,105 INFO L280 TraceCheckUtils]: 43: Hoare triple {1385#false} assume 5 != main_~result~0; {1385#false} is VALID [2020-07-28 19:12:14,105 INFO L280 TraceCheckUtils]: 44: Hoare triple {1385#false} assume !false; {1385#false} is VALID [2020-07-28 19:12:14,107 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-28 19:12:14,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 19:12:14,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 13 [2020-07-28 19:12:14,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29958068] [2020-07-28 19:12:14,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2020-07-28 19:12:14,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:12:14,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-28 19:12:14,143 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-28 19:12:14,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-28 19:12:14,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:12:14,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-28 19:12:14,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-07-28 19:12:14,144 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2020-07-28 19:12:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:14,399 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-28 19:12:14,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-28 19:12:14,400 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2020-07-28 19:12:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:12:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 19:12:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2020-07-28 19:12:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 19:12:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2020-07-28 19:12:14,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 30 transitions. [2020-07-28 19:12:14,443 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-28 19:12:14,444 INFO L225 Difference]: With dead ends: 29 [2020-07-28 19:12:14,444 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 19:12:14,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2020-07-28 19:12:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 19:12:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 19:12:14,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:12:14,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 19:12:14,446 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:12:14,446 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:12:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:14,447 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:12:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:12:14,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:14,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:14,447 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:12:14,447 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:12:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:12:14,448 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:12:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:12:14,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:14,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:12:14,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:12:14,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:12:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 19:12:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 19:12:14,449 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2020-07-28 19:12:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:12:14,449 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 19:12:14,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-28 19:12:14,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:12:14,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:12:14,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:12:14,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 19:12:14,692 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 19:12:14,692 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 19:12:14,692 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 19:12:14,692 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2020-07-28 19:12:14,692 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-28 19:12:14,692 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-07-28 19:12:14,692 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= 5 ULTIMATE.start_main_~input~0) (<= ULTIMATE.start_main_~input~0 5)) [2020-07-28 19:12:14,693 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-28 19:12:14,693 INFO L268 CegarLoopResult]: For program point L9(lines 9 15) no Hoare annotation was computed. [2020-07-28 19:12:14,693 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2020-07-28 19:12:14,693 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2020-07-28 19:12:14,693 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-07-28 19:12:14,693 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-28 19:12:14,694 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-28 19:12:14,694 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-28 19:12:14,697 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 19:12:14,697 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 19:12:14,697 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-28 19:12:14,697 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 19:12:14,698 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 19:12:14,698 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-28 19:12:14,698 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-28 19:12:14,698 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 19:12:14,698 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-28 19:12:14,698 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-28 19:12:14,698 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-28 19:12:14,698 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-28 19:12:14,699 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 19:12:14,699 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 19:12:14,699 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 19:12:14,699 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-28 19:12:14,699 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:12:14,699 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 19:12:14,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 07:12:14 BoogieIcfgContainer [2020-07-28 19:12:14,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 19:12:14,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 19:12:14,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 19:12:14,702 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 19:12:14,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:12:06" (3/4) ... [2020-07-28 19:12:14,706 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 19:12:14,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2020-07-28 19:12:14,716 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-07-28 19:12:14,717 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 19:12:14,756 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 19:12:14,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 19:12:14,759 INFO L168 Benchmark]: Toolchain (without parser) took 9356.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 952.2 MB in the beginning and 907.0 MB in the end (delta: 45.2 MB). Peak memory consumption was 346.1 MB. Max. memory is 11.5 GB. [2020-07-28 19:12:14,759 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:12:14,760 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.21 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:12:14,760 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.67 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:12:14,761 INFO L168 Benchmark]: Boogie Preprocessor took 73.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -194.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 19:12:14,761 INFO L168 Benchmark]: RCFGBuilder took 350.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2020-07-28 19:12:14,762 INFO L168 Benchmark]: TraceAbstraction took 8615.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 915.9 MB in the end (delta: 195.3 MB). Peak memory consumption was 356.3 MB. Max. memory is 11.5 GB. [2020-07-28 19:12:14,762 INFO L168 Benchmark]: Witness Printer took 54.59 ms. Allocated memory is still 1.3 GB. Free memory was 915.9 MB in the beginning and 907.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2020-07-28 19:12:14,765 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 220.21 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.67 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -194.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 350.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8615.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 915.9 MB in the end (delta: 195.3 MB). Peak memory consumption was 356.3 MB. Max. memory is 11.5 GB. * Witness Printer took 54.59 ms. Allocated memory is still 1.3 GB. Free memory was 915.9 MB in the beginning and 907.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 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 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.5s, OverallIterations: 7, TraceHistogramMax: 7, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 86 SDtfs, 81 SDslu, 386 SDs, 0 SdLazy, 267 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 219 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 11 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 369 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 32496 SizeOfPredicates, 27 NumberOfNonLiveVariables, 412 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...