./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/jm2006.c.i.v+cfa-reducer.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/loop-lit/jm2006.c.i.v+cfa-reducer.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 e637b06ca85ba870a7671925f42782e59ad4b7d0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 18:17:14,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:17:14,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:17:14,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:17:14,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:17:14,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:17:14,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:17:14,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:17:14,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:17:14,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:17:14,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:17:14,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:17:14,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:17:14,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:17:14,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:17:14,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:17:14,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:17:14,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:17:14,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:17:14,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:17:14,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:17:14,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:17:14,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:17:14,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:17:14,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:17:14,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:17:14,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:17:14,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:17:14,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:17:14,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:17:14,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:17:14,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:17:14,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:17:14,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:17:14,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:17:14,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:17:14,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:17:14,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:17:14,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:17:14,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:17:14,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:17:14,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:17:14,462 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:17:14,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:17:14,464 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:17:14,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:17:14,465 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:17:14,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:17:14,466 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:17:14,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:17:14,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:17:14,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:17:14,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:17:14,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:17:14,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:17:14,468 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:17:14,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:17:14,468 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:17:14,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:17:14,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:17:14,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:17:14,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:17:14,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:17:14,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:17:14,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:17:14,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:17:14,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:17:14,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:17:14,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:17:14,472 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:17:14,472 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:17:14,472 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 -> e637b06ca85ba870a7671925f42782e59ad4b7d0 [2020-07-28 18:17:14,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:17:14,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:17:14,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:17:14,825 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:17:14,826 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:17:14,826 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/jm2006.c.i.v+cfa-reducer.c [2020-07-28 18:17:14,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e9ce9af/fc45ad00df9841388f8be5b5560974ee/FLAGa0cb79816 [2020-07-28 18:17:15,351 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:17:15,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/jm2006.c.i.v+cfa-reducer.c [2020-07-28 18:17:15,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e9ce9af/fc45ad00df9841388f8be5b5560974ee/FLAGa0cb79816 [2020-07-28 18:17:15,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e9ce9af/fc45ad00df9841388f8be5b5560974ee [2020-07-28 18:17:15,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:17:15,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:17:15,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:17:15,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:17:15,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:17:15,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:17:15" (1/1) ... [2020-07-28 18:17:15,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1983deb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:15, skipping insertion in model container [2020-07-28 18:17:15,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:17:15" (1/1) ... [2020-07-28 18:17:15,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:17:15,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:17:16,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:17:16,006 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:17:16,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:17:16,046 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:17:16,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:16 WrapperNode [2020-07-28 18:17:16,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:17:16,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:17:16,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:17:16,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:17:16,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:16" (1/1) ... [2020-07-28 18:17:16,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:16" (1/1) ... [2020-07-28 18:17:16,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:17:16,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:17:16,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:17:16,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:17:16,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:16" (1/1) ... [2020-07-28 18:17:16,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:16" (1/1) ... [2020-07-28 18:17:16,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:16" (1/1) ... [2020-07-28 18:17:16,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:16" (1/1) ... [2020-07-28 18:17:16,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:16" (1/1) ... [2020-07-28 18:17:16,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:16" (1/1) ... [2020-07-28 18:17:16,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:16" (1/1) ... [2020-07-28 18:17:16,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:17:16,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:17:16,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:17:16,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:17:16,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:16" (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 18:17:16,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:17:16,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:17:16,480 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:17:16,481 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 18:17:16,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:17:16 BoogieIcfgContainer [2020-07-28 18:17:16,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:17:16,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:17:16,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:17:16,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:17:16,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:17:15" (1/3) ... [2020-07-28 18:17:16,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8887a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:17:16, skipping insertion in model container [2020-07-28 18:17:16,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:16" (2/3) ... [2020-07-28 18:17:16,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8887a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:17:16, skipping insertion in model container [2020-07-28 18:17:16,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:17:16" (3/3) ... [2020-07-28 18:17:16,494 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006.c.i.v+cfa-reducer.c [2020-07-28 18:17:16,512 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:17:16,523 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:17:16,540 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:17:16,569 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:17:16,570 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:17:16,570 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:17:16,570 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:17:16,570 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:17:16,571 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:17:16,571 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:17:16,571 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:17:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-07-28 18:17:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:17:16,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:16,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:17:16,597 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:16,605 INFO L82 PathProgramCache]: Analyzing trace with hash 179596396, now seen corresponding path program 1 times [2020-07-28 18:17:16,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:17:16,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253989074] [2020-07-28 18:17:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:17:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:16,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} ~__return_main~0 := 0;~__return_72~0 := 0; {15#true} is VALID [2020-07-28 18:17:16,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__x~0, main_~main__y~0, main_~main__i~0, main_~main__j~0;havoc main_~main__i~0;havoc main_~main__j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~main__i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~main__j~0 := main_#t~nondet1;havoc main_#t~nondet1; {15#true} is VALID [2020-07-28 18:17:16,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#true} assume !!(main_~main__i~0 >= 0); {15#true} is VALID [2020-07-28 18:17:16,932 INFO L280 TraceCheckUtils]: 3: Hoare triple {15#true} assume !!(main_~main__j~0 >= 0);main_~main__x~0 := main_~main__i~0;main_~main__y~0 := main_~main__j~0; {17#(or (= ULTIMATE.start_main_~main__y~0 0) (<= (+ ULTIMATE.start_main_~main__i~0 1) (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0)) (<= (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0 1) ULTIMATE.start_main_~main__i~0))} is VALID [2020-07-28 18:17:16,934 INFO L280 TraceCheckUtils]: 4: Hoare triple {17#(or (= ULTIMATE.start_main_~main__y~0 0) (<= (+ ULTIMATE.start_main_~main__i~0 1) (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0)) (<= (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0 1) ULTIMATE.start_main_~main__i~0))} assume !(0 != main_~main__x~0); {18#(or (<= (+ ULTIMATE.start_main_~main__j~0 1) ULTIMATE.start_main_~main__i~0) (= ULTIMATE.start_main_~main__y~0 0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__j~0))} is VALID [2020-07-28 18:17:16,935 INFO L280 TraceCheckUtils]: 5: Hoare triple {18#(or (<= (+ ULTIMATE.start_main_~main__j~0 1) ULTIMATE.start_main_~main__i~0) (= ULTIMATE.start_main_~main__y~0 0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__j~0))} assume main_~main__i~0 == main_~main__j~0;havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if 0 == main_~main__y~0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {19#(not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-28 18:17:16,937 INFO L280 TraceCheckUtils]: 6: Hoare triple {19#(not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))} assume 0 == main_~__VERIFIER_assert__cond~0; {16#false} is VALID [2020-07-28 18:17:16,937 INFO L280 TraceCheckUtils]: 7: Hoare triple {16#false} assume !false; {16#false} is VALID [2020-07-28 18:17:16,940 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 18:17:16,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253989074] [2020-07-28 18:17:16,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:17:16,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:17:16,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322625494] [2020-07-28 18:17:16,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-28 18:17:16,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:16,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:17:16,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:16,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:17:16,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:17:16,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:17:16,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:17:16,988 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 5 states. [2020-07-28 18:17:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:17,258 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-28 18:17:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 18:17:17,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-28 18:17:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:17:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2020-07-28 18:17:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:17:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2020-07-28 18:17:17,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2020-07-28 18:17:17,347 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 18:17:17,359 INFO L225 Difference]: With dead ends: 32 [2020-07-28 18:17:17,359 INFO L226 Difference]: Without dead ends: 10 [2020-07-28 18:17:17,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:17:17,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-28 18:17:17,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-28 18:17:17,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:17,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2020-07-28 18:17:17,407 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2020-07-28 18:17:17,407 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2020-07-28 18:17:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:17,409 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2020-07-28 18:17:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-28 18:17:17,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:17,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:17,411 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2020-07-28 18:17:17,411 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2020-07-28 18:17:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:17,413 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2020-07-28 18:17:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-28 18:17:17,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:17,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:17,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:17,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:17:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-07-28 18:17:17,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2020-07-28 18:17:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:17,419 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-07-28 18:17:17,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:17:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-28 18:17:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 18:17:17,421 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:17,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:17:17,422 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:17:17,422 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:17,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:17,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1270581676, now seen corresponding path program 1 times [2020-07-28 18:17:17,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:17:17,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257402479] [2020-07-28 18:17:17,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:17:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:17,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {98#true} ~__return_main~0 := 0;~__return_72~0 := 0; {98#true} is VALID [2020-07-28 18:17:17,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__x~0, main_~main__y~0, main_~main__i~0, main_~main__j~0;havoc main_~main__i~0;havoc main_~main__j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~main__i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~main__j~0 := main_#t~nondet1;havoc main_#t~nondet1; {98#true} is VALID [2020-07-28 18:17:17,639 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume !!(main_~main__i~0 >= 0); {98#true} is VALID [2020-07-28 18:17:17,641 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume !!(main_~main__j~0 >= 0);main_~main__x~0 := main_~main__i~0;main_~main__y~0 := main_~main__j~0; {100#(and (<= ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__x~0) (= ULTIMATE.start_main_~main__y~0 ULTIMATE.start_main_~main__j~0))} is VALID [2020-07-28 18:17:17,643 INFO L280 TraceCheckUtils]: 4: Hoare triple {100#(and (<= ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__x~0) (= ULTIMATE.start_main_~main__y~0 ULTIMATE.start_main_~main__j~0))} assume 0 != main_~main__x~0;main_~main____CPAchecker_TMP_0~0 := main_~main__x~0;main_~main__x~0 := main_~main__x~0 - 1;main_~main____CPAchecker_TMP_1~0 := main_~main__y~0;main_~main__y~0 := main_~main__y~0 - 1; {101#(and (or (< 0 (+ ULTIMATE.start_main_~main__y~0 1)) (<= (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0) (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0))) (or (<= (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0) (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0)) (<= ULTIMATE.start_main_~main__y~0 0)))} is VALID [2020-07-28 18:17:17,644 INFO L280 TraceCheckUtils]: 5: Hoare triple {101#(and (or (< 0 (+ ULTIMATE.start_main_~main__y~0 1)) (<= (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0) (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0))) (or (<= (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0) (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0)) (<= ULTIMATE.start_main_~main__y~0 0)))} assume !(0 != main_~main__x~0); {102#(and (or (<= ULTIMATE.start_main_~main__j~0 (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0)) (< 0 (+ ULTIMATE.start_main_~main__y~0 1))) (or (<= (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0) ULTIMATE.start_main_~main__j~0) (<= ULTIMATE.start_main_~main__y~0 0)))} is VALID [2020-07-28 18:17:17,646 INFO L280 TraceCheckUtils]: 6: Hoare triple {102#(and (or (<= ULTIMATE.start_main_~main__j~0 (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0)) (< 0 (+ ULTIMATE.start_main_~main__y~0 1))) (or (<= (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0) ULTIMATE.start_main_~main__j~0) (<= ULTIMATE.start_main_~main__y~0 0)))} assume main_~main__i~0 == main_~main__j~0;havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if 0 == main_~main__y~0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {103#(not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-28 18:17:17,647 INFO L280 TraceCheckUtils]: 7: Hoare triple {103#(not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))} assume 0 == main_~__VERIFIER_assert__cond~0; {99#false} is VALID [2020-07-28 18:17:17,647 INFO L280 TraceCheckUtils]: 8: Hoare triple {99#false} assume !false; {99#false} is VALID [2020-07-28 18:17:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:17:17,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257402479] [2020-07-28 18:17:17,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792728124] [2020-07-28 18:17:17,650 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 18:17:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:17,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-28 18:17:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:17,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:17:17,962 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:17:18,006 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 18:17:18,068 INFO L280 TraceCheckUtils]: 0: Hoare triple {98#true} ~__return_main~0 := 0;~__return_72~0 := 0; {98#true} is VALID [2020-07-28 18:17:18,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__x~0, main_~main__y~0, main_~main__i~0, main_~main__j~0;havoc main_~main__i~0;havoc main_~main__j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~main__i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~main__j~0 := main_#t~nondet1;havoc main_#t~nondet1; {98#true} is VALID [2020-07-28 18:17:18,069 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume !!(main_~main__i~0 >= 0); {98#true} is VALID [2020-07-28 18:17:18,070 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume !!(main_~main__j~0 >= 0);main_~main__x~0 := main_~main__i~0;main_~main__y~0 := main_~main__j~0; {100#(and (<= ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__x~0) (= ULTIMATE.start_main_~main__y~0 ULTIMATE.start_main_~main__j~0))} is VALID [2020-07-28 18:17:18,072 INFO L280 TraceCheckUtils]: 4: Hoare triple {100#(and (<= ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__x~0) (= ULTIMATE.start_main_~main__y~0 ULTIMATE.start_main_~main__j~0))} assume 0 != main_~main__x~0;main_~main____CPAchecker_TMP_0~0 := main_~main__x~0;main_~main__x~0 := main_~main__x~0 - 1;main_~main____CPAchecker_TMP_1~0 := main_~main__y~0;main_~main__y~0 := main_~main__y~0 - 1; {119#(and (<= (+ ULTIMATE.start_main_~main__x~0 1) ULTIMATE.start_main_~main__i~0) (= (+ ULTIMATE.start_main_~main__y~0 1) ULTIMATE.start_main_~main__j~0) (<= ULTIMATE.start_main_~main__i~0 (+ ULTIMATE.start_main_~main__x~0 1)))} is VALID [2020-07-28 18:17:18,073 INFO L280 TraceCheckUtils]: 5: Hoare triple {119#(and (<= (+ ULTIMATE.start_main_~main__x~0 1) ULTIMATE.start_main_~main__i~0) (= (+ ULTIMATE.start_main_~main__y~0 1) ULTIMATE.start_main_~main__j~0) (<= ULTIMATE.start_main_~main__i~0 (+ ULTIMATE.start_main_~main__x~0 1)))} assume !(0 != main_~main__x~0); {123#(and (<= 1 ULTIMATE.start_main_~main__i~0) (= (+ ULTIMATE.start_main_~main__y~0 1) ULTIMATE.start_main_~main__j~0) (<= ULTIMATE.start_main_~main__i~0 1))} is VALID [2020-07-28 18:17:18,074 INFO L280 TraceCheckUtils]: 6: Hoare triple {123#(and (<= 1 ULTIMATE.start_main_~main__i~0) (= (+ ULTIMATE.start_main_~main__y~0 1) ULTIMATE.start_main_~main__j~0) (<= ULTIMATE.start_main_~main__i~0 1))} assume main_~main__i~0 == main_~main__j~0;havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if 0 == main_~main__y~0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {127#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} is VALID [2020-07-28 18:17:18,075 INFO L280 TraceCheckUtils]: 7: Hoare triple {127#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} assume 0 == main_~__VERIFIER_assert__cond~0; {99#false} is VALID [2020-07-28 18:17:18,076 INFO L280 TraceCheckUtils]: 8: Hoare triple {99#false} assume !false; {99#false} is VALID [2020-07-28 18:17:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:17:18,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:17:18,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-28 18:17:18,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954424478] [2020-07-28 18:17:18,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2020-07-28 18:17:18,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:18,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 18:17:18,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:18,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 18:17:18,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:17:18,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 18:17:18,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-28 18:17:18,100 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2020-07-28 18:17:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:18,426 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-28 18:17:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 18:17:18,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2020-07-28 18:17:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:17:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2020-07-28 18:17:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:17:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2020-07-28 18:17:18,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 19 transitions. [2020-07-28 18:17:18,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:18,464 INFO L225 Difference]: With dead ends: 18 [2020-07-28 18:17:18,464 INFO L226 Difference]: Without dead ends: 12 [2020-07-28 18:17:18,465 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-28 18:17:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-28 18:17:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-28 18:17:18,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:18,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2020-07-28 18:17:18,478 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 18:17:18,479 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 18:17:18,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:18,480 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-28 18:17:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 18:17:18,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:18,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:18,481 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 18:17:18,481 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 18:17:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:18,483 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-28 18:17:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 18:17:18,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:18,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:18,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:18,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:17:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-07-28 18:17:18,486 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2020-07-28 18:17:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:18,486 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-07-28 18:17:18,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 18:17:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 18:17:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 18:17:18,487 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:18,487 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:17:18,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-28 18:17:18,689 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:18,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1196220844, now seen corresponding path program 2 times [2020-07-28 18:17:18,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:17:18,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291858299] [2020-07-28 18:17:18,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:17:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:18,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {203#true} ~__return_main~0 := 0;~__return_72~0 := 0; {203#true} is VALID [2020-07-28 18:17:18,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {203#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__x~0, main_~main__y~0, main_~main__i~0, main_~main__j~0;havoc main_~main__i~0;havoc main_~main__j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~main__i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~main__j~0 := main_#t~nondet1;havoc main_#t~nondet1; {203#true} is VALID [2020-07-28 18:17:18,908 INFO L280 TraceCheckUtils]: 2: Hoare triple {203#true} assume !!(main_~main__i~0 >= 0); {203#true} is VALID [2020-07-28 18:17:18,909 INFO L280 TraceCheckUtils]: 3: Hoare triple {203#true} assume !!(main_~main__j~0 >= 0);main_~main__x~0 := main_~main__i~0;main_~main__y~0 := main_~main__j~0; {205#(and (<= ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__x~0) (= ULTIMATE.start_main_~main__y~0 ULTIMATE.start_main_~main__j~0))} is VALID [2020-07-28 18:17:18,911 INFO L280 TraceCheckUtils]: 4: Hoare triple {205#(and (<= ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__x~0) (= ULTIMATE.start_main_~main__y~0 ULTIMATE.start_main_~main__j~0))} assume 0 != main_~main__x~0;main_~main____CPAchecker_TMP_0~0 := main_~main__x~0;main_~main__x~0 := main_~main__x~0 - 1;main_~main____CPAchecker_TMP_1~0 := main_~main__y~0;main_~main__y~0 := main_~main__y~0 - 1; {206#(and (<= (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0) (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0)) (<= (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0) (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0)))} is VALID [2020-07-28 18:17:18,913 INFO L280 TraceCheckUtils]: 5: Hoare triple {206#(and (<= (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0) (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0)) (<= (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0) (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0)))} assume 0 != main_~main__x~0;main_~main____CPAchecker_TMP_0~0 := main_~main__x~0;main_~main__x~0 := main_~main__x~0 - 1;main_~main____CPAchecker_TMP_1~0 := main_~main__y~0;main_~main__y~0 := main_~main__y~0 - 1; {206#(and (<= (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0) (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0)) (<= (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0) (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0)))} is VALID [2020-07-28 18:17:18,915 INFO L280 TraceCheckUtils]: 6: Hoare triple {206#(and (<= (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0) (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0)) (<= (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0) (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0)))} assume 0 != main_~main__x~0;main_~main____CPAchecker_TMP_0~0 := main_~main__x~0;main_~main__x~0 := main_~main__x~0 - 1;main_~main____CPAchecker_TMP_1~0 := main_~main__y~0;main_~main__y~0 := main_~main__y~0 - 1; {207#(and (or (< 0 (+ ULTIMATE.start_main_~main__y~0 1)) (<= (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0) (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0))) (or (<= (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0) (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0)) (<= ULTIMATE.start_main_~main__y~0 0)))} is VALID [2020-07-28 18:17:18,916 INFO L280 TraceCheckUtils]: 7: Hoare triple {207#(and (or (< 0 (+ ULTIMATE.start_main_~main__y~0 1)) (<= (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0) (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0))) (or (<= (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0) (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0)) (<= ULTIMATE.start_main_~main__y~0 0)))} assume !(0 != main_~main__x~0); {208#(and (or (<= ULTIMATE.start_main_~main__j~0 (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0)) (< 0 (+ ULTIMATE.start_main_~main__y~0 1))) (or (<= (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0) ULTIMATE.start_main_~main__j~0) (<= ULTIMATE.start_main_~main__y~0 0)))} is VALID [2020-07-28 18:17:18,918 INFO L280 TraceCheckUtils]: 8: Hoare triple {208#(and (or (<= ULTIMATE.start_main_~main__j~0 (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0)) (< 0 (+ ULTIMATE.start_main_~main__y~0 1))) (or (<= (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0) ULTIMATE.start_main_~main__j~0) (<= ULTIMATE.start_main_~main__y~0 0)))} assume main_~main__i~0 == main_~main__j~0;havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if 0 == main_~main__y~0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {209#(not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-28 18:17:18,919 INFO L280 TraceCheckUtils]: 9: Hoare triple {209#(not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))} assume 0 == main_~__VERIFIER_assert__cond~0; {204#false} is VALID [2020-07-28 18:17:18,919 INFO L280 TraceCheckUtils]: 10: Hoare triple {204#false} assume !false; {204#false} is VALID [2020-07-28 18:17:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:17:18,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291858299] [2020-07-28 18:17:18,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538286685] [2020-07-28 18:17:18,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:17:18,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:17:18,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:17:18,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-28 18:17:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:18,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:17:19,204 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:17:19,243 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 18:17:19,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {203#true} ~__return_main~0 := 0;~__return_72~0 := 0; {203#true} is VALID [2020-07-28 18:17:19,295 INFO L280 TraceCheckUtils]: 1: Hoare triple {203#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__x~0, main_~main__y~0, main_~main__i~0, main_~main__j~0;havoc main_~main__i~0;havoc main_~main__j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~main__i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~main__j~0 := main_#t~nondet1;havoc main_#t~nondet1; {203#true} is VALID [2020-07-28 18:17:19,295 INFO L280 TraceCheckUtils]: 2: Hoare triple {203#true} assume !!(main_~main__i~0 >= 0); {203#true} is VALID [2020-07-28 18:17:19,296 INFO L280 TraceCheckUtils]: 3: Hoare triple {203#true} assume !!(main_~main__j~0 >= 0);main_~main__x~0 := main_~main__i~0;main_~main__y~0 := main_~main__j~0; {205#(and (<= ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__x~0) (= ULTIMATE.start_main_~main__y~0 ULTIMATE.start_main_~main__j~0))} is VALID [2020-07-28 18:17:19,298 INFO L280 TraceCheckUtils]: 4: Hoare triple {205#(and (<= ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__x~0) (= ULTIMATE.start_main_~main__y~0 ULTIMATE.start_main_~main__j~0))} assume 0 != main_~main__x~0;main_~main____CPAchecker_TMP_0~0 := main_~main__x~0;main_~main__x~0 := main_~main__x~0 - 1;main_~main____CPAchecker_TMP_1~0 := main_~main__y~0;main_~main__y~0 := main_~main__y~0 - 1; {225#(and (= ULTIMATE.start_main_~main__j~0 (+ ULTIMATE.start_main_~main__y~0 1)) (<= (+ ULTIMATE.start_main_~main__x~0 1) ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 (+ ULTIMATE.start_main_~main__x~0 1)))} is VALID [2020-07-28 18:17:19,300 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#(and (= ULTIMATE.start_main_~main__j~0 (+ ULTIMATE.start_main_~main__y~0 1)) (<= (+ ULTIMATE.start_main_~main__x~0 1) ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 (+ ULTIMATE.start_main_~main__x~0 1)))} assume 0 != main_~main__x~0;main_~main____CPAchecker_TMP_0~0 := main_~main__x~0;main_~main__x~0 := main_~main__x~0 - 1;main_~main____CPAchecker_TMP_1~0 := main_~main__y~0;main_~main__y~0 := main_~main__y~0 - 1; {229#(and (<= ULTIMATE.start_main_~main__i~0 (+ ULTIMATE.start_main_~main__x~0 2)) (<= (+ ULTIMATE.start_main_~main__x~0 2) ULTIMATE.start_main_~main__i~0) (= (+ ULTIMATE.start_main_~main__y~0 2) ULTIMATE.start_main_~main__j~0))} is VALID [2020-07-28 18:17:19,301 INFO L280 TraceCheckUtils]: 6: Hoare triple {229#(and (<= ULTIMATE.start_main_~main__i~0 (+ ULTIMATE.start_main_~main__x~0 2)) (<= (+ ULTIMATE.start_main_~main__x~0 2) ULTIMATE.start_main_~main__i~0) (= (+ ULTIMATE.start_main_~main__y~0 2) ULTIMATE.start_main_~main__j~0))} assume 0 != main_~main__x~0;main_~main____CPAchecker_TMP_0~0 := main_~main__x~0;main_~main__x~0 := main_~main__x~0 - 1;main_~main____CPAchecker_TMP_1~0 := main_~main__y~0;main_~main__y~0 := main_~main__y~0 - 1; {233#(and (<= (+ ULTIMATE.start_main_~main__x~0 3) ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 (+ ULTIMATE.start_main_~main__x~0 3)) (= (+ ULTIMATE.start_main_~main__y~0 3) ULTIMATE.start_main_~main__j~0))} is VALID [2020-07-28 18:17:19,304 INFO L280 TraceCheckUtils]: 7: Hoare triple {233#(and (<= (+ ULTIMATE.start_main_~main__x~0 3) ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 (+ ULTIMATE.start_main_~main__x~0 3)) (= (+ ULTIMATE.start_main_~main__y~0 3) ULTIMATE.start_main_~main__j~0))} assume !(0 != main_~main__x~0); {237#(and (<= 3 ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 3) (= (+ ULTIMATE.start_main_~main__y~0 3) ULTIMATE.start_main_~main__j~0))} is VALID [2020-07-28 18:17:19,305 INFO L280 TraceCheckUtils]: 8: Hoare triple {237#(and (<= 3 ULTIMATE.start_main_~main__i~0) (<= ULTIMATE.start_main_~main__i~0 3) (= (+ ULTIMATE.start_main_~main__y~0 3) ULTIMATE.start_main_~main__j~0))} assume main_~main__i~0 == main_~main__j~0;havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if 0 == main_~main__y~0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {241#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} is VALID [2020-07-28 18:17:19,307 INFO L280 TraceCheckUtils]: 9: Hoare triple {241#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} assume 0 == main_~__VERIFIER_assert__cond~0; {204#false} is VALID [2020-07-28 18:17:19,307 INFO L280 TraceCheckUtils]: 10: Hoare triple {204#false} assume !false; {204#false} is VALID [2020-07-28 18:17:19,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:17:19,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:17:19,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2020-07-28 18:17:19,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141443470] [2020-07-28 18:17:19,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2020-07-28 18:17:19,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:19,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-28 18:17:19,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:19,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-28 18:17:19,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:17:19,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-28 18:17:19,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-07-28 18:17:19,339 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2020-07-28 18:17:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:19,674 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-28 18:17:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-28 18:17:19,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2020-07-28 18:17:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:17:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-07-28 18:17:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:17:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-07-28 18:17:19,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 16 transitions. [2020-07-28 18:17:19,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:19,700 INFO L225 Difference]: With dead ends: 15 [2020-07-28 18:17:19,700 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:17:19,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-07-28 18:17:19,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:17:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:17:19,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:19,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:19,702 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:19,702 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:19,703 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:17:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:19,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:19,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:19,704 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:19,704 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:19,704 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:17:19,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:19,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:19,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:19,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:19,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:17:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:17:19,706 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-07-28 18:17:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:19,706 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:17:19,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-28 18:17:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:19,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:19,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:17:19,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:17:19,998 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:17:19,998 INFO L268 CegarLoopResult]: For program point L23(lines 23 66) no Hoare annotation was computed. [2020-07-28 18:17:19,998 INFO L268 CegarLoopResult]: For program point L17(lines 17 67) no Hoare annotation was computed. [2020-07-28 18:17:19,999 INFO L268 CegarLoopResult]: For program point L42(lines 42 64) no Hoare annotation was computed. [2020-07-28 18:17:19,999 INFO L264 CegarLoopResult]: At program point L38(lines 28 66) the Hoare annotation is: (let ((.cse1 (+ ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__y~0)) (.cse0 (+ ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-28 18:17:19,999 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 18:17:19,999 INFO L271 CegarLoopResult]: At program point L63(lines 11 68) the Hoare annotation is: true [2020-07-28 18:17:19,999 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:17:19,999 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:17:20,000 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2020-07-28 18:17:20,000 INFO L268 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2020-07-28 18:17:20,000 INFO L268 CegarLoopResult]: For program point L49(lines 49 58) no Hoare annotation was computed. [2020-07-28 18:17:20,005 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:17:20,006 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:17:20,006 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-28 18:17:20,006 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-28 18:17:20,006 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:17:20,006 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 18:17:20,007 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 18:17:20,007 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:17:20,008 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 18:17:20,009 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 18:17:20,009 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 18:17:20,009 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-28 18:17:20,009 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-28 18:17:20,009 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 18:17:20,009 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 18:17:20,010 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:17:20,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:17:20 BoogieIcfgContainer [2020-07-28 18:17:20,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:17:20,024 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:17:20,024 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:17:20,025 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:17:20,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:17:16" (3/4) ... [2020-07-28 18:17:20,029 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:17:20,042 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 18:17:20,043 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:17:20,095 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:17:20,096 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:17:20,099 INFO L168 Benchmark]: Toolchain (without parser) took 4316.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:20,100 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:17:20,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.04 ms. Allocated memory is still 1.0 GB. Free memory was 958.9 MB in the beginning and 946.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:20,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:20,102 INFO L168 Benchmark]: Boogie Preprocessor took 17.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:17:20,103 INFO L168 Benchmark]: RCFGBuilder took 325.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:20,104 INFO L168 Benchmark]: TraceAbstraction took 3537.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -54.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:20,104 INFO L168 Benchmark]: Witness Printer took 72.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:17:20,108 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.04 ms. Allocated memory is still 1.0 GB. Free memory was 958.9 MB in the beginning and 946.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 325.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3537.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -54.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Witness Printer took 72.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: 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 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: main__x + main__j <= main__i + main__y && main__i + main__y <= main__x + main__j - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.3s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 24 SDtfs, 34 SDslu, 53 SDs, 0 SdLazy, 116 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 11 NumberOfFragments, 16 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 105 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 2855 SizeOfPredicates, 12 NumberOfNonLiveVariables, 98 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1/14 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...