./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_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/id2_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 9448a6696b4991e038dda55623feb6ffc9366da0 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:11:32,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:11:32,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:11:32,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:11:32,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:11:32,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:11:32,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:11:32,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:11:32,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:11:32,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:11:32,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:11:32,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:11:32,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:11:32,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:11:32,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:11:32,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:11:32,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:11:32,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:11:32,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:11:32,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:11:32,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:11:32,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:11:32,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:11:32,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:11:32,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:11:32,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:11:32,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:11:32,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:11:32,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:11:32,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:11:32,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:11:32,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:11:32,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:11:32,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:11:32,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:11:32,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:11:32,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:11:32,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:11:32,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:11:32,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:11:32,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:11:32,313 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:11:32,348 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:11:32,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:11:32,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:11:32,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:11:32,354 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:11:32,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:11:32,354 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:11:32,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 19:11:32,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:11:32,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:11:32,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:11:32,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:11:32,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:11:32,356 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:11:32,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:11:32,356 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:11:32,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:11:32,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:11:32,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:11:32,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:11:32,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:11:32,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:11:32,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:11:32,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:11:32,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:11:32,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 19:11:32,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 19:11:32,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:11:32,366 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:11:32,366 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 -> 9448a6696b4991e038dda55623feb6ffc9366da0 [2020-07-28 19:11:32,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:11:32,685 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:11:32,689 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:11:32,690 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:11:32,691 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:11:32,692 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2020-07-28 19:11:32,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14af78a68/3da258576ef943c6896b4a1f20fded1b/FLAGd9cdec040 [2020-07-28 19:11:33,257 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:11:33,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2020-07-28 19:11:33,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14af78a68/3da258576ef943c6896b4a1f20fded1b/FLAGd9cdec040 [2020-07-28 19:11:33,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14af78a68/3da258576ef943c6896b4a1f20fded1b [2020-07-28 19:11:33,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:11:33,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:11:33,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:11:33,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:11:33,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:11:33,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:11:33" (1/1) ... [2020-07-28 19:11:33,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@118c30ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:33, skipping insertion in model container [2020-07-28 19:11:33,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:11:33" (1/1) ... [2020-07-28 19:11:33,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:11:33,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:11:33,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:11:33,823 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:11:33,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:11:33,854 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:11:33,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:33 WrapperNode [2020-07-28 19:11:33,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:11:33,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:11:33,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:11:33,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:11:33,865 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:11:33" (1/1) ... [2020-07-28 19:11:33,870 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:11:33" (1/1) ... [2020-07-28 19:11:33,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:11:33,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:11:33,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:11:33,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:11:33,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:33" (1/1) ... [2020-07-28 19:11:33,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:33" (1/1) ... [2020-07-28 19:11:33,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:33" (1/1) ... [2020-07-28 19:11:33,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:33" (1/1) ... [2020-07-28 19:11:33,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:33" (1/1) ... [2020-07-28 19:11:33,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:33" (1/1) ... [2020-07-28 19:11:33,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:33" (1/1) ... [2020-07-28 19:11:33,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:11:33,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:11:33,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:11:33,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:11:33,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:33" (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:11:34,037 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-07-28 19:11:34,037 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-07-28 19:11:34,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:11:34,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:11:34,038 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-28 19:11:34,038 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-28 19:11:34,278 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:11:34,278 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 19:11:34,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:11:34 BoogieIcfgContainer [2020-07-28 19:11:34,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:11:34,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:11:34,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:11:34,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:11:34,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:11:33" (1/3) ... [2020-07-28 19:11:34,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fd539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:11:34, skipping insertion in model container [2020-07-28 19:11:34,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:33" (2/3) ... [2020-07-28 19:11:34,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fd539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:11:34, skipping insertion in model container [2020-07-28 19:11:34,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:11:34" (3/3) ... [2020-07-28 19:11:34,319 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2020-07-28 19:11:34,344 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:11:34,363 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:11:34,394 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:11:34,421 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:11:34,422 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:11:34,422 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:11:34,422 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:11:34,422 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:11:34,423 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:11:34,423 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:11:34,423 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:11:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-28 19:11:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 19:11:34,449 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:11:34,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:11:34,451 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:11:34,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:11:34,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2105267373, now seen corresponding path program 1 times [2020-07-28 19:11:34,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:11:34,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288966515] [2020-07-28 19:11:34,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:11:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:34,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:11:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:34,712 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~x := #in~x; {31#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:34,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {32#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:34,715 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#(= 0 |id_#in~x|)} assume true; {32#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:34,718 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {32#(= 0 |id_#in~x|)} {26#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {25#false} is VALID [2020-07-28 19:11:34,724 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {26#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:11:34,725 INFO L263 TraceCheckUtils]: 1: Hoare triple {26#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret2 := id(main_~input~0); {24#true} is VALID [2020-07-28 19:11:34,726 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} ~x := #in~x; {31#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:34,727 INFO L280 TraceCheckUtils]: 3: Hoare triple {31#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {32#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:34,728 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#(= 0 |id_#in~x|)} assume true; {32#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:34,729 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {32#(= 0 |id_#in~x|)} {26#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {25#false} is VALID [2020-07-28 19:11:34,730 INFO L280 TraceCheckUtils]: 6: Hoare triple {25#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {25#false} is VALID [2020-07-28 19:11:34,730 INFO L280 TraceCheckUtils]: 7: Hoare triple {25#false} assume 5 != main_~result~0; {25#false} is VALID [2020-07-28 19:11:34,731 INFO L280 TraceCheckUtils]: 8: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-28 19:11:34,732 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:11:34,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288966515] [2020-07-28 19:11:34,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:11:34,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 19:11:34,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738606363] [2020-07-28 19:11:34,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 19:11:34,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:11:34,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 19:11:34,776 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:11:34,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 19:11:34,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:11:34,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 19:11:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:11:34,787 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-07-28 19:11:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:34,987 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-28 19:11:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:11:34,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 19:11:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:11:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:11:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-28 19:11:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:11:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-28 19:11:35,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2020-07-28 19:11:35,068 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:11:35,080 INFO L225 Difference]: With dead ends: 30 [2020-07-28 19:11:35,082 INFO L226 Difference]: Without dead ends: 20 [2020-07-28 19:11:35,086 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:11:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-28 19:11:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-28 19:11:35,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:11:35,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-28 19:11:35,135 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 19:11:35,135 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 19:11:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:35,141 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-28 19:11:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-28 19:11:35,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:35,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:35,142 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 19:11:35,142 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 19:11:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:35,147 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-28 19:11:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-28 19:11:35,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:35,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:35,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:11:35,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:11:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-28 19:11:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-07-28 19:11:35,153 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2020-07-28 19:11:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:11:35,154 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-28 19:11:35,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 19:11:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-28 19:11:35,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 19:11:35,156 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:11:35,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:11:35,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 19:11:35,157 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:11:35,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:11:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash -131148366, now seen corresponding path program 1 times [2020-07-28 19:11:35,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:11:35,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561597167] [2020-07-28 19:11:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:11:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:35,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:11:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:35,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:35,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {137#true} ~x := #in~x; {156#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:35,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {156#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {157#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:35,324 INFO L280 TraceCheckUtils]: 2: Hoare triple {157#(= 0 |id2_#in~x|)} assume true; {157#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:35,326 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {157#(= 0 |id2_#in~x|)} {150#(= |id_#in~x| id_~x)} #36#return; {155#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:35,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {137#true} ~x := #in~x; {150#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:35,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {150#(= |id_#in~x| id_~x)} assume !(0 == ~x); {150#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:35,329 INFO L263 TraceCheckUtils]: 2: Hoare triple {150#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {137#true} is VALID [2020-07-28 19:11:35,330 INFO L280 TraceCheckUtils]: 3: Hoare triple {137#true} ~x := #in~x; {156#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:35,331 INFO L280 TraceCheckUtils]: 4: Hoare triple {156#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {157#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:35,332 INFO L280 TraceCheckUtils]: 5: Hoare triple {157#(= 0 |id2_#in~x|)} assume true; {157#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:35,334 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {157#(= 0 |id2_#in~x|)} {150#(= |id_#in~x| id_~x)} #36#return; {155#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:35,335 INFO L280 TraceCheckUtils]: 7: Hoare triple {155#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {155#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:35,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {155#(<= |id_#in~x| 1)} assume true; {155#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:35,338 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {155#(<= |id_#in~x| 1)} {139#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {138#false} is VALID [2020-07-28 19:11:35,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {137#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {139#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:11:35,341 INFO L263 TraceCheckUtils]: 1: Hoare triple {139#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret2 := id(main_~input~0); {137#true} is VALID [2020-07-28 19:11:35,342 INFO L280 TraceCheckUtils]: 2: Hoare triple {137#true} ~x := #in~x; {150#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:35,343 INFO L280 TraceCheckUtils]: 3: Hoare triple {150#(= |id_#in~x| id_~x)} assume !(0 == ~x); {150#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:35,344 INFO L263 TraceCheckUtils]: 4: Hoare triple {150#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {137#true} is VALID [2020-07-28 19:11:35,345 INFO L280 TraceCheckUtils]: 5: Hoare triple {137#true} ~x := #in~x; {156#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:35,346 INFO L280 TraceCheckUtils]: 6: Hoare triple {156#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {157#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:35,347 INFO L280 TraceCheckUtils]: 7: Hoare triple {157#(= 0 |id2_#in~x|)} assume true; {157#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:35,348 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {157#(= 0 |id2_#in~x|)} {150#(= |id_#in~x| id_~x)} #36#return; {155#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:35,349 INFO L280 TraceCheckUtils]: 9: Hoare triple {155#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {155#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:35,350 INFO L280 TraceCheckUtils]: 10: Hoare triple {155#(<= |id_#in~x| 1)} assume true; {155#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:35,352 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {155#(<= |id_#in~x| 1)} {139#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {138#false} is VALID [2020-07-28 19:11:35,352 INFO L280 TraceCheckUtils]: 12: Hoare triple {138#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {138#false} is VALID [2020-07-28 19:11:35,353 INFO L280 TraceCheckUtils]: 13: Hoare triple {138#false} assume 5 != main_~result~0; {138#false} is VALID [2020-07-28 19:11:35,353 INFO L280 TraceCheckUtils]: 14: Hoare triple {138#false} assume !false; {138#false} is VALID [2020-07-28 19:11:35,355 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:11:35,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561597167] [2020-07-28 19:11:35,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:11:35,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-28 19:11:35,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012077999] [2020-07-28 19:11:35,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-28 19:11:35,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:11:35,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 19:11:35,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:11:35,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 19:11:35,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:11:35,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 19:11:35,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-28 19:11:35,384 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 7 states. [2020-07-28 19:11:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:35,609 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-28 19:11:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 19:11:35,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-28 19:11:35,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:11:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:11:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-28 19:11:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:11:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-28 19:11:35,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2020-07-28 19:11:35,677 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:11:35,679 INFO L225 Difference]: With dead ends: 29 [2020-07-28 19:11:35,679 INFO L226 Difference]: Without dead ends: 25 [2020-07-28 19:11:35,681 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-28 19:11:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-28 19:11:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-07-28 19:11:35,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:11:35,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 23 states. [2020-07-28 19:11:35,693 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 23 states. [2020-07-28 19:11:35,693 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 23 states. [2020-07-28 19:11:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:35,697 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-28 19:11:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-28 19:11:35,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:35,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:35,699 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states. [2020-07-28 19:11:35,699 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states. [2020-07-28 19:11:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:35,703 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-28 19:11:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-28 19:11:35,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:35,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:35,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:11:35,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:11:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 19:11:35,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-28 19:11:35,708 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2020-07-28 19:11:35,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:11:35,708 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-28 19:11:35,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 19:11:35,709 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-28 19:11:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 19:11:35,710 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:11:35,710 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:11:35,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 19:11:35,711 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:11:35,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:11:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash -132605643, now seen corresponding path program 1 times [2020-07-28 19:11:35,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:11:35,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781516633] [2020-07-28 19:11:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:11:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:35,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:11:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:35,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:35,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:35,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {276#true} ~x := #in~x; {295#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:35,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {295#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {313#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:35,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {313#(= 0 |id_#in~x|)} assume true; {313#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:35,930 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {313#(= 0 |id_#in~x|)} {307#(= id2_~x |id2_#in~x|)} #32#return; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:35,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {276#true} ~x := #in~x; {307#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:35,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {307#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {307#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:35,933 INFO L263 TraceCheckUtils]: 2: Hoare triple {307#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {276#true} is VALID [2020-07-28 19:11:35,935 INFO L280 TraceCheckUtils]: 3: Hoare triple {276#true} ~x := #in~x; {295#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:35,936 INFO L280 TraceCheckUtils]: 4: Hoare triple {295#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {313#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:35,937 INFO L280 TraceCheckUtils]: 5: Hoare triple {313#(= 0 |id_#in~x|)} assume true; {313#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:35,939 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {313#(= 0 |id_#in~x|)} {307#(= id2_~x |id2_#in~x|)} #32#return; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:35,940 INFO L280 TraceCheckUtils]: 7: Hoare triple {312#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:35,941 INFO L280 TraceCheckUtils]: 8: Hoare triple {312#(<= |id2_#in~x| 1)} assume true; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:35,943 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {312#(<= |id2_#in~x| 1)} {295#(= |id_#in~x| id_~x)} #36#return; {306#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:35,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {276#true} ~x := #in~x; {295#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:35,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {295#(= |id_#in~x| id_~x)} assume !(0 == ~x); {295#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:35,946 INFO L263 TraceCheckUtils]: 2: Hoare triple {295#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {276#true} is VALID [2020-07-28 19:11:35,947 INFO L280 TraceCheckUtils]: 3: Hoare triple {276#true} ~x := #in~x; {307#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:35,948 INFO L280 TraceCheckUtils]: 4: Hoare triple {307#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {307#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:35,949 INFO L263 TraceCheckUtils]: 5: Hoare triple {307#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {276#true} is VALID [2020-07-28 19:11:35,950 INFO L280 TraceCheckUtils]: 6: Hoare triple {276#true} ~x := #in~x; {295#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:35,951 INFO L280 TraceCheckUtils]: 7: Hoare triple {295#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {313#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:35,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {313#(= 0 |id_#in~x|)} assume true; {313#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:35,954 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {313#(= 0 |id_#in~x|)} {307#(= id2_~x |id2_#in~x|)} #32#return; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:35,955 INFO L280 TraceCheckUtils]: 10: Hoare triple {312#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:35,957 INFO L280 TraceCheckUtils]: 11: Hoare triple {312#(<= |id2_#in~x| 1)} assume true; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:35,959 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {312#(<= |id2_#in~x| 1)} {295#(= |id_#in~x| id_~x)} #36#return; {306#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:35,960 INFO L280 TraceCheckUtils]: 13: Hoare triple {306#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {306#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:35,961 INFO L280 TraceCheckUtils]: 14: Hoare triple {306#(<= |id_#in~x| 2)} assume true; {306#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:35,963 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {306#(<= |id_#in~x| 2)} {278#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {277#false} is VALID [2020-07-28 19:11:35,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {276#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {278#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:11:35,966 INFO L263 TraceCheckUtils]: 1: Hoare triple {278#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret2 := id(main_~input~0); {276#true} is VALID [2020-07-28 19:11:35,967 INFO L280 TraceCheckUtils]: 2: Hoare triple {276#true} ~x := #in~x; {295#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:35,968 INFO L280 TraceCheckUtils]: 3: Hoare triple {295#(= |id_#in~x| id_~x)} assume !(0 == ~x); {295#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:35,969 INFO L263 TraceCheckUtils]: 4: Hoare triple {295#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {276#true} is VALID [2020-07-28 19:11:35,970 INFO L280 TraceCheckUtils]: 5: Hoare triple {276#true} ~x := #in~x; {307#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:35,971 INFO L280 TraceCheckUtils]: 6: Hoare triple {307#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {307#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:35,971 INFO L263 TraceCheckUtils]: 7: Hoare triple {307#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {276#true} is VALID [2020-07-28 19:11:35,972 INFO L280 TraceCheckUtils]: 8: Hoare triple {276#true} ~x := #in~x; {295#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:35,973 INFO L280 TraceCheckUtils]: 9: Hoare triple {295#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {313#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:35,974 INFO L280 TraceCheckUtils]: 10: Hoare triple {313#(= 0 |id_#in~x|)} assume true; {313#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:35,975 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {313#(= 0 |id_#in~x|)} {307#(= id2_~x |id2_#in~x|)} #32#return; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:35,976 INFO L280 TraceCheckUtils]: 12: Hoare triple {312#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:35,977 INFO L280 TraceCheckUtils]: 13: Hoare triple {312#(<= |id2_#in~x| 1)} assume true; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:35,979 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {312#(<= |id2_#in~x| 1)} {295#(= |id_#in~x| id_~x)} #36#return; {306#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:35,980 INFO L280 TraceCheckUtils]: 15: Hoare triple {306#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {306#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:35,981 INFO L280 TraceCheckUtils]: 16: Hoare triple {306#(<= |id_#in~x| 2)} assume true; {306#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:35,983 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {306#(<= |id_#in~x| 2)} {278#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {277#false} is VALID [2020-07-28 19:11:35,983 INFO L280 TraceCheckUtils]: 18: Hoare triple {277#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {277#false} is VALID [2020-07-28 19:11:35,983 INFO L280 TraceCheckUtils]: 19: Hoare triple {277#false} assume 5 != main_~result~0; {277#false} is VALID [2020-07-28 19:11:35,984 INFO L280 TraceCheckUtils]: 20: Hoare triple {277#false} assume !false; {277#false} is VALID [2020-07-28 19:11:35,985 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:11:35,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781516633] [2020-07-28 19:11:35,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395126294] [2020-07-28 19:11:35,986 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:11:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:36,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 19:11:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:36,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:11:36,418 INFO L280 TraceCheckUtils]: 0: Hoare triple {276#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {278#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:11:36,419 INFO L263 TraceCheckUtils]: 1: Hoare triple {278#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret2 := id(main_~input~0); {276#true} is VALID [2020-07-28 19:11:36,420 INFO L280 TraceCheckUtils]: 2: Hoare triple {276#true} ~x := #in~x; {323#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:36,421 INFO L280 TraceCheckUtils]: 3: Hoare triple {323#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {323#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:36,421 INFO L263 TraceCheckUtils]: 4: Hoare triple {323#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {276#true} is VALID [2020-07-28 19:11:36,422 INFO L280 TraceCheckUtils]: 5: Hoare triple {276#true} ~x := #in~x; {333#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-28 19:11:36,423 INFO L280 TraceCheckUtils]: 6: Hoare triple {333#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {333#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-28 19:11:36,423 INFO L263 TraceCheckUtils]: 7: Hoare triple {333#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {276#true} is VALID [2020-07-28 19:11:36,424 INFO L280 TraceCheckUtils]: 8: Hoare triple {276#true} ~x := #in~x; {323#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:36,425 INFO L280 TraceCheckUtils]: 9: Hoare triple {323#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {346#(<= |id_#in~x| 0)} is VALID [2020-07-28 19:11:36,426 INFO L280 TraceCheckUtils]: 10: Hoare triple {346#(<= |id_#in~x| 0)} assume true; {346#(<= |id_#in~x| 0)} is VALID [2020-07-28 19:11:36,428 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {346#(<= |id_#in~x| 0)} {333#(<= |id2_#in~x| id2_~x)} #32#return; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:36,428 INFO L280 TraceCheckUtils]: 12: Hoare triple {312#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:36,429 INFO L280 TraceCheckUtils]: 13: Hoare triple {312#(<= |id2_#in~x| 1)} assume true; {312#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:36,431 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {312#(<= |id2_#in~x| 1)} {323#(<= |id_#in~x| id_~x)} #36#return; {306#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:36,432 INFO L280 TraceCheckUtils]: 15: Hoare triple {306#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {306#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:36,433 INFO L280 TraceCheckUtils]: 16: Hoare triple {306#(<= |id_#in~x| 2)} assume true; {306#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:36,435 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {306#(<= |id_#in~x| 2)} {278#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {277#false} is VALID [2020-07-28 19:11:36,435 INFO L280 TraceCheckUtils]: 18: Hoare triple {277#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {277#false} is VALID [2020-07-28 19:11:36,436 INFO L280 TraceCheckUtils]: 19: Hoare triple {277#false} assume 5 != main_~result~0; {277#false} is VALID [2020-07-28 19:11:36,436 INFO L280 TraceCheckUtils]: 20: Hoare triple {277#false} assume !false; {277#false} is VALID [2020-07-28 19:11:36,438 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:11:36,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:11:36,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-07-28 19:11:36,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429808975] [2020-07-28 19:11:36,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-28 19:11:36,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:11:36,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-28 19:11:36,484 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:11:36,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-28 19:11:36,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:11:36,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-28 19:11:36,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-28 19:11:36,485 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2020-07-28 19:11:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:36,764 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-28 19:11:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 19:11:36,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-28 19:11:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:11:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 19:11:36,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2020-07-28 19:11:36,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 19:11:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2020-07-28 19:11:36,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2020-07-28 19:11:36,819 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:11:36,821 INFO L225 Difference]: With dead ends: 35 [2020-07-28 19:11:36,821 INFO L226 Difference]: Without dead ends: 31 [2020-07-28 19:11:36,822 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-07-28 19:11:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-28 19:11:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2020-07-28 19:11:36,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:11:36,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 26 states. [2020-07-28 19:11:36,835 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 26 states. [2020-07-28 19:11:36,835 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 26 states. [2020-07-28 19:11:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:36,838 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-28 19:11:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-28 19:11:36,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:36,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:36,840 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 31 states. [2020-07-28 19:11:36,840 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 31 states. [2020-07-28 19:11:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:36,843 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-28 19:11:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-28 19:11:36,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:36,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:36,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:11:36,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:11:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 19:11:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-07-28 19:11:36,848 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2020-07-28 19:11:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:11:36,848 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-07-28 19:11:36,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-28 19:11:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-28 19:11:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-28 19:11:36,850 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:11:36,850 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:11:37,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 19:11:37,064 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:11:37,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:11:37,066 INFO L82 PathProgramCache]: Analyzing trace with hash -614490246, now seen corresponding path program 1 times [2020-07-28 19:11:37,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:11:37,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760020468] [2020-07-28 19:11:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:11:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:37,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:11:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:37,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:37,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:37,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:37,254 INFO L280 TraceCheckUtils]: 0: Hoare triple {518#true} ~x := #in~x; {561#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:37,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {561#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {578#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:37,256 INFO L280 TraceCheckUtils]: 2: Hoare triple {578#(= 0 |id2_#in~x|)} assume true; {578#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:37,258 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {578#(= 0 |id2_#in~x|)} {543#(= |id_#in~x| id_~x)} #36#return; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {518#true} ~x := #in~x; {543#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {543#(= |id_#in~x| id_~x)} assume !(0 == ~x); {543#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,260 INFO L263 TraceCheckUtils]: 2: Hoare triple {543#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {518#true} is VALID [2020-07-28 19:11:37,261 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} ~x := #in~x; {561#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:37,262 INFO L280 TraceCheckUtils]: 4: Hoare triple {561#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {578#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:37,263 INFO L280 TraceCheckUtils]: 5: Hoare triple {578#(= 0 |id2_#in~x|)} assume true; {578#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:37,265 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {578#(= 0 |id2_#in~x|)} {543#(= |id_#in~x| id_~x)} #36#return; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,266 INFO L280 TraceCheckUtils]: 7: Hoare triple {577#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,267 INFO L280 TraceCheckUtils]: 8: Hoare triple {577#(<= |id_#in~x| 1)} assume true; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,269 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {577#(<= |id_#in~x| 1)} {561#(= id2_~x |id2_#in~x|)} #32#return; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {518#true} ~x := #in~x; {561#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:37,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {561#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {561#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:37,271 INFO L263 TraceCheckUtils]: 2: Hoare triple {561#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {518#true} is VALID [2020-07-28 19:11:37,272 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} ~x := #in~x; {543#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,273 INFO L280 TraceCheckUtils]: 4: Hoare triple {543#(= |id_#in~x| id_~x)} assume !(0 == ~x); {543#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,273 INFO L263 TraceCheckUtils]: 5: Hoare triple {543#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {518#true} is VALID [2020-07-28 19:11:37,274 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} ~x := #in~x; {561#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:37,275 INFO L280 TraceCheckUtils]: 7: Hoare triple {561#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {578#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:37,276 INFO L280 TraceCheckUtils]: 8: Hoare triple {578#(= 0 |id2_#in~x|)} assume true; {578#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:37,278 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {578#(= 0 |id2_#in~x|)} {543#(= |id_#in~x| id_~x)} #36#return; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,279 INFO L280 TraceCheckUtils]: 10: Hoare triple {577#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,279 INFO L280 TraceCheckUtils]: 11: Hoare triple {577#(<= |id_#in~x| 1)} assume true; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,281 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {577#(<= |id_#in~x| 1)} {561#(= id2_~x |id2_#in~x|)} #32#return; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,282 INFO L280 TraceCheckUtils]: 13: Hoare triple {572#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,283 INFO L280 TraceCheckUtils]: 14: Hoare triple {572#(<= |id2_#in~x| 2)} assume true; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,285 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {572#(<= |id2_#in~x| 2)} {543#(= |id_#in~x| id_~x)} #36#return; {560#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:11:37,286 INFO L280 TraceCheckUtils]: 0: Hoare triple {518#true} ~x := #in~x; {543#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {543#(= |id_#in~x| id_~x)} assume !(0 == ~x); {543#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,288 INFO L263 TraceCheckUtils]: 2: Hoare triple {543#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {518#true} is VALID [2020-07-28 19:11:37,289 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} ~x := #in~x; {561#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:37,290 INFO L280 TraceCheckUtils]: 4: Hoare triple {561#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {561#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:37,290 INFO L263 TraceCheckUtils]: 5: Hoare triple {561#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {518#true} is VALID [2020-07-28 19:11:37,291 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} ~x := #in~x; {543#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,291 INFO L280 TraceCheckUtils]: 7: Hoare triple {543#(= |id_#in~x| id_~x)} assume !(0 == ~x); {543#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,292 INFO L263 TraceCheckUtils]: 8: Hoare triple {543#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {518#true} is VALID [2020-07-28 19:11:37,293 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#true} ~x := #in~x; {561#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:37,293 INFO L280 TraceCheckUtils]: 10: Hoare triple {561#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {578#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:37,294 INFO L280 TraceCheckUtils]: 11: Hoare triple {578#(= 0 |id2_#in~x|)} assume true; {578#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:37,296 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {578#(= 0 |id2_#in~x|)} {543#(= |id_#in~x| id_~x)} #36#return; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,297 INFO L280 TraceCheckUtils]: 13: Hoare triple {577#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,297 INFO L280 TraceCheckUtils]: 14: Hoare triple {577#(<= |id_#in~x| 1)} assume true; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,299 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {577#(<= |id_#in~x| 1)} {561#(= id2_~x |id2_#in~x|)} #32#return; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,300 INFO L280 TraceCheckUtils]: 16: Hoare triple {572#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,301 INFO L280 TraceCheckUtils]: 17: Hoare triple {572#(<= |id2_#in~x| 2)} assume true; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,302 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {572#(<= |id2_#in~x| 2)} {543#(= |id_#in~x| id_~x)} #36#return; {560#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:11:37,303 INFO L280 TraceCheckUtils]: 19: Hoare triple {560#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {560#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:11:37,304 INFO L280 TraceCheckUtils]: 20: Hoare triple {560#(<= |id_#in~x| 3)} assume true; {560#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:11:37,305 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {560#(<= |id_#in~x| 3)} {520#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {519#false} is VALID [2020-07-28 19:11:37,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {518#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {520#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:11:37,308 INFO L263 TraceCheckUtils]: 1: Hoare triple {520#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret2 := id(main_~input~0); {518#true} is VALID [2020-07-28 19:11:37,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} ~x := #in~x; {543#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,310 INFO L280 TraceCheckUtils]: 3: Hoare triple {543#(= |id_#in~x| id_~x)} assume !(0 == ~x); {543#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,310 INFO L263 TraceCheckUtils]: 4: Hoare triple {543#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {518#true} is VALID [2020-07-28 19:11:37,311 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} ~x := #in~x; {561#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:37,312 INFO L280 TraceCheckUtils]: 6: Hoare triple {561#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {561#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:37,312 INFO L263 TraceCheckUtils]: 7: Hoare triple {561#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {518#true} is VALID [2020-07-28 19:11:37,313 INFO L280 TraceCheckUtils]: 8: Hoare triple {518#true} ~x := #in~x; {543#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,314 INFO L280 TraceCheckUtils]: 9: Hoare triple {543#(= |id_#in~x| id_~x)} assume !(0 == ~x); {543#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,314 INFO L263 TraceCheckUtils]: 10: Hoare triple {543#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {518#true} is VALID [2020-07-28 19:11:37,315 INFO L280 TraceCheckUtils]: 11: Hoare triple {518#true} ~x := #in~x; {561#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:37,316 INFO L280 TraceCheckUtils]: 12: Hoare triple {561#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {578#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:37,317 INFO L280 TraceCheckUtils]: 13: Hoare triple {578#(= 0 |id2_#in~x|)} assume true; {578#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:37,318 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {578#(= 0 |id2_#in~x|)} {543#(= |id_#in~x| id_~x)} #36#return; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,319 INFO L280 TraceCheckUtils]: 15: Hoare triple {577#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,320 INFO L280 TraceCheckUtils]: 16: Hoare triple {577#(<= |id_#in~x| 1)} assume true; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,321 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {577#(<= |id_#in~x| 1)} {561#(= id2_~x |id2_#in~x|)} #32#return; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,322 INFO L280 TraceCheckUtils]: 18: Hoare triple {572#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,323 INFO L280 TraceCheckUtils]: 19: Hoare triple {572#(<= |id2_#in~x| 2)} assume true; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,325 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {572#(<= |id2_#in~x| 2)} {543#(= |id_#in~x| id_~x)} #36#return; {560#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:11:37,326 INFO L280 TraceCheckUtils]: 21: Hoare triple {560#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {560#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:11:37,327 INFO L280 TraceCheckUtils]: 22: Hoare triple {560#(<= |id_#in~x| 3)} assume true; {560#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:11:37,328 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {560#(<= |id_#in~x| 3)} {520#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {519#false} is VALID [2020-07-28 19:11:37,329 INFO L280 TraceCheckUtils]: 24: Hoare triple {519#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {519#false} is VALID [2020-07-28 19:11:37,329 INFO L280 TraceCheckUtils]: 25: Hoare triple {519#false} assume 5 != main_~result~0; {519#false} is VALID [2020-07-28 19:11:37,329 INFO L280 TraceCheckUtils]: 26: Hoare triple {519#false} assume !false; {519#false} is VALID [2020-07-28 19:11:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-28 19:11:37,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760020468] [2020-07-28 19:11:37,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377651823] [2020-07-28 19:11:37,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:11:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:37,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 19:11:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:37,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:11:37,707 INFO L280 TraceCheckUtils]: 0: Hoare triple {518#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {520#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:11:37,707 INFO L263 TraceCheckUtils]: 1: Hoare triple {520#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret2 := id(main_~input~0); {518#true} is VALID [2020-07-28 19:11:37,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} ~x := #in~x; {588#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,709 INFO L280 TraceCheckUtils]: 3: Hoare triple {588#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {588#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,709 INFO L263 TraceCheckUtils]: 4: Hoare triple {588#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {518#true} is VALID [2020-07-28 19:11:37,710 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} ~x := #in~x; {598#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-28 19:11:37,710 INFO L280 TraceCheckUtils]: 6: Hoare triple {598#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {598#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-28 19:11:37,711 INFO L263 TraceCheckUtils]: 7: Hoare triple {598#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {518#true} is VALID [2020-07-28 19:11:37,712 INFO L280 TraceCheckUtils]: 8: Hoare triple {518#true} ~x := #in~x; {588#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,712 INFO L280 TraceCheckUtils]: 9: Hoare triple {588#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {588#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:37,712 INFO L263 TraceCheckUtils]: 10: Hoare triple {588#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {518#true} is VALID [2020-07-28 19:11:37,713 INFO L280 TraceCheckUtils]: 11: Hoare triple {518#true} ~x := #in~x; {598#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-28 19:11:37,714 INFO L280 TraceCheckUtils]: 12: Hoare triple {598#(<= |id2_#in~x| id2_~x)} assume 0 == ~x;#res := 0; {620#(<= |id2_#in~x| 0)} is VALID [2020-07-28 19:11:37,715 INFO L280 TraceCheckUtils]: 13: Hoare triple {620#(<= |id2_#in~x| 0)} assume true; {620#(<= |id2_#in~x| 0)} is VALID [2020-07-28 19:11:37,716 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {620#(<= |id2_#in~x| 0)} {588#(<= |id_#in~x| id_~x)} #36#return; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,717 INFO L280 TraceCheckUtils]: 15: Hoare triple {577#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,717 INFO L280 TraceCheckUtils]: 16: Hoare triple {577#(<= |id_#in~x| 1)} assume true; {577#(<= |id_#in~x| 1)} is VALID [2020-07-28 19:11:37,719 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {577#(<= |id_#in~x| 1)} {598#(<= |id2_#in~x| id2_~x)} #32#return; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,719 INFO L280 TraceCheckUtils]: 18: Hoare triple {572#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,720 INFO L280 TraceCheckUtils]: 19: Hoare triple {572#(<= |id2_#in~x| 2)} assume true; {572#(<= |id2_#in~x| 2)} is VALID [2020-07-28 19:11:37,722 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {572#(<= |id2_#in~x| 2)} {588#(<= |id_#in~x| id_~x)} #36#return; {560#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:11:37,722 INFO L280 TraceCheckUtils]: 21: Hoare triple {560#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {560#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:11:37,723 INFO L280 TraceCheckUtils]: 22: Hoare triple {560#(<= |id_#in~x| 3)} assume true; {560#(<= |id_#in~x| 3)} is VALID [2020-07-28 19:11:37,724 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {560#(<= |id_#in~x| 3)} {520#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {519#false} is VALID [2020-07-28 19:11:37,725 INFO L280 TraceCheckUtils]: 24: Hoare triple {519#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {519#false} is VALID [2020-07-28 19:11:37,725 INFO L280 TraceCheckUtils]: 25: Hoare triple {519#false} assume 5 != main_~result~0; {519#false} is VALID [2020-07-28 19:11:37,725 INFO L280 TraceCheckUtils]: 26: Hoare triple {519#false} assume !false; {519#false} is VALID [2020-07-28 19:11:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-28 19:11:37,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:11:37,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-28 19:11:37,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263000902] [2020-07-28 19:11:37,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-28 19:11:37,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:11:37,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-28 19:11:37,765 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:11:37,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-28 19:11:37,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:11:37,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-28 19:11:37,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-07-28 19:11:37,767 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 12 states. [2020-07-28 19:11:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:38,094 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-28 19:11:38,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 19:11:38,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-28 19:11:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:11:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 19:11:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-28 19:11:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 19:11:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-28 19:11:38,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-28 19:11:38,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:11:38,160 INFO L225 Difference]: With dead ends: 41 [2020-07-28 19:11:38,161 INFO L226 Difference]: Without dead ends: 37 [2020-07-28 19:11:38,162 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-07-28 19:11:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-28 19:11:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2020-07-28 19:11:38,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:11:38,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 29 states. [2020-07-28 19:11:38,181 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 29 states. [2020-07-28 19:11:38,181 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 29 states. [2020-07-28 19:11:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:38,185 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-28 19:11:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-28 19:11:38,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:38,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:38,186 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 37 states. [2020-07-28 19:11:38,186 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 37 states. [2020-07-28 19:11:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:38,195 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-28 19:11:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-28 19:11:38,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:38,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:38,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:11:38,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:11:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-28 19:11:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-28 19:11:38,200 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2020-07-28 19:11:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:11:38,200 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-28 19:11:38,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-28 19:11:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-28 19:11:38,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-28 19:11:38,202 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:11:38,202 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:11:38,409 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:11:38,410 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:11:38,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:11:38,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2127867459, now seen corresponding path program 2 times [2020-07-28 19:11:38,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:11:38,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286353791] [2020-07-28 19:11:38,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:11:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:38,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:11:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:38,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:38,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:38,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:38,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:38,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {824#true} ~x := #in~x; {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {855#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {913#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:38,672 INFO L280 TraceCheckUtils]: 2: Hoare triple {913#(= 0 |id_#in~x|)} assume true; {913#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:38,674 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {913#(= 0 |id_#in~x|)} {879#(= id2_~x |id2_#in~x|)} #32#return; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {824#true} ~x := #in~x; {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {879#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,676 INFO L263 TraceCheckUtils]: 2: Hoare triple {879#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,676 INFO L280 TraceCheckUtils]: 3: Hoare triple {824#true} ~x := #in~x; {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {855#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {913#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:38,678 INFO L280 TraceCheckUtils]: 5: Hoare triple {913#(= 0 |id_#in~x|)} assume true; {913#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:38,679 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {913#(= 0 |id_#in~x|)} {879#(= id2_~x |id2_#in~x|)} #32#return; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,680 INFO L280 TraceCheckUtils]: 7: Hoare triple {912#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,680 INFO L280 TraceCheckUtils]: 8: Hoare triple {912#(<= |id2_#in~x| 1)} assume true; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,682 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {912#(<= |id2_#in~x| 1)} {855#(= |id_#in~x| id_~x)} #36#return; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {824#true} ~x := #in~x; {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {855#(= |id_#in~x| id_~x)} assume !(0 == ~x); {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,683 INFO L263 TraceCheckUtils]: 2: Hoare triple {855#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,684 INFO L280 TraceCheckUtils]: 3: Hoare triple {824#true} ~x := #in~x; {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,684 INFO L280 TraceCheckUtils]: 4: Hoare triple {879#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,684 INFO L263 TraceCheckUtils]: 5: Hoare triple {879#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,685 INFO L280 TraceCheckUtils]: 6: Hoare triple {824#true} ~x := #in~x; {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,685 INFO L280 TraceCheckUtils]: 7: Hoare triple {855#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {913#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:38,686 INFO L280 TraceCheckUtils]: 8: Hoare triple {913#(= 0 |id_#in~x|)} assume true; {913#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:38,687 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {913#(= 0 |id_#in~x|)} {879#(= id2_~x |id2_#in~x|)} #32#return; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,688 INFO L280 TraceCheckUtils]: 10: Hoare triple {912#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,691 INFO L280 TraceCheckUtils]: 11: Hoare triple {912#(<= |id2_#in~x| 1)} assume true; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,694 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {912#(<= |id2_#in~x| 1)} {855#(= |id_#in~x| id_~x)} #36#return; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,695 INFO L280 TraceCheckUtils]: 13: Hoare triple {907#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,696 INFO L280 TraceCheckUtils]: 14: Hoare triple {907#(<= |id_#in~x| 2)} assume true; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,697 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {907#(<= |id_#in~x| 2)} {879#(= id2_~x |id2_#in~x|)} #32#return; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:38,700 INFO L280 TraceCheckUtils]: 0: Hoare triple {824#true} ~x := #in~x; {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {879#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,702 INFO L263 TraceCheckUtils]: 2: Hoare triple {879#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {824#true} ~x := #in~x; {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,704 INFO L280 TraceCheckUtils]: 4: Hoare triple {855#(= |id_#in~x| id_~x)} assume !(0 == ~x); {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,705 INFO L263 TraceCheckUtils]: 5: Hoare triple {855#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,705 INFO L280 TraceCheckUtils]: 6: Hoare triple {824#true} ~x := #in~x; {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,706 INFO L280 TraceCheckUtils]: 7: Hoare triple {879#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,707 INFO L263 TraceCheckUtils]: 8: Hoare triple {879#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,707 INFO L280 TraceCheckUtils]: 9: Hoare triple {824#true} ~x := #in~x; {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,708 INFO L280 TraceCheckUtils]: 10: Hoare triple {855#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {913#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:38,709 INFO L280 TraceCheckUtils]: 11: Hoare triple {913#(= 0 |id_#in~x|)} assume true; {913#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:38,710 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {913#(= 0 |id_#in~x|)} {879#(= id2_~x |id2_#in~x|)} #32#return; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,711 INFO L280 TraceCheckUtils]: 13: Hoare triple {912#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,712 INFO L280 TraceCheckUtils]: 14: Hoare triple {912#(<= |id2_#in~x| 1)} assume true; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,713 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {912#(<= |id2_#in~x| 1)} {855#(= |id_#in~x| id_~x)} #36#return; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,714 INFO L280 TraceCheckUtils]: 16: Hoare triple {907#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,715 INFO L280 TraceCheckUtils]: 17: Hoare triple {907#(<= |id_#in~x| 2)} assume true; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,716 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {907#(<= |id_#in~x| 2)} {879#(= id2_~x |id2_#in~x|)} #32#return; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:38,717 INFO L280 TraceCheckUtils]: 19: Hoare triple {896#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:38,717 INFO L280 TraceCheckUtils]: 20: Hoare triple {896#(<= |id2_#in~x| 3)} assume true; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:38,718 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {896#(<= |id2_#in~x| 3)} {855#(= |id_#in~x| id_~x)} #36#return; {878#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:11:38,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {824#true} ~x := #in~x; {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {855#(= |id_#in~x| id_~x)} assume !(0 == ~x); {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,720 INFO L263 TraceCheckUtils]: 2: Hoare triple {855#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,720 INFO L280 TraceCheckUtils]: 3: Hoare triple {824#true} ~x := #in~x; {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,721 INFO L280 TraceCheckUtils]: 4: Hoare triple {879#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,721 INFO L263 TraceCheckUtils]: 5: Hoare triple {879#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,722 INFO L280 TraceCheckUtils]: 6: Hoare triple {824#true} ~x := #in~x; {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,723 INFO L280 TraceCheckUtils]: 7: Hoare triple {855#(= |id_#in~x| id_~x)} assume !(0 == ~x); {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,723 INFO L263 TraceCheckUtils]: 8: Hoare triple {855#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,725 INFO L280 TraceCheckUtils]: 9: Hoare triple {824#true} ~x := #in~x; {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,727 INFO L280 TraceCheckUtils]: 10: Hoare triple {879#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,727 INFO L263 TraceCheckUtils]: 11: Hoare triple {879#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,728 INFO L280 TraceCheckUtils]: 12: Hoare triple {824#true} ~x := #in~x; {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,731 INFO L280 TraceCheckUtils]: 13: Hoare triple {855#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {913#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:38,732 INFO L280 TraceCheckUtils]: 14: Hoare triple {913#(= 0 |id_#in~x|)} assume true; {913#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:38,733 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {913#(= 0 |id_#in~x|)} {879#(= id2_~x |id2_#in~x|)} #32#return; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,733 INFO L280 TraceCheckUtils]: 16: Hoare triple {912#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,735 INFO L280 TraceCheckUtils]: 17: Hoare triple {912#(<= |id2_#in~x| 1)} assume true; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,736 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {912#(<= |id2_#in~x| 1)} {855#(= |id_#in~x| id_~x)} #36#return; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,737 INFO L280 TraceCheckUtils]: 19: Hoare triple {907#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,737 INFO L280 TraceCheckUtils]: 20: Hoare triple {907#(<= |id_#in~x| 2)} assume true; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,738 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {907#(<= |id_#in~x| 2)} {879#(= id2_~x |id2_#in~x|)} #32#return; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:38,741 INFO L280 TraceCheckUtils]: 22: Hoare triple {896#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:38,742 INFO L280 TraceCheckUtils]: 23: Hoare triple {896#(<= |id2_#in~x| 3)} assume true; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:38,745 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {896#(<= |id2_#in~x| 3)} {855#(= |id_#in~x| id_~x)} #36#return; {878#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:11:38,746 INFO L280 TraceCheckUtils]: 25: Hoare triple {878#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {878#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:11:38,747 INFO L280 TraceCheckUtils]: 26: Hoare triple {878#(<= |id_#in~x| 4)} assume true; {878#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:11:38,748 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {878#(<= |id_#in~x| 4)} {826#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {825#false} is VALID [2020-07-28 19:11:38,749 INFO L280 TraceCheckUtils]: 0: Hoare triple {824#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {826#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:11:38,749 INFO L263 TraceCheckUtils]: 1: Hoare triple {826#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret2 := id(main_~input~0); {824#true} is VALID [2020-07-28 19:11:38,749 INFO L280 TraceCheckUtils]: 2: Hoare triple {824#true} ~x := #in~x; {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,750 INFO L280 TraceCheckUtils]: 3: Hoare triple {855#(= |id_#in~x| id_~x)} assume !(0 == ~x); {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,750 INFO L263 TraceCheckUtils]: 4: Hoare triple {855#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,751 INFO L280 TraceCheckUtils]: 5: Hoare triple {824#true} ~x := #in~x; {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,752 INFO L280 TraceCheckUtils]: 6: Hoare triple {879#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,753 INFO L263 TraceCheckUtils]: 7: Hoare triple {879#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,753 INFO L280 TraceCheckUtils]: 8: Hoare triple {824#true} ~x := #in~x; {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {855#(= |id_#in~x| id_~x)} assume !(0 == ~x); {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,754 INFO L263 TraceCheckUtils]: 10: Hoare triple {855#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,754 INFO L280 TraceCheckUtils]: 11: Hoare triple {824#true} ~x := #in~x; {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,755 INFO L280 TraceCheckUtils]: 12: Hoare triple {879#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {879#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:38,755 INFO L263 TraceCheckUtils]: 13: Hoare triple {879#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {824#true} is VALID [2020-07-28 19:11:38,755 INFO L280 TraceCheckUtils]: 14: Hoare triple {824#true} ~x := #in~x; {855#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:38,756 INFO L280 TraceCheckUtils]: 15: Hoare triple {855#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {913#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:38,756 INFO L280 TraceCheckUtils]: 16: Hoare triple {913#(= 0 |id_#in~x|)} assume true; {913#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:38,757 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {913#(= 0 |id_#in~x|)} {879#(= id2_~x |id2_#in~x|)} #32#return; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,761 INFO L280 TraceCheckUtils]: 18: Hoare triple {912#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,762 INFO L280 TraceCheckUtils]: 19: Hoare triple {912#(<= |id2_#in~x| 1)} assume true; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:38,763 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {912#(<= |id2_#in~x| 1)} {855#(= |id_#in~x| id_~x)} #36#return; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,763 INFO L280 TraceCheckUtils]: 21: Hoare triple {907#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,764 INFO L280 TraceCheckUtils]: 22: Hoare triple {907#(<= |id_#in~x| 2)} assume true; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:38,764 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {907#(<= |id_#in~x| 2)} {879#(= id2_~x |id2_#in~x|)} #32#return; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:38,765 INFO L280 TraceCheckUtils]: 24: Hoare triple {896#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:38,765 INFO L280 TraceCheckUtils]: 25: Hoare triple {896#(<= |id2_#in~x| 3)} assume true; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:38,766 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {896#(<= |id2_#in~x| 3)} {855#(= |id_#in~x| id_~x)} #36#return; {878#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:11:38,767 INFO L280 TraceCheckUtils]: 27: Hoare triple {878#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {878#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:11:38,769 INFO L280 TraceCheckUtils]: 28: Hoare triple {878#(<= |id_#in~x| 4)} assume true; {878#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:11:38,770 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {878#(<= |id_#in~x| 4)} {826#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {825#false} is VALID [2020-07-28 19:11:38,771 INFO L280 TraceCheckUtils]: 30: Hoare triple {825#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {825#false} is VALID [2020-07-28 19:11:38,771 INFO L280 TraceCheckUtils]: 31: Hoare triple {825#false} assume 5 != main_~result~0; {825#false} is VALID [2020-07-28 19:11:38,771 INFO L280 TraceCheckUtils]: 32: Hoare triple {825#false} assume !false; {825#false} is VALID [2020-07-28 19:11:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-28 19:11:38,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286353791] [2020-07-28 19:11:38,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428782996] [2020-07-28 19:11:38,775 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-28 19:11:38,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 19:11:38,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:11:38,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-28 19:11:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:38,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:11:39,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {824#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {826#(<= 5 ULTIMATE.start_main_~input~0)} is VALID [2020-07-28 19:11:39,270 INFO L263 TraceCheckUtils]: 1: Hoare triple {826#(<= 5 ULTIMATE.start_main_~input~0)} call main_#t~ret2 := id(main_~input~0); {824#true} is VALID [2020-07-28 19:11:39,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {824#true} ~x := #in~x; {923#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:39,271 INFO L280 TraceCheckUtils]: 3: Hoare triple {923#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {923#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:39,271 INFO L263 TraceCheckUtils]: 4: Hoare triple {923#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {824#true} is VALID [2020-07-28 19:11:39,272 INFO L280 TraceCheckUtils]: 5: Hoare triple {824#true} ~x := #in~x; {933#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-28 19:11:39,272 INFO L280 TraceCheckUtils]: 6: Hoare triple {933#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {933#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-28 19:11:39,272 INFO L263 TraceCheckUtils]: 7: Hoare triple {933#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {824#true} is VALID [2020-07-28 19:11:39,273 INFO L280 TraceCheckUtils]: 8: Hoare triple {824#true} ~x := #in~x; {923#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:39,273 INFO L280 TraceCheckUtils]: 9: Hoare triple {923#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {923#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:39,273 INFO L263 TraceCheckUtils]: 10: Hoare triple {923#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {824#true} is VALID [2020-07-28 19:11:39,274 INFO L280 TraceCheckUtils]: 11: Hoare triple {824#true} ~x := #in~x; {933#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-28 19:11:39,274 INFO L280 TraceCheckUtils]: 12: Hoare triple {933#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {933#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-28 19:11:39,274 INFO L263 TraceCheckUtils]: 13: Hoare triple {933#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {824#true} is VALID [2020-07-28 19:11:39,275 INFO L280 TraceCheckUtils]: 14: Hoare triple {824#true} ~x := #in~x; {923#(<= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:39,275 INFO L280 TraceCheckUtils]: 15: Hoare triple {923#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {964#(<= |id_#in~x| 0)} is VALID [2020-07-28 19:11:39,276 INFO L280 TraceCheckUtils]: 16: Hoare triple {964#(<= |id_#in~x| 0)} assume true; {964#(<= |id_#in~x| 0)} is VALID [2020-07-28 19:11:39,277 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {964#(<= |id_#in~x| 0)} {933#(<= |id2_#in~x| id2_~x)} #32#return; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:39,277 INFO L280 TraceCheckUtils]: 18: Hoare triple {912#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:39,277 INFO L280 TraceCheckUtils]: 19: Hoare triple {912#(<= |id2_#in~x| 1)} assume true; {912#(<= |id2_#in~x| 1)} is VALID [2020-07-28 19:11:39,278 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {912#(<= |id2_#in~x| 1)} {923#(<= |id_#in~x| id_~x)} #36#return; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:39,279 INFO L280 TraceCheckUtils]: 21: Hoare triple {907#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:39,280 INFO L280 TraceCheckUtils]: 22: Hoare triple {907#(<= |id_#in~x| 2)} assume true; {907#(<= |id_#in~x| 2)} is VALID [2020-07-28 19:11:39,281 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {907#(<= |id_#in~x| 2)} {933#(<= |id2_#in~x| id2_~x)} #32#return; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:39,282 INFO L280 TraceCheckUtils]: 24: Hoare triple {896#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:39,282 INFO L280 TraceCheckUtils]: 25: Hoare triple {896#(<= |id2_#in~x| 3)} assume true; {896#(<= |id2_#in~x| 3)} is VALID [2020-07-28 19:11:39,283 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {896#(<= |id2_#in~x| 3)} {923#(<= |id_#in~x| id_~x)} #36#return; {878#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:11:39,284 INFO L280 TraceCheckUtils]: 27: Hoare triple {878#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {878#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:11:39,284 INFO L280 TraceCheckUtils]: 28: Hoare triple {878#(<= |id_#in~x| 4)} assume true; {878#(<= |id_#in~x| 4)} is VALID [2020-07-28 19:11:39,285 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {878#(<= |id_#in~x| 4)} {826#(<= 5 ULTIMATE.start_main_~input~0)} #34#return; {825#false} is VALID [2020-07-28 19:11:39,285 INFO L280 TraceCheckUtils]: 30: Hoare triple {825#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {825#false} is VALID [2020-07-28 19:11:39,285 INFO L280 TraceCheckUtils]: 31: Hoare triple {825#false} assume 5 != main_~result~0; {825#false} is VALID [2020-07-28 19:11:39,285 INFO L280 TraceCheckUtils]: 32: Hoare triple {825#false} assume !false; {825#false} is VALID [2020-07-28 19:11:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-28 19:11:39,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:11:39,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2020-07-28 19:11:39,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596448830] [2020-07-28 19:11:39,288 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2020-07-28 19:11:39,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:11:39,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-28 19:11:39,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:11:39,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-28 19:11:39,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:11:39,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-28 19:11:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-28 19:11:39,347 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 13 states. [2020-07-28 19:11:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:39,717 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2020-07-28 19:11:39,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 19:11:39,718 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2020-07-28 19:11:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:11:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 19:11:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2020-07-28 19:11:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 19:11:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2020-07-28 19:11:39,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 38 transitions. [2020-07-28 19:11:39,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:11:39,778 INFO L225 Difference]: With dead ends: 47 [2020-07-28 19:11:39,778 INFO L226 Difference]: Without dead ends: 43 [2020-07-28 19:11:39,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2020-07-28 19:11:39,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-28 19:11:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2020-07-28 19:11:39,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:11:39,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 32 states. [2020-07-28 19:11:39,793 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 32 states. [2020-07-28 19:11:39,793 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 32 states. [2020-07-28 19:11:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:39,796 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-28 19:11:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-28 19:11:39,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:39,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:39,798 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 43 states. [2020-07-28 19:11:39,798 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 43 states. [2020-07-28 19:11:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:39,801 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-28 19:11:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-28 19:11:39,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:39,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:39,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:11:39,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:11:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-28 19:11:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-28 19:11:39,804 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 33 [2020-07-28 19:11:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:11:39,805 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-28 19:11:39,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-28 19:11:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-28 19:11:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-28 19:11:39,806 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:11:39,806 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:11:40,020 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:11:40,021 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:11:40,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:11:40,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1002836670, now seen corresponding path program 2 times [2020-07-28 19:11:40,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:11:40,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586442727] [2020-07-28 19:11:40,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:11:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:40,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:11:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:40,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:40,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:40,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:40,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:40,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:40,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {1200#true} assume 0 == ~x;#res := 0; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,493 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1200#true} #36#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:40,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,494 INFO L263 TraceCheckUtils]: 2: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,494 INFO L280 TraceCheckUtils]: 3: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,495 INFO L280 TraceCheckUtils]: 4: Hoare triple {1200#true} assume 0 == ~x;#res := 0; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,496 INFO L280 TraceCheckUtils]: 5: Hoare triple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,497 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1200#true} #36#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:40,498 INFO L280 TraceCheckUtils]: 7: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,499 INFO L280 TraceCheckUtils]: 8: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,500 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1200#true} #32#return; {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-28 19:11:40,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,502 INFO L263 TraceCheckUtils]: 2: Hoare triple {1200#true} call #t~ret1 := id(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,502 INFO L280 TraceCheckUtils]: 3: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,503 INFO L263 TraceCheckUtils]: 5: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,503 INFO L280 TraceCheckUtils]: 6: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,504 INFO L280 TraceCheckUtils]: 7: Hoare triple {1200#true} assume 0 == ~x;#res := 0; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,505 INFO L280 TraceCheckUtils]: 8: Hoare triple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,506 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1200#true} #36#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:40,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,508 INFO L280 TraceCheckUtils]: 11: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,509 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1200#true} #32#return; {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-28 19:11:40,510 INFO L280 TraceCheckUtils]: 13: Hoare triple {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-28 19:11:40,511 INFO L280 TraceCheckUtils]: 14: Hoare triple {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-28 19:11:40,512 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1200#true} #36#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-28 19:11:40,513 INFO L280 TraceCheckUtils]: 0: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,514 INFO L263 TraceCheckUtils]: 2: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,514 INFO L280 TraceCheckUtils]: 3: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,515 INFO L280 TraceCheckUtils]: 4: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,515 INFO L263 TraceCheckUtils]: 5: Hoare triple {1200#true} call #t~ret1 := id(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,515 INFO L280 TraceCheckUtils]: 6: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,515 INFO L280 TraceCheckUtils]: 7: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,516 INFO L263 TraceCheckUtils]: 8: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,516 INFO L280 TraceCheckUtils]: 9: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,517 INFO L280 TraceCheckUtils]: 10: Hoare triple {1200#true} assume 0 == ~x;#res := 0; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,518 INFO L280 TraceCheckUtils]: 11: Hoare triple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,520 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1200#true} #36#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:40,540 INFO L280 TraceCheckUtils]: 13: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,541 INFO L280 TraceCheckUtils]: 14: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,545 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1200#true} #32#return; {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-28 19:11:40,550 INFO L280 TraceCheckUtils]: 16: Hoare triple {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-28 19:11:40,553 INFO L280 TraceCheckUtils]: 17: Hoare triple {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-28 19:11:40,557 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1200#true} #36#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-28 19:11:40,558 INFO L280 TraceCheckUtils]: 19: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:11:40,559 INFO L280 TraceCheckUtils]: 20: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:11:40,560 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1200#true} #32#return; {1290#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-28 19:11:40,561 INFO L280 TraceCheckUtils]: 0: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,561 INFO L263 TraceCheckUtils]: 2: Hoare triple {1200#true} call #t~ret1 := id(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,562 INFO L280 TraceCheckUtils]: 3: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,562 INFO L263 TraceCheckUtils]: 5: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,562 INFO L280 TraceCheckUtils]: 6: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,562 INFO L280 TraceCheckUtils]: 7: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,563 INFO L263 TraceCheckUtils]: 8: Hoare triple {1200#true} call #t~ret1 := id(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,563 INFO L280 TraceCheckUtils]: 9: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,563 INFO L263 TraceCheckUtils]: 11: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,563 INFO L280 TraceCheckUtils]: 12: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,564 INFO L280 TraceCheckUtils]: 13: Hoare triple {1200#true} assume 0 == ~x;#res := 0; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,567 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1200#true} #36#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:40,569 INFO L280 TraceCheckUtils]: 16: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,570 INFO L280 TraceCheckUtils]: 17: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,571 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1200#true} #32#return; {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-28 19:11:40,572 INFO L280 TraceCheckUtils]: 19: Hoare triple {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-28 19:11:40,572 INFO L280 TraceCheckUtils]: 20: Hoare triple {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-28 19:11:40,573 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1200#true} #36#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-28 19:11:40,574 INFO L280 TraceCheckUtils]: 22: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:11:40,575 INFO L280 TraceCheckUtils]: 23: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:11:40,576 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1200#true} #32#return; {1290#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-28 19:11:40,577 INFO L280 TraceCheckUtils]: 25: Hoare triple {1290#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-28 19:11:40,578 INFO L280 TraceCheckUtils]: 26: Hoare triple {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-28 19:11:40,579 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1200#true} #36#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-28 19:11:40,581 INFO L280 TraceCheckUtils]: 0: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,582 INFO L263 TraceCheckUtils]: 2: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,582 INFO L280 TraceCheckUtils]: 3: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,583 INFO L280 TraceCheckUtils]: 4: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,583 INFO L263 TraceCheckUtils]: 5: Hoare triple {1200#true} call #t~ret1 := id(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,584 INFO L280 TraceCheckUtils]: 6: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,584 INFO L280 TraceCheckUtils]: 7: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,584 INFO L263 TraceCheckUtils]: 8: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,584 INFO L280 TraceCheckUtils]: 9: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,585 INFO L280 TraceCheckUtils]: 10: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,585 INFO L263 TraceCheckUtils]: 11: Hoare triple {1200#true} call #t~ret1 := id(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,585 INFO L280 TraceCheckUtils]: 12: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,585 INFO L280 TraceCheckUtils]: 13: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,586 INFO L263 TraceCheckUtils]: 14: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,586 INFO L280 TraceCheckUtils]: 15: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,586 INFO L280 TraceCheckUtils]: 16: Hoare triple {1200#true} assume 0 == ~x;#res := 0; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,587 INFO L280 TraceCheckUtils]: 17: Hoare triple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,588 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1200#true} #36#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:40,589 INFO L280 TraceCheckUtils]: 19: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,590 INFO L280 TraceCheckUtils]: 20: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,591 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1200#true} #32#return; {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-28 19:11:40,592 INFO L280 TraceCheckUtils]: 22: Hoare triple {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-28 19:11:40,593 INFO L280 TraceCheckUtils]: 23: Hoare triple {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-28 19:11:40,594 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1200#true} #36#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-28 19:11:40,595 INFO L280 TraceCheckUtils]: 25: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:11:40,596 INFO L280 TraceCheckUtils]: 26: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:11:40,599 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1200#true} #32#return; {1290#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-28 19:11:40,600 INFO L280 TraceCheckUtils]: 28: Hoare triple {1290#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-28 19:11:40,601 INFO L280 TraceCheckUtils]: 29: Hoare triple {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-28 19:11:40,602 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1200#true} #36#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-28 19:11:40,603 INFO L280 TraceCheckUtils]: 31: Hoare triple {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-28 19:11:40,603 INFO L280 TraceCheckUtils]: 32: Hoare triple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-28 19:11:40,604 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1200#true} #34#return; {1236#(and (<= |ULTIMATE.start_main_#t~ret2| 5) (<= 5 |ULTIMATE.start_main_#t~ret2|))} is VALID [2020-07-28 19:11:40,606 INFO L280 TraceCheckUtils]: 0: Hoare triple {1200#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {1200#true} is VALID [2020-07-28 19:11:40,606 INFO L263 TraceCheckUtils]: 1: Hoare triple {1200#true} call main_#t~ret2 := id(main_~input~0); {1200#true} is VALID [2020-07-28 19:11:40,607 INFO L280 TraceCheckUtils]: 2: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,607 INFO L280 TraceCheckUtils]: 3: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,607 INFO L263 TraceCheckUtils]: 4: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,607 INFO L280 TraceCheckUtils]: 5: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,607 INFO L280 TraceCheckUtils]: 6: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,608 INFO L263 TraceCheckUtils]: 7: Hoare triple {1200#true} call #t~ret1 := id(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,608 INFO L280 TraceCheckUtils]: 8: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,608 INFO L280 TraceCheckUtils]: 9: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,608 INFO L263 TraceCheckUtils]: 10: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,608 INFO L280 TraceCheckUtils]: 11: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,609 INFO L280 TraceCheckUtils]: 12: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,609 INFO L263 TraceCheckUtils]: 13: Hoare triple {1200#true} call #t~ret1 := id(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,609 INFO L280 TraceCheckUtils]: 14: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,609 INFO L280 TraceCheckUtils]: 15: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,609 INFO L263 TraceCheckUtils]: 16: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,610 INFO L280 TraceCheckUtils]: 17: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,610 INFO L280 TraceCheckUtils]: 18: Hoare triple {1200#true} assume 0 == ~x;#res := 0; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,611 INFO L280 TraceCheckUtils]: 19: Hoare triple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,612 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1200#true} #36#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:40,613 INFO L280 TraceCheckUtils]: 21: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,614 INFO L280 TraceCheckUtils]: 22: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,615 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1200#true} #32#return; {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-28 19:11:40,619 INFO L280 TraceCheckUtils]: 24: Hoare triple {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-28 19:11:40,619 INFO L280 TraceCheckUtils]: 25: Hoare triple {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-28 19:11:40,621 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1200#true} #36#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-28 19:11:40,622 INFO L280 TraceCheckUtils]: 27: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:11:40,622 INFO L280 TraceCheckUtils]: 28: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:11:40,624 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1200#true} #32#return; {1290#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-28 19:11:40,625 INFO L280 TraceCheckUtils]: 30: Hoare triple {1290#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-28 19:11:40,628 INFO L280 TraceCheckUtils]: 31: Hoare triple {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-28 19:11:40,635 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1200#true} #36#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-28 19:11:40,636 INFO L280 TraceCheckUtils]: 33: Hoare triple {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-28 19:11:40,637 INFO L280 TraceCheckUtils]: 34: Hoare triple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-28 19:11:40,638 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1200#true} #34#return; {1236#(and (<= |ULTIMATE.start_main_#t~ret2| 5) (<= 5 |ULTIMATE.start_main_#t~ret2|))} is VALID [2020-07-28 19:11:40,639 INFO L280 TraceCheckUtils]: 36: Hoare triple {1236#(and (<= |ULTIMATE.start_main_#t~ret2| 5) (<= 5 |ULTIMATE.start_main_#t~ret2|))} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {1237#(and (<= ULTIMATE.start_main_~result~0 5) (<= 5 ULTIMATE.start_main_~result~0))} is VALID [2020-07-28 19:11:40,639 INFO L280 TraceCheckUtils]: 37: Hoare triple {1237#(and (<= ULTIMATE.start_main_~result~0 5) (<= 5 ULTIMATE.start_main_~result~0))} assume 5 != main_~result~0; {1201#false} is VALID [2020-07-28 19:11:40,639 INFO L280 TraceCheckUtils]: 38: Hoare triple {1201#false} assume !false; {1201#false} is VALID [2020-07-28 19:11:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-28 19:11:40,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586442727] [2020-07-28 19:11:40,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400736087] [2020-07-28 19:11:40,643 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 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:11:40,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 19:11:40,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 19:11:40,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-28 19:11:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:40,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:11:40,874 INFO L280 TraceCheckUtils]: 0: Hoare triple {1200#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {1200#true} is VALID [2020-07-28 19:11:40,874 INFO L263 TraceCheckUtils]: 1: Hoare triple {1200#true} call main_#t~ret2 := id(main_~input~0); {1200#true} is VALID [2020-07-28 19:11:40,874 INFO L280 TraceCheckUtils]: 2: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,874 INFO L280 TraceCheckUtils]: 3: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,874 INFO L263 TraceCheckUtils]: 4: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,875 INFO L280 TraceCheckUtils]: 5: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,875 INFO L280 TraceCheckUtils]: 6: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,875 INFO L263 TraceCheckUtils]: 7: Hoare triple {1200#true} call #t~ret1 := id(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,875 INFO L280 TraceCheckUtils]: 8: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,875 INFO L280 TraceCheckUtils]: 9: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,876 INFO L263 TraceCheckUtils]: 10: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,876 INFO L280 TraceCheckUtils]: 11: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,876 INFO L280 TraceCheckUtils]: 12: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,876 INFO L263 TraceCheckUtils]: 13: Hoare triple {1200#true} call #t~ret1 := id(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,877 INFO L280 TraceCheckUtils]: 14: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,877 INFO L280 TraceCheckUtils]: 15: Hoare triple {1200#true} assume !(0 == ~x); {1200#true} is VALID [2020-07-28 19:11:40,877 INFO L263 TraceCheckUtils]: 16: Hoare triple {1200#true} call #t~ret0 := id2(~x - 1); {1200#true} is VALID [2020-07-28 19:11:40,877 INFO L280 TraceCheckUtils]: 17: Hoare triple {1200#true} ~x := #in~x; {1200#true} is VALID [2020-07-28 19:11:40,879 INFO L280 TraceCheckUtils]: 18: Hoare triple {1200#true} assume 0 == ~x;#res := 0; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,879 INFO L280 TraceCheckUtils]: 19: Hoare triple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-28 19:11:40,880 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1328#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1200#true} #36#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:40,881 INFO L280 TraceCheckUtils]: 21: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,881 INFO L280 TraceCheckUtils]: 22: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-28 19:11:40,882 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1200#true} #32#return; {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-28 19:11:40,886 INFO L280 TraceCheckUtils]: 24: Hoare triple {1320#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-28 19:11:40,887 INFO L280 TraceCheckUtils]: 25: Hoare triple {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-28 19:11:40,888 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1321#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1200#true} #36#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-28 19:11:40,888 INFO L280 TraceCheckUtils]: 27: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:11:40,889 INFO L280 TraceCheckUtils]: 28: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-28 19:11:40,890 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1200#true} #32#return; {1290#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-28 19:11:40,891 INFO L280 TraceCheckUtils]: 30: Hoare triple {1290#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-28 19:11:40,893 INFO L280 TraceCheckUtils]: 31: Hoare triple {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-28 19:11:40,895 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1291#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1200#true} #36#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-28 19:11:40,897 INFO L280 TraceCheckUtils]: 33: Hoare triple {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-28 19:11:40,898 INFO L280 TraceCheckUtils]: 34: Hoare triple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-28 19:11:40,899 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1200#true} #34#return; {1236#(and (<= |ULTIMATE.start_main_#t~ret2| 5) (<= 5 |ULTIMATE.start_main_#t~ret2|))} is VALID [2020-07-28 19:11:40,903 INFO L280 TraceCheckUtils]: 36: Hoare triple {1236#(and (<= |ULTIMATE.start_main_#t~ret2| 5) (<= 5 |ULTIMATE.start_main_#t~ret2|))} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {1237#(and (<= ULTIMATE.start_main_~result~0 5) (<= 5 ULTIMATE.start_main_~result~0))} is VALID [2020-07-28 19:11:40,904 INFO L280 TraceCheckUtils]: 37: Hoare triple {1237#(and (<= ULTIMATE.start_main_~result~0 5) (<= 5 ULTIMATE.start_main_~result~0))} assume 5 != main_~result~0; {1201#false} is VALID [2020-07-28 19:11:40,905 INFO L280 TraceCheckUtils]: 38: Hoare triple {1201#false} assume !false; {1201#false} is VALID [2020-07-28 19:11:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-28 19:11:40,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:11:40,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2020-07-28 19:11:40,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652404604] [2020-07-28 19:11:40,909 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2020-07-28 19:11:40,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:11:40,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-28 19:11:40,951 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:11:40,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-28 19:11:40,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:11:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-28 19:11:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-28 19:11:40,952 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 15 states. [2020-07-28 19:11:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:41,487 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-28 19:11:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-28 19:11:41,487 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2020-07-28 19:11:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:11:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 19:11:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2020-07-28 19:11:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 19:11:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2020-07-28 19:11:41,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 41 transitions. [2020-07-28 19:11:41,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:11:41,548 INFO L225 Difference]: With dead ends: 53 [2020-07-28 19:11:41,548 INFO L226 Difference]: Without dead ends: 49 [2020-07-28 19:11:41,549 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:11:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-28 19:11:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2020-07-28 19:11:41,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:11:41,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 35 states. [2020-07-28 19:11:41,562 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 35 states. [2020-07-28 19:11:41,562 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 35 states. [2020-07-28 19:11:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:41,565 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-28 19:11:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-28 19:11:41,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:41,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:41,566 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 49 states. [2020-07-28 19:11:41,566 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 49 states. [2020-07-28 19:11:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:41,568 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-28 19:11:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-28 19:11:41,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:41,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:41,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:11:41,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:11:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-28 19:11:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-28 19:11:41,571 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 39 [2020-07-28 19:11:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:11:41,571 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-28 19:11:41,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-28 19:11:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-28 19:11:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-28 19:11:41,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:11:41,573 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:11:41,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:11:41,787 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:11:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:11:41,788 INFO L82 PathProgramCache]: Analyzing trace with hash 688258629, now seen corresponding path program 3 times [2020-07-28 19:11:41,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:11:41,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042526625] [2020-07-28 19:11:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:11:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:41,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:11:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:41,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:41,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:41,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:41,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:42,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:42,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:42,069 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,070 INFO L280 TraceCheckUtils]: 1: Hoare triple {1684#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,071 INFO L280 TraceCheckUtils]: 2: Hoare triple {1806#(= 0 |id_#in~x|)} assume true; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,072 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1806#(= 0 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,072 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,074 INFO L280 TraceCheckUtils]: 1: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,074 INFO L263 TraceCheckUtils]: 2: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,074 INFO L280 TraceCheckUtils]: 3: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,075 INFO L280 TraceCheckUtils]: 4: Hoare triple {1684#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,075 INFO L280 TraceCheckUtils]: 5: Hoare triple {1806#(= 0 |id_#in~x|)} assume true; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,076 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1806#(= 0 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,077 INFO L280 TraceCheckUtils]: 7: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,077 INFO L280 TraceCheckUtils]: 8: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume true; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,078 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1805#(<= 1 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {1684#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,080 INFO L263 TraceCheckUtils]: 2: Hoare triple {1684#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,081 INFO L280 TraceCheckUtils]: 3: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,082 INFO L280 TraceCheckUtils]: 4: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,082 INFO L263 TraceCheckUtils]: 5: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,082 INFO L280 TraceCheckUtils]: 6: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,083 INFO L280 TraceCheckUtils]: 7: Hoare triple {1684#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,083 INFO L280 TraceCheckUtils]: 8: Hoare triple {1806#(= 0 |id_#in~x|)} assume true; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,084 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1806#(= 0 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,085 INFO L280 TraceCheckUtils]: 10: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,085 INFO L280 TraceCheckUtils]: 11: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume true; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,086 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1805#(<= 1 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,087 INFO L280 TraceCheckUtils]: 13: Hoare triple {1800#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,087 INFO L280 TraceCheckUtils]: 14: Hoare triple {1800#(<= 2 |id_#in~x|)} assume true; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,089 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1800#(<= 2 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,090 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,090 INFO L280 TraceCheckUtils]: 1: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,090 INFO L263 TraceCheckUtils]: 2: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,091 INFO L280 TraceCheckUtils]: 3: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,092 INFO L280 TraceCheckUtils]: 4: Hoare triple {1684#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,092 INFO L263 TraceCheckUtils]: 5: Hoare triple {1684#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,093 INFO L280 TraceCheckUtils]: 6: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,093 INFO L280 TraceCheckUtils]: 7: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,094 INFO L263 TraceCheckUtils]: 8: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,094 INFO L280 TraceCheckUtils]: 9: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,094 INFO L280 TraceCheckUtils]: 10: Hoare triple {1684#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,095 INFO L280 TraceCheckUtils]: 11: Hoare triple {1806#(= 0 |id_#in~x|)} assume true; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,096 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1806#(= 0 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,096 INFO L280 TraceCheckUtils]: 13: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,097 INFO L280 TraceCheckUtils]: 14: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume true; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,098 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1805#(<= 1 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,098 INFO L280 TraceCheckUtils]: 16: Hoare triple {1800#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,099 INFO L280 TraceCheckUtils]: 17: Hoare triple {1800#(<= 2 |id_#in~x|)} assume true; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,100 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1800#(<= 2 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,101 INFO L280 TraceCheckUtils]: 19: Hoare triple {1789#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,101 INFO L280 TraceCheckUtils]: 20: Hoare triple {1789#(<= 3 |id2_#in~x|)} assume true; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,102 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1789#(<= 3 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,104 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {1684#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,104 INFO L263 TraceCheckUtils]: 2: Hoare triple {1684#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,105 INFO L280 TraceCheckUtils]: 3: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,105 INFO L280 TraceCheckUtils]: 4: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,105 INFO L263 TraceCheckUtils]: 5: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,106 INFO L280 TraceCheckUtils]: 6: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,106 INFO L280 TraceCheckUtils]: 7: Hoare triple {1684#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,106 INFO L263 TraceCheckUtils]: 8: Hoare triple {1684#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,107 INFO L280 TraceCheckUtils]: 9: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,107 INFO L280 TraceCheckUtils]: 10: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,107 INFO L263 TraceCheckUtils]: 11: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,108 INFO L280 TraceCheckUtils]: 12: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,108 INFO L280 TraceCheckUtils]: 13: Hoare triple {1684#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,109 INFO L280 TraceCheckUtils]: 14: Hoare triple {1806#(= 0 |id_#in~x|)} assume true; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,110 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1806#(= 0 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,110 INFO L280 TraceCheckUtils]: 16: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,110 INFO L280 TraceCheckUtils]: 17: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume true; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,112 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1805#(<= 1 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,113 INFO L280 TraceCheckUtils]: 19: Hoare triple {1800#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,113 INFO L280 TraceCheckUtils]: 20: Hoare triple {1800#(<= 2 |id_#in~x|)} assume true; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,115 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1800#(<= 2 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,115 INFO L280 TraceCheckUtils]: 22: Hoare triple {1789#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,116 INFO L280 TraceCheckUtils]: 23: Hoare triple {1789#(<= 3 |id2_#in~x|)} assume true; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,117 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1789#(<= 3 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,117 INFO L280 TraceCheckUtils]: 25: Hoare triple {1772#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,118 INFO L280 TraceCheckUtils]: 26: Hoare triple {1772#(<= 4 |id_#in~x|)} assume true; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,119 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1772#(<= 4 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,120 INFO L263 TraceCheckUtils]: 2: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,122 INFO L280 TraceCheckUtils]: 3: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,122 INFO L280 TraceCheckUtils]: 4: Hoare triple {1684#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,123 INFO L263 TraceCheckUtils]: 5: Hoare triple {1684#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,123 INFO L280 TraceCheckUtils]: 6: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,124 INFO L280 TraceCheckUtils]: 7: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,124 INFO L263 TraceCheckUtils]: 8: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,125 INFO L280 TraceCheckUtils]: 9: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,126 INFO L280 TraceCheckUtils]: 10: Hoare triple {1684#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,126 INFO L263 TraceCheckUtils]: 11: Hoare triple {1684#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,126 INFO L280 TraceCheckUtils]: 12: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,127 INFO L280 TraceCheckUtils]: 13: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,127 INFO L263 TraceCheckUtils]: 14: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,128 INFO L280 TraceCheckUtils]: 15: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,129 INFO L280 TraceCheckUtils]: 16: Hoare triple {1684#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,129 INFO L280 TraceCheckUtils]: 17: Hoare triple {1806#(= 0 |id_#in~x|)} assume true; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,131 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1806#(= 0 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,132 INFO L280 TraceCheckUtils]: 19: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,132 INFO L280 TraceCheckUtils]: 20: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume true; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,134 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1805#(<= 1 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,135 INFO L280 TraceCheckUtils]: 22: Hoare triple {1800#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,135 INFO L280 TraceCheckUtils]: 23: Hoare triple {1800#(<= 2 |id_#in~x|)} assume true; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,137 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1800#(<= 2 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,138 INFO L280 TraceCheckUtils]: 25: Hoare triple {1789#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,138 INFO L280 TraceCheckUtils]: 26: Hoare triple {1789#(<= 3 |id2_#in~x|)} assume true; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,140 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1789#(<= 3 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,140 INFO L280 TraceCheckUtils]: 28: Hoare triple {1772#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,141 INFO L280 TraceCheckUtils]: 29: Hoare triple {1772#(<= 4 |id_#in~x|)} assume true; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,142 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1772#(<= 4 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,143 INFO L280 TraceCheckUtils]: 31: Hoare triple {1749#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,144 INFO L280 TraceCheckUtils]: 32: Hoare triple {1749#(<= 5 |id2_#in~x|)} assume true; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,145 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1749#(<= 5 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1719#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:11:42,147 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,147 INFO L280 TraceCheckUtils]: 1: Hoare triple {1684#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,148 INFO L263 TraceCheckUtils]: 2: Hoare triple {1684#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,148 INFO L280 TraceCheckUtils]: 3: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,149 INFO L280 TraceCheckUtils]: 4: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,149 INFO L263 TraceCheckUtils]: 5: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,150 INFO L280 TraceCheckUtils]: 6: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,150 INFO L280 TraceCheckUtils]: 7: Hoare triple {1684#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,151 INFO L263 TraceCheckUtils]: 8: Hoare triple {1684#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,151 INFO L280 TraceCheckUtils]: 9: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,152 INFO L280 TraceCheckUtils]: 10: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,152 INFO L263 TraceCheckUtils]: 11: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,153 INFO L280 TraceCheckUtils]: 12: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,153 INFO L280 TraceCheckUtils]: 13: Hoare triple {1684#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,153 INFO L263 TraceCheckUtils]: 14: Hoare triple {1684#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,163 INFO L280 TraceCheckUtils]: 15: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,167 INFO L280 TraceCheckUtils]: 16: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,168 INFO L263 TraceCheckUtils]: 17: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,168 INFO L280 TraceCheckUtils]: 18: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,169 INFO L280 TraceCheckUtils]: 19: Hoare triple {1684#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,170 INFO L280 TraceCheckUtils]: 20: Hoare triple {1806#(= 0 |id_#in~x|)} assume true; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,171 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1806#(= 0 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,171 INFO L280 TraceCheckUtils]: 22: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,172 INFO L280 TraceCheckUtils]: 23: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume true; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,173 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1805#(<= 1 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,174 INFO L280 TraceCheckUtils]: 25: Hoare triple {1800#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,175 INFO L280 TraceCheckUtils]: 26: Hoare triple {1800#(<= 2 |id_#in~x|)} assume true; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,177 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1800#(<= 2 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,178 INFO L280 TraceCheckUtils]: 28: Hoare triple {1789#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,178 INFO L280 TraceCheckUtils]: 29: Hoare triple {1789#(<= 3 |id2_#in~x|)} assume true; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,179 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1789#(<= 3 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,180 INFO L280 TraceCheckUtils]: 31: Hoare triple {1772#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,180 INFO L280 TraceCheckUtils]: 32: Hoare triple {1772#(<= 4 |id_#in~x|)} assume true; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,181 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1772#(<= 4 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,181 INFO L280 TraceCheckUtils]: 34: Hoare triple {1749#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,182 INFO L280 TraceCheckUtils]: 35: Hoare triple {1749#(<= 5 |id2_#in~x|)} assume true; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,189 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1749#(<= 5 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1719#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:11:42,190 INFO L280 TraceCheckUtils]: 37: Hoare triple {1719#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1719#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:11:42,191 INFO L280 TraceCheckUtils]: 38: Hoare triple {1719#(<= 6 |id_#in~x|)} assume true; {1719#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:11:42,192 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1719#(<= 6 |id_#in~x|)} {1643#(<= ULTIMATE.start_main_~input~0 5)} #34#return; {1642#false} is VALID [2020-07-28 19:11:42,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {1643#(<= ULTIMATE.start_main_~input~0 5)} is VALID [2020-07-28 19:11:42,211 INFO L263 TraceCheckUtils]: 1: Hoare triple {1643#(<= ULTIMATE.start_main_~input~0 5)} call main_#t~ret2 := id(main_~input~0); {1641#true} is VALID [2020-07-28 19:11:42,212 INFO L280 TraceCheckUtils]: 2: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,213 INFO L280 TraceCheckUtils]: 3: Hoare triple {1684#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,213 INFO L263 TraceCheckUtils]: 4: Hoare triple {1684#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,214 INFO L280 TraceCheckUtils]: 5: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,215 INFO L280 TraceCheckUtils]: 6: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,215 INFO L263 TraceCheckUtils]: 7: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,215 INFO L280 TraceCheckUtils]: 8: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,216 INFO L280 TraceCheckUtils]: 9: Hoare triple {1684#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,216 INFO L263 TraceCheckUtils]: 10: Hoare triple {1684#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,217 INFO L280 TraceCheckUtils]: 11: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,217 INFO L280 TraceCheckUtils]: 12: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,217 INFO L263 TraceCheckUtils]: 13: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,218 INFO L280 TraceCheckUtils]: 14: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,218 INFO L280 TraceCheckUtils]: 15: Hoare triple {1684#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,218 INFO L263 TraceCheckUtils]: 16: Hoare triple {1684#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,219 INFO L280 TraceCheckUtils]: 17: Hoare triple {1641#true} ~x := #in~x; {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,219 INFO L280 TraceCheckUtils]: 18: Hoare triple {1720#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1720#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,219 INFO L263 TraceCheckUtils]: 19: Hoare triple {1720#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,220 INFO L280 TraceCheckUtils]: 20: Hoare triple {1641#true} ~x := #in~x; {1684#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:42,220 INFO L280 TraceCheckUtils]: 21: Hoare triple {1684#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,221 INFO L280 TraceCheckUtils]: 22: Hoare triple {1806#(= 0 |id_#in~x|)} assume true; {1806#(= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,221 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1806#(= 0 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,222 INFO L280 TraceCheckUtils]: 24: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,222 INFO L280 TraceCheckUtils]: 25: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume true; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,223 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1805#(<= 1 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,224 INFO L280 TraceCheckUtils]: 27: Hoare triple {1800#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,224 INFO L280 TraceCheckUtils]: 28: Hoare triple {1800#(<= 2 |id_#in~x|)} assume true; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,225 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1800#(<= 2 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,225 INFO L280 TraceCheckUtils]: 30: Hoare triple {1789#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,226 INFO L280 TraceCheckUtils]: 31: Hoare triple {1789#(<= 3 |id2_#in~x|)} assume true; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,227 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1789#(<= 3 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,228 INFO L280 TraceCheckUtils]: 33: Hoare triple {1772#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,228 INFO L280 TraceCheckUtils]: 34: Hoare triple {1772#(<= 4 |id_#in~x|)} assume true; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,230 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1772#(<= 4 |id_#in~x|)} {1720#(= id2_~x |id2_#in~x|)} #32#return; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,230 INFO L280 TraceCheckUtils]: 36: Hoare triple {1749#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,231 INFO L280 TraceCheckUtils]: 37: Hoare triple {1749#(<= 5 |id2_#in~x|)} assume true; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,232 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1749#(<= 5 |id2_#in~x|)} {1684#(= |id_#in~x| id_~x)} #36#return; {1719#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:11:42,232 INFO L280 TraceCheckUtils]: 39: Hoare triple {1719#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1719#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:11:42,233 INFO L280 TraceCheckUtils]: 40: Hoare triple {1719#(<= 6 |id_#in~x|)} assume true; {1719#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:11:42,234 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1719#(<= 6 |id_#in~x|)} {1643#(<= ULTIMATE.start_main_~input~0 5)} #34#return; {1642#false} is VALID [2020-07-28 19:11:42,234 INFO L280 TraceCheckUtils]: 42: Hoare triple {1642#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {1642#false} is VALID [2020-07-28 19:11:42,234 INFO L280 TraceCheckUtils]: 43: Hoare triple {1642#false} assume 5 != main_~result~0; {1642#false} is VALID [2020-07-28 19:11:42,234 INFO L280 TraceCheckUtils]: 44: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2020-07-28 19:11:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-28 19:11:42,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042526625] [2020-07-28 19:11:42,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254491176] [2020-07-28 19:11:42,237 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 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:11:42,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-28 19:11:42,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 19:11:42,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-28 19:11:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:42,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:11:42,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {1641#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {1643#(<= ULTIMATE.start_main_~input~0 5)} is VALID [2020-07-28 19:11:42,816 INFO L263 TraceCheckUtils]: 1: Hoare triple {1643#(<= ULTIMATE.start_main_~input~0 5)} call main_#t~ret2 := id(main_~input~0); {1641#true} is VALID [2020-07-28 19:11:42,817 INFO L280 TraceCheckUtils]: 2: Hoare triple {1641#true} ~x := #in~x; {1816#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:42,817 INFO L280 TraceCheckUtils]: 3: Hoare triple {1816#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1816#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:42,817 INFO L263 TraceCheckUtils]: 4: Hoare triple {1816#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,818 INFO L280 TraceCheckUtils]: 5: Hoare triple {1641#true} ~x := #in~x; {1826#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,818 INFO L280 TraceCheckUtils]: 6: Hoare triple {1826#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1826#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,818 INFO L263 TraceCheckUtils]: 7: Hoare triple {1826#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,819 INFO L280 TraceCheckUtils]: 8: Hoare triple {1641#true} ~x := #in~x; {1816#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:42,819 INFO L280 TraceCheckUtils]: 9: Hoare triple {1816#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1816#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:42,819 INFO L263 TraceCheckUtils]: 10: Hoare triple {1816#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,820 INFO L280 TraceCheckUtils]: 11: Hoare triple {1641#true} ~x := #in~x; {1826#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,822 INFO L280 TraceCheckUtils]: 12: Hoare triple {1826#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1826#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,822 INFO L263 TraceCheckUtils]: 13: Hoare triple {1826#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,823 INFO L280 TraceCheckUtils]: 14: Hoare triple {1641#true} ~x := #in~x; {1816#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:42,823 INFO L280 TraceCheckUtils]: 15: Hoare triple {1816#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1816#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:42,823 INFO L263 TraceCheckUtils]: 16: Hoare triple {1816#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,824 INFO L280 TraceCheckUtils]: 17: Hoare triple {1641#true} ~x := #in~x; {1826#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,824 INFO L280 TraceCheckUtils]: 18: Hoare triple {1826#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1826#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:42,824 INFO L263 TraceCheckUtils]: 19: Hoare triple {1826#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1641#true} is VALID [2020-07-28 19:11:42,825 INFO L280 TraceCheckUtils]: 20: Hoare triple {1641#true} ~x := #in~x; {1816#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:42,826 INFO L280 TraceCheckUtils]: 21: Hoare triple {1816#(<= id_~x |id_#in~x|)} assume 0 == ~x;#res := 0; {1875#(<= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,826 INFO L280 TraceCheckUtils]: 22: Hoare triple {1875#(<= 0 |id_#in~x|)} assume true; {1875#(<= 0 |id_#in~x|)} is VALID [2020-07-28 19:11:42,828 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1875#(<= 0 |id_#in~x|)} {1826#(<= id2_~x |id2_#in~x|)} #32#return; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,831 INFO L280 TraceCheckUtils]: 24: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,838 INFO L280 TraceCheckUtils]: 25: Hoare triple {1805#(<= 1 |id2_#in~x|)} assume true; {1805#(<= 1 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,840 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1805#(<= 1 |id2_#in~x|)} {1816#(<= id_~x |id_#in~x|)} #36#return; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,840 INFO L280 TraceCheckUtils]: 27: Hoare triple {1800#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,841 INFO L280 TraceCheckUtils]: 28: Hoare triple {1800#(<= 2 |id_#in~x|)} assume true; {1800#(<= 2 |id_#in~x|)} is VALID [2020-07-28 19:11:42,842 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1800#(<= 2 |id_#in~x|)} {1826#(<= id2_~x |id2_#in~x|)} #32#return; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,843 INFO L280 TraceCheckUtils]: 30: Hoare triple {1789#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,844 INFO L280 TraceCheckUtils]: 31: Hoare triple {1789#(<= 3 |id2_#in~x|)} assume true; {1789#(<= 3 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,845 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1789#(<= 3 |id2_#in~x|)} {1816#(<= id_~x |id_#in~x|)} #36#return; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,846 INFO L280 TraceCheckUtils]: 33: Hoare triple {1772#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,846 INFO L280 TraceCheckUtils]: 34: Hoare triple {1772#(<= 4 |id_#in~x|)} assume true; {1772#(<= 4 |id_#in~x|)} is VALID [2020-07-28 19:11:42,848 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1772#(<= 4 |id_#in~x|)} {1826#(<= id2_~x |id2_#in~x|)} #32#return; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,849 INFO L280 TraceCheckUtils]: 36: Hoare triple {1749#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,849 INFO L280 TraceCheckUtils]: 37: Hoare triple {1749#(<= 5 |id2_#in~x|)} assume true; {1749#(<= 5 |id2_#in~x|)} is VALID [2020-07-28 19:11:42,855 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1749#(<= 5 |id2_#in~x|)} {1816#(<= id_~x |id_#in~x|)} #36#return; {1719#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:11:42,856 INFO L280 TraceCheckUtils]: 39: Hoare triple {1719#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1719#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:11:42,856 INFO L280 TraceCheckUtils]: 40: Hoare triple {1719#(<= 6 |id_#in~x|)} assume true; {1719#(<= 6 |id_#in~x|)} is VALID [2020-07-28 19:11:42,858 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1719#(<= 6 |id_#in~x|)} {1643#(<= ULTIMATE.start_main_~input~0 5)} #34#return; {1642#false} is VALID [2020-07-28 19:11:42,858 INFO L280 TraceCheckUtils]: 42: Hoare triple {1642#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {1642#false} is VALID [2020-07-28 19:11:42,858 INFO L280 TraceCheckUtils]: 43: Hoare triple {1642#false} assume 5 != main_~result~0; {1642#false} is VALID [2020-07-28 19:11:42,858 INFO L280 TraceCheckUtils]: 44: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2020-07-28 19:11:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-28 19:11:42,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 19:11:42,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 15 [2020-07-28 19:11:42,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081491053] [2020-07-28 19:11:42,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2020-07-28 19:11:42,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:11:42,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-28 19:11:42,906 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:11:42,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-28 19:11:42,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:11:42,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-28 19:11:42,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-07-28 19:11:42,907 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 12 states. [2020-07-28 19:11:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:43,428 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-28 19:11:43,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-28 19:11:43,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2020-07-28 19:11:43,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:11:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 19:11:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2020-07-28 19:11:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 19:11:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2020-07-28 19:11:43,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2020-07-28 19:11:43,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:11:43,504 INFO L225 Difference]: With dead ends: 59 [2020-07-28 19:11:43,504 INFO L226 Difference]: Without dead ends: 35 [2020-07-28 19:11:43,505 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2020-07-28 19:11:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-28 19:11:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-28 19:11:43,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:11:43,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-28 19:11:43,516 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-28 19:11:43,516 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-28 19:11:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:43,518 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2020-07-28 19:11:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-28 19:11:43,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:43,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:43,519 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-28 19:11:43,519 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-28 19:11:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:43,521 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2020-07-28 19:11:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-28 19:11:43,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:43,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:43,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:11:43,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:11:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-28 19:11:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-07-28 19:11:43,524 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 45 [2020-07-28 19:11:43,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:11:43,525 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-07-28 19:11:43,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-28 19:11:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-28 19:11:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-28 19:11:43,526 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:11:43,527 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:11:43,757 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-28 19:11:43,758 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:11:43,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:11:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash -77349110, now seen corresponding path program 3 times [2020-07-28 19:11:43,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:11:43,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722482220] [2020-07-28 19:11:43,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:11:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:43,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:11:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:43,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:43,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:43,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:43,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:43,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:43,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:44,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:44,025 INFO L280 TraceCheckUtils]: 0: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,025 INFO L280 TraceCheckUtils]: 1: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {2344#(= 0 |id2_#in~x|)} assume true; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,027 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2344#(= 0 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,029 INFO L263 TraceCheckUtils]: 2: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,030 INFO L280 TraceCheckUtils]: 3: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,030 INFO L280 TraceCheckUtils]: 4: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,031 INFO L280 TraceCheckUtils]: 5: Hoare triple {2344#(= 0 |id2_#in~x|)} assume true; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,032 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2344#(= 0 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,032 INFO L280 TraceCheckUtils]: 7: Hoare triple {2343#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {2343#(<= 1 |id_#in~x|)} assume true; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,034 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2343#(<= 1 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,035 INFO L280 TraceCheckUtils]: 0: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,036 INFO L280 TraceCheckUtils]: 1: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,036 INFO L263 TraceCheckUtils]: 2: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,036 INFO L280 TraceCheckUtils]: 3: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,037 INFO L280 TraceCheckUtils]: 4: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,037 INFO L263 TraceCheckUtils]: 5: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,038 INFO L280 TraceCheckUtils]: 6: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,039 INFO L280 TraceCheckUtils]: 7: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,039 INFO L280 TraceCheckUtils]: 8: Hoare triple {2344#(= 0 |id2_#in~x|)} assume true; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,040 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2344#(= 0 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,041 INFO L280 TraceCheckUtils]: 10: Hoare triple {2343#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,041 INFO L280 TraceCheckUtils]: 11: Hoare triple {2343#(<= 1 |id_#in~x|)} assume true; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,043 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2343#(<= 1 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,043 INFO L280 TraceCheckUtils]: 13: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,044 INFO L280 TraceCheckUtils]: 14: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume true; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,045 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2338#(<= 2 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,048 INFO L263 TraceCheckUtils]: 2: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,048 INFO L280 TraceCheckUtils]: 3: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,049 INFO L280 TraceCheckUtils]: 4: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,049 INFO L263 TraceCheckUtils]: 5: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,050 INFO L280 TraceCheckUtils]: 6: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,050 INFO L280 TraceCheckUtils]: 7: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,051 INFO L263 TraceCheckUtils]: 8: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,051 INFO L280 TraceCheckUtils]: 9: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,052 INFO L280 TraceCheckUtils]: 10: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,053 INFO L280 TraceCheckUtils]: 11: Hoare triple {2344#(= 0 |id2_#in~x|)} assume true; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,054 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2344#(= 0 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,055 INFO L280 TraceCheckUtils]: 13: Hoare triple {2343#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,055 INFO L280 TraceCheckUtils]: 14: Hoare triple {2343#(<= 1 |id_#in~x|)} assume true; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,056 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2343#(<= 1 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,057 INFO L280 TraceCheckUtils]: 16: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,057 INFO L280 TraceCheckUtils]: 17: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume true; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,059 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2338#(<= 2 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,059 INFO L280 TraceCheckUtils]: 19: Hoare triple {2327#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,060 INFO L280 TraceCheckUtils]: 20: Hoare triple {2327#(<= 3 |id_#in~x|)} assume true; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,061 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2327#(<= 3 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,062 INFO L280 TraceCheckUtils]: 0: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,063 INFO L280 TraceCheckUtils]: 1: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,063 INFO L263 TraceCheckUtils]: 2: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,064 INFO L280 TraceCheckUtils]: 3: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,064 INFO L280 TraceCheckUtils]: 4: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,064 INFO L263 TraceCheckUtils]: 5: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,065 INFO L280 TraceCheckUtils]: 6: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,065 INFO L280 TraceCheckUtils]: 7: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,066 INFO L263 TraceCheckUtils]: 8: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,066 INFO L280 TraceCheckUtils]: 9: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,067 INFO L280 TraceCheckUtils]: 10: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,067 INFO L263 TraceCheckUtils]: 11: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,068 INFO L280 TraceCheckUtils]: 12: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,068 INFO L280 TraceCheckUtils]: 13: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,069 INFO L280 TraceCheckUtils]: 14: Hoare triple {2344#(= 0 |id2_#in~x|)} assume true; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,070 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2344#(= 0 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,071 INFO L280 TraceCheckUtils]: 16: Hoare triple {2343#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,071 INFO L280 TraceCheckUtils]: 17: Hoare triple {2343#(<= 1 |id_#in~x|)} assume true; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,072 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2343#(<= 1 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,073 INFO L280 TraceCheckUtils]: 19: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,074 INFO L280 TraceCheckUtils]: 20: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume true; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,076 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2338#(<= 2 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,076 INFO L280 TraceCheckUtils]: 22: Hoare triple {2327#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,077 INFO L280 TraceCheckUtils]: 23: Hoare triple {2327#(<= 3 |id_#in~x|)} assume true; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,079 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2327#(<= 3 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,079 INFO L280 TraceCheckUtils]: 25: Hoare triple {2310#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,080 INFO L280 TraceCheckUtils]: 26: Hoare triple {2310#(<= 4 |id2_#in~x|)} assume true; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,081 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2310#(<= 4 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,084 INFO L263 TraceCheckUtils]: 2: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,085 INFO L280 TraceCheckUtils]: 3: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,085 INFO L280 TraceCheckUtils]: 4: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,085 INFO L263 TraceCheckUtils]: 5: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,086 INFO L280 TraceCheckUtils]: 6: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,087 INFO L280 TraceCheckUtils]: 7: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,087 INFO L263 TraceCheckUtils]: 8: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,087 INFO L280 TraceCheckUtils]: 9: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,088 INFO L280 TraceCheckUtils]: 10: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,088 INFO L263 TraceCheckUtils]: 11: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,089 INFO L280 TraceCheckUtils]: 12: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,089 INFO L280 TraceCheckUtils]: 13: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,089 INFO L263 TraceCheckUtils]: 14: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,090 INFO L280 TraceCheckUtils]: 15: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,090 INFO L280 TraceCheckUtils]: 16: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,091 INFO L280 TraceCheckUtils]: 17: Hoare triple {2344#(= 0 |id2_#in~x|)} assume true; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,092 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2344#(= 0 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,093 INFO L280 TraceCheckUtils]: 19: Hoare triple {2343#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,093 INFO L280 TraceCheckUtils]: 20: Hoare triple {2343#(<= 1 |id_#in~x|)} assume true; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,095 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2343#(<= 1 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,095 INFO L280 TraceCheckUtils]: 22: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,096 INFO L280 TraceCheckUtils]: 23: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume true; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,097 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2338#(<= 2 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,098 INFO L280 TraceCheckUtils]: 25: Hoare triple {2327#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,098 INFO L280 TraceCheckUtils]: 26: Hoare triple {2327#(<= 3 |id_#in~x|)} assume true; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,100 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2327#(<= 3 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,100 INFO L280 TraceCheckUtils]: 28: Hoare triple {2310#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,101 INFO L280 TraceCheckUtils]: 29: Hoare triple {2310#(<= 4 |id2_#in~x|)} assume true; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,102 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2310#(<= 4 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,103 INFO L280 TraceCheckUtils]: 31: Hoare triple {2287#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,103 INFO L280 TraceCheckUtils]: 32: Hoare triple {2287#(<= 5 |id_#in~x|)} assume true; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,104 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2287#(<= 5 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,106 INFO L280 TraceCheckUtils]: 0: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,107 INFO L280 TraceCheckUtils]: 1: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,107 INFO L263 TraceCheckUtils]: 2: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,108 INFO L280 TraceCheckUtils]: 3: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,108 INFO L280 TraceCheckUtils]: 4: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,108 INFO L263 TraceCheckUtils]: 5: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,109 INFO L280 TraceCheckUtils]: 6: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,110 INFO L280 TraceCheckUtils]: 7: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,110 INFO L263 TraceCheckUtils]: 8: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,111 INFO L280 TraceCheckUtils]: 9: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,112 INFO L280 TraceCheckUtils]: 10: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,112 INFO L263 TraceCheckUtils]: 11: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,112 INFO L280 TraceCheckUtils]: 12: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,113 INFO L280 TraceCheckUtils]: 13: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,114 INFO L263 TraceCheckUtils]: 14: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,114 INFO L280 TraceCheckUtils]: 15: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,115 INFO L280 TraceCheckUtils]: 16: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,116 INFO L263 TraceCheckUtils]: 17: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,116 INFO L280 TraceCheckUtils]: 18: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,117 INFO L280 TraceCheckUtils]: 19: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,118 INFO L280 TraceCheckUtils]: 20: Hoare triple {2344#(= 0 |id2_#in~x|)} assume true; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,119 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2344#(= 0 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,119 INFO L280 TraceCheckUtils]: 22: Hoare triple {2343#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,120 INFO L280 TraceCheckUtils]: 23: Hoare triple {2343#(<= 1 |id_#in~x|)} assume true; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,121 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2343#(<= 1 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,122 INFO L280 TraceCheckUtils]: 25: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,122 INFO L280 TraceCheckUtils]: 26: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume true; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,124 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2338#(<= 2 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,125 INFO L280 TraceCheckUtils]: 28: Hoare triple {2327#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,125 INFO L280 TraceCheckUtils]: 29: Hoare triple {2327#(<= 3 |id_#in~x|)} assume true; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,127 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2327#(<= 3 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,127 INFO L280 TraceCheckUtils]: 31: Hoare triple {2310#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,128 INFO L280 TraceCheckUtils]: 32: Hoare triple {2310#(<= 4 |id2_#in~x|)} assume true; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,129 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2310#(<= 4 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,130 INFO L280 TraceCheckUtils]: 34: Hoare triple {2287#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,130 INFO L280 TraceCheckUtils]: 35: Hoare triple {2287#(<= 5 |id_#in~x|)} assume true; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,132 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2287#(<= 5 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,132 INFO L280 TraceCheckUtils]: 37: Hoare triple {2258#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,133 INFO L280 TraceCheckUtils]: 38: Hoare triple {2258#(<= 6 |id2_#in~x|)} assume true; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,134 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2258#(<= 6 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} is VALID [2020-07-28 19:11:44,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,137 INFO L263 TraceCheckUtils]: 2: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,138 INFO L280 TraceCheckUtils]: 3: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,138 INFO L263 TraceCheckUtils]: 5: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,139 INFO L280 TraceCheckUtils]: 6: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,139 INFO L280 TraceCheckUtils]: 7: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,140 INFO L263 TraceCheckUtils]: 8: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,140 INFO L280 TraceCheckUtils]: 9: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,141 INFO L280 TraceCheckUtils]: 10: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,141 INFO L263 TraceCheckUtils]: 11: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,141 INFO L280 TraceCheckUtils]: 12: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,142 INFO L280 TraceCheckUtils]: 13: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,142 INFO L263 TraceCheckUtils]: 14: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,142 INFO L280 TraceCheckUtils]: 15: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,143 INFO L280 TraceCheckUtils]: 16: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,143 INFO L263 TraceCheckUtils]: 17: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,144 INFO L280 TraceCheckUtils]: 18: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,144 INFO L280 TraceCheckUtils]: 19: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,144 INFO L263 TraceCheckUtils]: 20: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,145 INFO L280 TraceCheckUtils]: 21: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,145 INFO L280 TraceCheckUtils]: 22: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,146 INFO L280 TraceCheckUtils]: 23: Hoare triple {2344#(= 0 |id2_#in~x|)} assume true; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,147 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2344#(= 0 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,147 INFO L280 TraceCheckUtils]: 25: Hoare triple {2343#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,148 INFO L280 TraceCheckUtils]: 26: Hoare triple {2343#(<= 1 |id_#in~x|)} assume true; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,149 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2343#(<= 1 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,150 INFO L280 TraceCheckUtils]: 28: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,150 INFO L280 TraceCheckUtils]: 29: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume true; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,151 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2338#(<= 2 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,152 INFO L280 TraceCheckUtils]: 31: Hoare triple {2327#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,152 INFO L280 TraceCheckUtils]: 32: Hoare triple {2327#(<= 3 |id_#in~x|)} assume true; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,154 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2327#(<= 3 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,154 INFO L280 TraceCheckUtils]: 34: Hoare triple {2310#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,155 INFO L280 TraceCheckUtils]: 35: Hoare triple {2310#(<= 4 |id2_#in~x|)} assume true; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,156 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2310#(<= 4 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,156 INFO L280 TraceCheckUtils]: 37: Hoare triple {2287#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,157 INFO L280 TraceCheckUtils]: 38: Hoare triple {2287#(<= 5 |id_#in~x|)} assume true; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,158 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2287#(<= 5 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,159 INFO L280 TraceCheckUtils]: 40: Hoare triple {2258#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,159 INFO L280 TraceCheckUtils]: 41: Hoare triple {2258#(<= 6 |id2_#in~x|)} assume true; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,161 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2258#(<= 6 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} is VALID [2020-07-28 19:11:44,161 INFO L280 TraceCheckUtils]: 43: Hoare triple {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} is VALID [2020-07-28 19:11:44,162 INFO L280 TraceCheckUtils]: 44: Hoare triple {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} assume true; {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} is VALID [2020-07-28 19:11:44,163 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} {2134#(and (<= 5 ULTIMATE.start_main_~input~0) (<= ULTIMATE.start_main_~input~0 5))} #34#return; {2133#false} is VALID [2020-07-28 19:11:44,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {2132#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {2134#(and (<= 5 ULTIMATE.start_main_~input~0) (<= ULTIMATE.start_main_~input~0 5))} is VALID [2020-07-28 19:11:44,165 INFO L263 TraceCheckUtils]: 1: Hoare triple {2134#(and (<= 5 ULTIMATE.start_main_~input~0) (<= ULTIMATE.start_main_~input~0 5))} call main_#t~ret2 := id(main_~input~0); {2132#true} is VALID [2020-07-28 19:11:44,165 INFO L280 TraceCheckUtils]: 2: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,166 INFO L280 TraceCheckUtils]: 3: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,166 INFO L263 TraceCheckUtils]: 4: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,166 INFO L280 TraceCheckUtils]: 5: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,167 INFO L280 TraceCheckUtils]: 6: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,167 INFO L263 TraceCheckUtils]: 7: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,167 INFO L280 TraceCheckUtils]: 8: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,168 INFO L280 TraceCheckUtils]: 9: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,168 INFO L263 TraceCheckUtils]: 10: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,168 INFO L280 TraceCheckUtils]: 11: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,169 INFO L280 TraceCheckUtils]: 12: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,169 INFO L263 TraceCheckUtils]: 13: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,169 INFO L280 TraceCheckUtils]: 14: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,169 INFO L280 TraceCheckUtils]: 15: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,170 INFO L263 TraceCheckUtils]: 16: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,170 INFO L280 TraceCheckUtils]: 17: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,170 INFO L280 TraceCheckUtils]: 18: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,171 INFO L263 TraceCheckUtils]: 19: Hoare triple {2223#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,171 INFO L280 TraceCheckUtils]: 20: Hoare triple {2132#true} ~x := #in~x; {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,173 INFO L280 TraceCheckUtils]: 21: Hoare triple {2181#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2181#(= |id_#in~x| id_~x)} is VALID [2020-07-28 19:11:44,173 INFO L263 TraceCheckUtils]: 22: Hoare triple {2181#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,174 INFO L280 TraceCheckUtils]: 23: Hoare triple {2132#true} ~x := #in~x; {2223#(= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,174 INFO L280 TraceCheckUtils]: 24: Hoare triple {2223#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,175 INFO L280 TraceCheckUtils]: 25: Hoare triple {2344#(= 0 |id2_#in~x|)} assume true; {2344#(= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,176 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2344#(= 0 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,176 INFO L280 TraceCheckUtils]: 27: Hoare triple {2343#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,176 INFO L280 TraceCheckUtils]: 28: Hoare triple {2343#(<= 1 |id_#in~x|)} assume true; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,177 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2343#(<= 1 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,178 INFO L280 TraceCheckUtils]: 30: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,178 INFO L280 TraceCheckUtils]: 31: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume true; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,179 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2338#(<= 2 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,180 INFO L280 TraceCheckUtils]: 33: Hoare triple {2327#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,180 INFO L280 TraceCheckUtils]: 34: Hoare triple {2327#(<= 3 |id_#in~x|)} assume true; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,181 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2327#(<= 3 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,181 INFO L280 TraceCheckUtils]: 36: Hoare triple {2310#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,182 INFO L280 TraceCheckUtils]: 37: Hoare triple {2310#(<= 4 |id2_#in~x|)} assume true; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,183 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2310#(<= 4 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,183 INFO L280 TraceCheckUtils]: 39: Hoare triple {2287#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,184 INFO L280 TraceCheckUtils]: 40: Hoare triple {2287#(<= 5 |id_#in~x|)} assume true; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,185 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2287#(<= 5 |id_#in~x|)} {2223#(= id2_~x |id2_#in~x|)} #32#return; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,186 INFO L280 TraceCheckUtils]: 42: Hoare triple {2258#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,187 INFO L280 TraceCheckUtils]: 43: Hoare triple {2258#(<= 6 |id2_#in~x|)} assume true; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,188 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2258#(<= 6 |id2_#in~x|)} {2181#(= |id_#in~x| id_~x)} #36#return; {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} is VALID [2020-07-28 19:11:44,189 INFO L280 TraceCheckUtils]: 45: Hoare triple {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} is VALID [2020-07-28 19:11:44,190 INFO L280 TraceCheckUtils]: 46: Hoare triple {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} assume true; {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} is VALID [2020-07-28 19:11:44,191 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2222#(or (<= 6 |id_#in~x|) (<= |id_#in~x| 4))} {2134#(and (<= 5 ULTIMATE.start_main_~input~0) (<= ULTIMATE.start_main_~input~0 5))} #34#return; {2133#false} is VALID [2020-07-28 19:11:44,191 INFO L280 TraceCheckUtils]: 48: Hoare triple {2133#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {2133#false} is VALID [2020-07-28 19:11:44,191 INFO L280 TraceCheckUtils]: 49: Hoare triple {2133#false} assume 5 != main_~result~0; {2133#false} is VALID [2020-07-28 19:11:44,191 INFO L280 TraceCheckUtils]: 50: Hoare triple {2133#false} assume !false; {2133#false} is VALID [2020-07-28 19:11:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-07-28 19:11:44,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722482220] [2020-07-28 19:11:44,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056188119] [2020-07-28 19:11:44,194 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 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:11:44,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-28 19:11:44,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 19:11:44,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-28 19:11:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:44,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:11:44,845 INFO L280 TraceCheckUtils]: 0: Hoare triple {2132#true} havoc main_#res;havoc main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := 5; {2348#(<= ULTIMATE.start_main_~input~0 5)} is VALID [2020-07-28 19:11:44,845 INFO L263 TraceCheckUtils]: 1: Hoare triple {2348#(<= ULTIMATE.start_main_~input~0 5)} call main_#t~ret2 := id(main_~input~0); {2132#true} is VALID [2020-07-28 19:11:44,846 INFO L280 TraceCheckUtils]: 2: Hoare triple {2132#true} ~x := #in~x; {2355#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:44,847 INFO L280 TraceCheckUtils]: 3: Hoare triple {2355#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2355#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:44,847 INFO L263 TraceCheckUtils]: 4: Hoare triple {2355#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,847 INFO L280 TraceCheckUtils]: 5: Hoare triple {2132#true} ~x := #in~x; {2365#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,847 INFO L280 TraceCheckUtils]: 6: Hoare triple {2365#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2365#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,848 INFO L263 TraceCheckUtils]: 7: Hoare triple {2365#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,848 INFO L280 TraceCheckUtils]: 8: Hoare triple {2132#true} ~x := #in~x; {2355#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:44,848 INFO L280 TraceCheckUtils]: 9: Hoare triple {2355#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2355#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:44,849 INFO L263 TraceCheckUtils]: 10: Hoare triple {2355#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,849 INFO L280 TraceCheckUtils]: 11: Hoare triple {2132#true} ~x := #in~x; {2365#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,849 INFO L280 TraceCheckUtils]: 12: Hoare triple {2365#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2365#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,850 INFO L263 TraceCheckUtils]: 13: Hoare triple {2365#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,850 INFO L280 TraceCheckUtils]: 14: Hoare triple {2132#true} ~x := #in~x; {2355#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:44,850 INFO L280 TraceCheckUtils]: 15: Hoare triple {2355#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2355#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:44,850 INFO L263 TraceCheckUtils]: 16: Hoare triple {2355#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,851 INFO L280 TraceCheckUtils]: 17: Hoare triple {2132#true} ~x := #in~x; {2365#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,851 INFO L280 TraceCheckUtils]: 18: Hoare triple {2365#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2365#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,851 INFO L263 TraceCheckUtils]: 19: Hoare triple {2365#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,852 INFO L280 TraceCheckUtils]: 20: Hoare triple {2132#true} ~x := #in~x; {2355#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:44,852 INFO L280 TraceCheckUtils]: 21: Hoare triple {2355#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2355#(<= id_~x |id_#in~x|)} is VALID [2020-07-28 19:11:44,852 INFO L263 TraceCheckUtils]: 22: Hoare triple {2355#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {2132#true} is VALID [2020-07-28 19:11:44,853 INFO L280 TraceCheckUtils]: 23: Hoare triple {2132#true} ~x := #in~x; {2365#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-28 19:11:44,859 INFO L280 TraceCheckUtils]: 24: Hoare triple {2365#(<= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2423#(<= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,860 INFO L280 TraceCheckUtils]: 25: Hoare triple {2423#(<= 0 |id2_#in~x|)} assume true; {2423#(<= 0 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,862 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2423#(<= 0 |id2_#in~x|)} {2355#(<= id_~x |id_#in~x|)} #36#return; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,862 INFO L280 TraceCheckUtils]: 27: Hoare triple {2343#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,863 INFO L280 TraceCheckUtils]: 28: Hoare triple {2343#(<= 1 |id_#in~x|)} assume true; {2343#(<= 1 |id_#in~x|)} is VALID [2020-07-28 19:11:44,864 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2343#(<= 1 |id_#in~x|)} {2365#(<= id2_~x |id2_#in~x|)} #32#return; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,865 INFO L280 TraceCheckUtils]: 30: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,865 INFO L280 TraceCheckUtils]: 31: Hoare triple {2338#(<= 2 |id2_#in~x|)} assume true; {2338#(<= 2 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,866 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2338#(<= 2 |id2_#in~x|)} {2355#(<= id_~x |id_#in~x|)} #36#return; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,867 INFO L280 TraceCheckUtils]: 33: Hoare triple {2327#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,868 INFO L280 TraceCheckUtils]: 34: Hoare triple {2327#(<= 3 |id_#in~x|)} assume true; {2327#(<= 3 |id_#in~x|)} is VALID [2020-07-28 19:11:44,869 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2327#(<= 3 |id_#in~x|)} {2365#(<= id2_~x |id2_#in~x|)} #32#return; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,869 INFO L280 TraceCheckUtils]: 36: Hoare triple {2310#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,870 INFO L280 TraceCheckUtils]: 37: Hoare triple {2310#(<= 4 |id2_#in~x|)} assume true; {2310#(<= 4 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,871 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2310#(<= 4 |id2_#in~x|)} {2355#(<= id_~x |id_#in~x|)} #36#return; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,871 INFO L280 TraceCheckUtils]: 39: Hoare triple {2287#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,871 INFO L280 TraceCheckUtils]: 40: Hoare triple {2287#(<= 5 |id_#in~x|)} assume true; {2287#(<= 5 |id_#in~x|)} is VALID [2020-07-28 19:11:44,872 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2287#(<= 5 |id_#in~x|)} {2365#(<= id2_~x |id2_#in~x|)} #32#return; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,873 INFO L280 TraceCheckUtils]: 42: Hoare triple {2258#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,873 INFO L280 TraceCheckUtils]: 43: Hoare triple {2258#(<= 6 |id2_#in~x|)} assume true; {2258#(<= 6 |id2_#in~x|)} is VALID [2020-07-28 19:11:44,875 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2258#(<= 6 |id2_#in~x|)} {2355#(<= id_~x |id_#in~x|)} #36#return; {2484#(<= 7 |id_#in~x|)} is VALID [2020-07-28 19:11:44,875 INFO L280 TraceCheckUtils]: 45: Hoare triple {2484#(<= 7 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2484#(<= 7 |id_#in~x|)} is VALID [2020-07-28 19:11:44,876 INFO L280 TraceCheckUtils]: 46: Hoare triple {2484#(<= 7 |id_#in~x|)} assume true; {2484#(<= 7 |id_#in~x|)} is VALID [2020-07-28 19:11:44,877 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2484#(<= 7 |id_#in~x|)} {2348#(<= ULTIMATE.start_main_~input~0 5)} #34#return; {2133#false} is VALID [2020-07-28 19:11:44,877 INFO L280 TraceCheckUtils]: 48: Hoare triple {2133#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {2133#false} is VALID [2020-07-28 19:11:44,877 INFO L280 TraceCheckUtils]: 49: Hoare triple {2133#false} assume 5 != main_~result~0; {2133#false} is VALID [2020-07-28 19:11:44,877 INFO L280 TraceCheckUtils]: 50: Hoare triple {2133#false} assume !false; {2133#false} is VALID [2020-07-28 19:11:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-07-28 19:11:44,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 19:11:44,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 18 [2020-07-28 19:11:44,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550889777] [2020-07-28 19:11:44,881 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2020-07-28 19:11:44,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:11:44,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-28 19:11:44,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:11:44,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-28 19:11:44,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:11:44,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-28 19:11:44,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2020-07-28 19:11:44,931 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2020-07-28 19:11:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:45,397 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2020-07-28 19:11:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-28 19:11:45,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2020-07-28 19:11:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:11:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 19:11:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 36 transitions. [2020-07-28 19:11:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 19:11:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 36 transitions. [2020-07-28 19:11:45,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 36 transitions. [2020-07-28 19:11:45,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:11:45,455 INFO L225 Difference]: With dead ends: 35 [2020-07-28 19:11:45,456 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 19:11:45,457 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2020-07-28 19:11:45,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 19:11:45,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 19:11:45,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:11:45,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 19:11:45,458 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:11:45,458 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:11:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:45,458 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:11:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:11:45,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:45,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:45,459 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:11:45,459 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:11:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:45,459 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:11:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:11:45,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:45,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:45,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:11:45,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:11:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 19:11:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 19:11:45,461 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-07-28 19:11:45,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:11:45,461 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 19:11:45,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-28 19:11:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:11:45,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:45,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:11:45,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 19:11:45,715 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-07-28 19:11:45,715 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-28 19:11:45,715 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-28 19:11:45,715 INFO L268 CegarLoopResult]: For program point id2EXIT(lines 12 15) no Hoare annotation was computed. [2020-07-28 19:11:45,715 INFO L271 CegarLoopResult]: At program point id2ENTRY(lines 12 15) the Hoare annotation is: true [2020-07-28 19:11:45,716 INFO L268 CegarLoopResult]: For program point id2FINAL(lines 12 15) no Hoare annotation was computed. [2020-07-28 19:11:45,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 19:11:45,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 19:11:45,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 19:11:45,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2020-07-28 19:11:45,716 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-28 19:11:45,717 INFO L268 CegarLoopResult]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-07-28 19:11:45,717 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= 5 ULTIMATE.start_main_~input~0) (<= ULTIMATE.start_main_~input~0 5)) [2020-07-28 19:11:45,717 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-28 19:11:45,717 INFO L268 CegarLoopResult]: For program point L17(lines 17 23) no Hoare annotation was computed. [2020-07-28 19:11:45,717 INFO L268 CegarLoopResult]: For program point idFINAL(lines 7 10) no Hoare annotation was computed. [2020-07-28 19:11:45,717 INFO L268 CegarLoopResult]: For program point idEXIT(lines 7 10) no Hoare annotation was computed. [2020-07-28 19:11:45,717 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-28 19:11:45,717 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-28 19:11:45,717 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-28 19:11:45,717 INFO L271 CegarLoopResult]: At program point idENTRY(lines 7 10) the Hoare annotation is: true [2020-07-28 19:11:45,721 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 19:11:45,721 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 19:11:45,722 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 19:11:45,722 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 19:11:45,722 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 19:11:45,722 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 19:11:45,722 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 19:11:45,722 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 19:11:45,722 WARN L170 areAnnotationChecker]: id2FINAL has no Hoare annotation [2020-07-28 19:11:45,722 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-28 19:11:45,722 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 19:11:45,722 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-28 19:11:45,722 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-28 19:11:45,723 WARN L170 areAnnotationChecker]: id2EXIT has no Hoare annotation [2020-07-28 19:11:45,723 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-28 19:11:45,723 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 19:11:45,723 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 19:11:45,723 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-28 19:11:45,723 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-28 19:11:45,723 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-28 19:11:45,723 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-28 19:11:45,723 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-28 19:11:45,723 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-28 19:11:45,723 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:11:45,724 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 19:11:45,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 07:11:45 BoogieIcfgContainer [2020-07-28 19:11:45,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 19:11:45,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 19:11:45,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 19:11:45,726 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 19:11:45,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:11:34" (3/4) ... [2020-07-28 19:11:45,731 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 19:11:45,736 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2020-07-28 19:11:45,737 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2020-07-28 19:11:45,741 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-07-28 19:11:45,742 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 19:11:45,783 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 19:11:45,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 19:11:45,785 INFO L168 Benchmark]: Toolchain (without parser) took 12153.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 954.9 MB in the beginning and 951.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 303.6 MB. Max. memory is 11.5 GB. [2020-07-28 19:11:45,786 INFO L168 Benchmark]: CDTParser took 0.28 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:11:45,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.64 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 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:11:45,786 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.77 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:11:45,787 INFO L168 Benchmark]: Boogie Preprocessor took 84.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -156.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:11:45,787 INFO L168 Benchmark]: RCFGBuilder took 319.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2020-07-28 19:11:45,788 INFO L168 Benchmark]: TraceAbstraction took 11427.37 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 951.2 MB in the end (delta: 130.0 MB). Peak memory consumption was 318.3 MB. Max. memory is 11.5 GB. [2020-07-28 19:11:45,788 INFO L168 Benchmark]: Witness Printer took 56.69 ms. Allocated memory is still 1.3 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:11:45,790 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.28 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 219.64 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 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.77 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -156.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 319.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11427.37 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 951.2 MB in the end (delta: 130.0 MB). Peak memory consumption was 318.3 MB. Max. memory is 11.5 GB. * Witness Printer took 56.69 ms. Allocated memory is still 1.3 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.2s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 146 SDtfs, 110 SDslu, 872 SDs, 0 SdLazy, 508 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 258 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 15 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 442 ConstructedInterpolants, 0 QuantifiedInterpolants, 45648 SizeOfPredicates, 33 NumberOfNonLiveVariables, 516 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 273/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...