./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/jm2006.i --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.i -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 a57214b8cc70a079b1a1b78b0ccf782486db0e4a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:15,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:17:15,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:17:15,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:17:15,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:17:15,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:17:15,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:17:15,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:17:15,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:17:15,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:17:15,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:17:15,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:17:15,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:17:15,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:17:15,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:17:15,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:17:15,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:17:15,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:17:15,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:17:15,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:17:15,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:17:15,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:17:15,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:17:15,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:17:15,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:17:15,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:17:15,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:17:15,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:17:15,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:17:15,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:17:15,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:17:15,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:17:15,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:17:15,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:17:15,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:17:15,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:17:15,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:17:15,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:17:15,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:17:15,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:17:15,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:17:15,866 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:15,882 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:17:15,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:17:15,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:17:15,884 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:17:15,884 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:17:15,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:17:15,885 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:17:15,885 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:17:15,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:17:15,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:17:15,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:17:15,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:17:15,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:17:15,886 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:17:15,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:17:15,887 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:17:15,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:17:15,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:17:15,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:17:15,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:17:15,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:17:15,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:17:15,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:17:15,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:17:15,890 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:17:15,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:17:15,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:17:15,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:17:15,891 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:17:15,891 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 -> a57214b8cc70a079b1a1b78b0ccf782486db0e4a [2020-07-28 18:17:16,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:17:16,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:17:16,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:17:16,203 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:17:16,206 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:17:16,207 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/jm2006.i [2020-07-28 18:17:16,283 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf195c74e/1c084573ac244e97844015df9804ed57/FLAGd36f40ae8 [2020-07-28 18:17:16,777 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:17:16,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/jm2006.i [2020-07-28 18:17:16,786 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf195c74e/1c084573ac244e97844015df9804ed57/FLAGd36f40ae8 [2020-07-28 18:17:17,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf195c74e/1c084573ac244e97844015df9804ed57 [2020-07-28 18:17:17,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:17:17,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:17:17,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:17:17,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:17:17,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:17:17,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:17:17" (1/1) ... [2020-07-28 18:17:17,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b0ad4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:17, skipping insertion in model container [2020-07-28 18:17:17,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:17:17" (1/1) ... [2020-07-28 18:17:17,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:17:17,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:17:17,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:17:17,408 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:17:17,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:17:17,438 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:17:17,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:17 WrapperNode [2020-07-28 18:17:17,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:17:17,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:17:17,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:17:17,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:17:17,446 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:17" (1/1) ... [2020-07-28 18:17:17,451 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:17" (1/1) ... [2020-07-28 18:17:17,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:17:17,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:17:17,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:17:17,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:17:17,545 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:17" (1/1) ... [2020-07-28 18:17:17,546 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:17" (1/1) ... [2020-07-28 18:17:17,546 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:17" (1/1) ... [2020-07-28 18:17:17,547 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:17" (1/1) ... [2020-07-28 18:17:17,550 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:17" (1/1) ... [2020-07-28 18:17:17,555 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:17" (1/1) ... [2020-07-28 18:17:17,556 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:17" (1/1) ... [2020-07-28 18:17:17,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:17:17,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:17:17,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:17:17,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:17:17,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:17" (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:17,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:17:17,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:17:17,853 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:17:17,854 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:17:17,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:17:17 BoogieIcfgContainer [2020-07-28 18:17:17,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:17:17,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:17:17,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:17:17,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:17:17,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:17:17" (1/3) ... [2020-07-28 18:17:17,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419e4431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:17:17, skipping insertion in model container [2020-07-28 18:17:17,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:17:17" (2/3) ... [2020-07-28 18:17:17,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419e4431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:17:17, skipping insertion in model container [2020-07-28 18:17:17,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:17:17" (3/3) ... [2020-07-28 18:17:17,867 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006.i [2020-07-28 18:17:17,878 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:17:17,886 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:17:17,905 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:17:17,937 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:17:17,938 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:17:17,938 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:17:17,938 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:17:17,938 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:17:17,939 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:17:17,939 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:17:17,939 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:17:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-07-28 18:17:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 18:17:17,962 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:17,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 18:17:17,964 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:17,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:17,977 INFO L82 PathProgramCache]: Analyzing trace with hash 922201356, now seen corresponding path program 1 times [2020-07-28 18:17:17,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:17:17,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641864627] [2020-07-28 18:17:17,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:17:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:18,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {14#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post3, main_~i~0, main_~j~0, main_~x~0, main_~y~0;havoc main_~i~0;havoc main_~j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; {14#true} is VALID [2020-07-28 18:17:18,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {14#true} assume !!(main_~i~0 >= 0 && main_~j~0 >= 0);main_~x~0 := main_~i~0;main_~y~0 := main_~j~0; {14#true} is VALID [2020-07-28 18:17:18,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {14#true} assume !true; {15#false} is VALID [2020-07-28 18:17:18,130 INFO L280 TraceCheckUtils]: 3: Hoare triple {15#false} assume main_~i~0 == main_~j~0;__VERIFIER_assert_#in~cond := (if 0 == main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15#false} is VALID [2020-07-28 18:17:18,130 INFO L280 TraceCheckUtils]: 4: Hoare triple {15#false} assume 0 == __VERIFIER_assert_~cond; {15#false} is VALID [2020-07-28 18:17:18,131 INFO L280 TraceCheckUtils]: 5: Hoare triple {15#false} assume !false; {15#false} is VALID [2020-07-28 18:17:18,133 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:18,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641864627] [2020-07-28 18:17:18,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:17:18,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:17:18,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692012927] [2020-07-28 18:17:18,147 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 18:17:18,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:18,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:17:18,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:18,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:17:18,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:17:18,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:17:18,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:17:18,207 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2020-07-28 18:17:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:18,250 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-07-28 18:17:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:17:18,251 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 18:17:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:17:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 24 transitions. [2020-07-28 18:17:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:17:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 24 transitions. [2020-07-28 18:17:18,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 24 transitions. [2020-07-28 18:17:18,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:18,321 INFO L225 Difference]: With dead ends: 19 [2020-07-28 18:17:18,322 INFO L226 Difference]: Without dead ends: 7 [2020-07-28 18:17:18,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:17:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-07-28 18:17:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-28 18:17:18,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:18,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2020-07-28 18:17:18,352 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2020-07-28 18:17:18,352 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2020-07-28 18:17:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:18,354 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2020-07-28 18:17:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-07-28 18:17:18,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:18,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:18,355 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2020-07-28 18:17:18,356 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2020-07-28 18:17:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:18,357 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2020-07-28 18:17:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-07-28 18:17:18,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:18,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:18,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:18,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:17:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2020-07-28 18:17:18,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 6 [2020-07-28 18:17:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:18,362 INFO L479 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-07-28 18:17:18,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:17:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-07-28 18:17:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 18:17:18,363 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:18,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 18:17:18,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:17:18,363 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash 922082192, now seen corresponding path program 1 times [2020-07-28 18:17:18,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:17:18,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244577437] [2020-07-28 18:17:18,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:17:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:18,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post3, main_~i~0, main_~j~0, main_~x~0, main_~y~0;havoc main_~i~0;havoc main_~j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; {64#true} is VALID [2020-07-28 18:17:18,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#true} assume !!(main_~i~0 >= 0 && main_~j~0 >= 0);main_~x~0 := main_~i~0;main_~y~0 := main_~j~0; {66#(and (or (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0) (not (= 0 ULTIMATE.start_main_~x~0)) (<= 1 ULTIMATE.start_main_~j~0)) (or (= 0 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0)))} is VALID [2020-07-28 18:17:18,610 INFO L280 TraceCheckUtils]: 2: Hoare triple {66#(and (or (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0) (not (= 0 ULTIMATE.start_main_~x~0)) (<= 1 ULTIMATE.start_main_~j~0)) (or (= 0 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0)))} assume !(0 != main_~x~0); {67#(and (or (= 0 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~j~0)) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:17:18,612 INFO L280 TraceCheckUtils]: 3: Hoare triple {67#(and (or (= 0 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~j~0)) (= 0 ULTIMATE.start_main_~i~0))} assume main_~i~0 == main_~j~0;__VERIFIER_assert_#in~cond := (if 0 == main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {68#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:17:18,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {65#false} is VALID [2020-07-28 18:17:18,614 INFO L280 TraceCheckUtils]: 5: Hoare triple {65#false} assume !false; {65#false} is VALID [2020-07-28 18:17:18,615 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:18,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244577437] [2020-07-28 18:17:18,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:17:18,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:17:18,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376451055] [2020-07-28 18:17:18,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-07-28 18:17:18,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:18,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:17:18,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:18,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:17:18,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:17:18,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:17:18,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:17:18,631 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2020-07-28 18:17:18,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:18,706 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-28 18:17:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:17:18,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-07-28 18:17:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:17:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-07-28 18:17:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:17:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-07-28 18:17:18,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 12 transitions. [2020-07-28 18:17:18,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:18,729 INFO L225 Difference]: With dead ends: 12 [2020-07-28 18:17:18,729 INFO L226 Difference]: Without dead ends: 8 [2020-07-28 18:17:18,730 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:17:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-28 18:17:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-28 18:17:18,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:18,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2020-07-28 18:17:18,737 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:17:18,738 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:17:18,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:18,739 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2020-07-28 18:17:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-07-28 18:17:18,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:18,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:18,740 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:17:18,740 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:17:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:18,742 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2020-07-28 18:17:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-07-28 18:17:18,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:18,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:18,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:18,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:17:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-07-28 18:17:18,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2020-07-28 18:17:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:18,745 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-07-28 18:17:18,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:17:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-07-28 18:17:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:17:18,746 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:18,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:17:18,747 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:17:18,747 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1478617325, now seen corresponding path program 1 times [2020-07-28 18:17:18,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:17:18,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980921667] [2020-07-28 18:17:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:17:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:18,931 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post3, main_~i~0, main_~j~0, main_~x~0, main_~y~0;havoc main_~i~0;havoc main_~j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; {113#true} is VALID [2020-07-28 18:17:18,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} assume !!(main_~i~0 >= 0 && main_~j~0 >= 0);main_~x~0 := main_~i~0;main_~y~0 := main_~j~0; {115#(and (= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:17:18,934 INFO L280 TraceCheckUtils]: 2: Hoare triple {115#(and (= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {116#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:17:18,936 INFO L280 TraceCheckUtils]: 3: Hoare triple {116#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~i~0))} assume !(0 != main_~x~0); {117#(and (or (<= ULTIMATE.start_main_~y~0 0) (<= ULTIMATE.start_main_~i~0 1)) (or (<= 1 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~y~0 1))) (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 1)))} is VALID [2020-07-28 18:17:18,937 INFO L280 TraceCheckUtils]: 4: Hoare triple {117#(and (or (<= ULTIMATE.start_main_~y~0 0) (<= ULTIMATE.start_main_~i~0 1)) (or (<= 1 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~y~0 1))) (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 1)))} assume main_~i~0 == main_~j~0;__VERIFIER_assert_#in~cond := (if 0 == main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {118#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:17:18,939 INFO L280 TraceCheckUtils]: 5: Hoare triple {118#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {114#false} is VALID [2020-07-28 18:17:18,939 INFO L280 TraceCheckUtils]: 6: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-28 18:17:18,942 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,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980921667] [2020-07-28 18:17:18,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146043190] [2020-07-28 18:17:18,943 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:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:18,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-28 18:17:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:18,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:17:19,164 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post3, main_~i~0, main_~j~0, main_~x~0, main_~y~0;havoc main_~i~0;havoc main_~j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; {113#true} is VALID [2020-07-28 18:17:19,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} assume !!(main_~i~0 >= 0 && main_~j~0 >= 0);main_~x~0 := main_~i~0;main_~y~0 := main_~j~0; {115#(and (= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:17:19,167 INFO L280 TraceCheckUtils]: 2: Hoare triple {115#(and (= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {116#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:17:19,168 INFO L280 TraceCheckUtils]: 3: Hoare triple {116#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~i~0))} assume !(0 != main_~x~0); {131#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:17:19,169 INFO L280 TraceCheckUtils]: 4: Hoare triple {131#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= 1 ULTIMATE.start_main_~i~0))} assume main_~i~0 == main_~j~0;__VERIFIER_assert_#in~cond := (if 0 == main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {135#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:17:19,171 INFO L280 TraceCheckUtils]: 5: Hoare triple {135#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {114#false} is VALID [2020-07-28 18:17:19,171 INFO L280 TraceCheckUtils]: 6: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-28 18:17:19,172 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:19,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:17:19,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-28 18:17:19,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081688530] [2020-07-28 18:17:19,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2020-07-28 18:17:19,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:19,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 18:17:19,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:19,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 18:17:19,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:17:19,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 18:17:19,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:17:19,191 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2020-07-28 18:17:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:19,333 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-28 18:17:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 18:17:19,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2020-07-28 18:17:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:17:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-07-28 18:17:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:17:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-07-28 18:17:19,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2020-07-28 18:17:19,369 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:19,370 INFO L225 Difference]: With dead ends: 13 [2020-07-28 18:17:19,371 INFO L226 Difference]: Without dead ends: 9 [2020-07-28 18:17:19,371 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:17:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-28 18:17:19,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-28 18:17:19,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:19,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2020-07-28 18:17:19,390 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:17:19,391 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:17:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:19,392 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2020-07-28 18:17:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:17:19,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:19,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:19,393 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:17:19,393 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:17:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:19,394 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2020-07-28 18:17:19,394 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:17:19,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:19,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:19,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:19,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:17:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-07-28 18:17:19,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-07-28 18:17:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:19,400 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-07-28 18:17:19,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 18:17:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:17:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:17:19,402 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:19,402 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-28 18:17:19,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 18:17:19,604 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:19,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:19,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1409108976, now seen corresponding path program 2 times [2020-07-28 18:17:19,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:17:19,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008368729] [2020-07-28 18:17:19,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:17:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:19,865 INFO L280 TraceCheckUtils]: 0: Hoare triple {191#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post3, main_~i~0, main_~j~0, main_~x~0, main_~y~0;havoc main_~i~0;havoc main_~j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; {191#true} is VALID [2020-07-28 18:17:19,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {191#true} assume !!(main_~i~0 >= 0 && main_~j~0 >= 0);main_~x~0 := main_~i~0;main_~y~0 := main_~j~0; {193#(and (= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:17:19,869 INFO L280 TraceCheckUtils]: 2: Hoare triple {193#(and (= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {194#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:17:19,870 INFO L280 TraceCheckUtils]: 3: Hoare triple {194#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~i~0))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {195#(and (or (< 0 (+ ULTIMATE.start_main_~y~0 1)) (<= (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0))) (or (<= ULTIMATE.start_main_~y~0 0) (<= (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0))))} is VALID [2020-07-28 18:17:19,873 INFO L280 TraceCheckUtils]: 4: Hoare triple {195#(and (or (< 0 (+ ULTIMATE.start_main_~y~0 1)) (<= (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0))) (or (<= ULTIMATE.start_main_~y~0 0) (<= (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0))))} assume !(0 != main_~x~0); {196#(and (or (< 0 (+ ULTIMATE.start_main_~y~0 1)) (<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0))) (or (<= (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~y~0 0)))} is VALID [2020-07-28 18:17:19,876 INFO L280 TraceCheckUtils]: 5: Hoare triple {196#(and (or (< 0 (+ ULTIMATE.start_main_~y~0 1)) (<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0))) (or (<= (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~y~0 0)))} assume main_~i~0 == main_~j~0;__VERIFIER_assert_#in~cond := (if 0 == main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {197#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:17:19,877 INFO L280 TraceCheckUtils]: 6: Hoare triple {197#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {192#false} is VALID [2020-07-28 18:17:19,877 INFO L280 TraceCheckUtils]: 7: Hoare triple {192#false} assume !false; {192#false} is VALID [2020-07-28 18:17:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:17:19,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008368729] [2020-07-28 18:17:19,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453069743] [2020-07-28 18:17:19,879 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) [2020-07-28 18:17:19,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:17:19,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:17:19,918 WARN L261 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 19 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:17:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:19,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:17:20,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {191#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post3, main_~i~0, main_~j~0, main_~x~0, main_~y~0;havoc main_~i~0;havoc main_~j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; {191#true} is VALID [2020-07-28 18:17:20,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {191#true} assume !!(main_~i~0 >= 0 && main_~j~0 >= 0);main_~x~0 := main_~i~0;main_~y~0 := main_~j~0; {193#(and (= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:17:20,125 INFO L280 TraceCheckUtils]: 2: Hoare triple {193#(and (= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {194#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:17:20,127 INFO L280 TraceCheckUtils]: 3: Hoare triple {194#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~i~0))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {210#(and (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 2)) (= (+ ULTIMATE.start_main_~x~0 2) ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:17:20,128 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#(and (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 2)) (= (+ ULTIMATE.start_main_~x~0 2) ULTIMATE.start_main_~i~0))} assume !(0 != main_~x~0); {214#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 2)))} is VALID [2020-07-28 18:17:20,129 INFO L280 TraceCheckUtils]: 5: Hoare triple {214#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 2)))} assume main_~i~0 == main_~j~0;__VERIFIER_assert_#in~cond := (if 0 == main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {218#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:17:20,130 INFO L280 TraceCheckUtils]: 6: Hoare triple {218#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {192#false} is VALID [2020-07-28 18:17:20,131 INFO L280 TraceCheckUtils]: 7: Hoare triple {192#false} assume !false; {192#false} is VALID [2020-07-28 18:17:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:17:20,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:17:20,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-28 18:17:20,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763000582] [2020-07-28 18:17:20,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2020-07-28 18:17:20,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:20,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 18:17:20,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:20,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 18:17:20,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:17:20,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 18:17:20,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:17:20,156 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 10 states. [2020-07-28 18:17:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:20,472 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 18:17:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 18:17:20,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2020-07-28 18:17:20,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:17:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-07-28 18:17:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:17:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-07-28 18:17:20,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2020-07-28 18:17:20,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:20,510 INFO L225 Difference]: With dead ends: 17 [2020-07-28 18:17:20,510 INFO L226 Difference]: Without dead ends: 11 [2020-07-28 18:17:20,511 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-28 18:17:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-28 18:17:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-28 18:17:20,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:20,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2020-07-28 18:17:20,531 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 18:17:20,531 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 18:17:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:20,533 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-07-28 18:17:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:17:20,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:20,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:20,534 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 18:17:20,534 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 18:17:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:20,535 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-07-28 18:17:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:17:20,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:20,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:20,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:20,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:17:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-07-28 18:17:20,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2020-07-28 18:17:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:20,539 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-07-28 18:17:20,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 18:17:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:17:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 18:17:20,541 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:20,541 INFO L422 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2020-07-28 18:17:20,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:17:20,753 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:20,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:20,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1290413136, now seen corresponding path program 3 times [2020-07-28 18:17:20,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:17:20,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903842124] [2020-07-28 18:17:20,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:17:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:20,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {292#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post3, main_~i~0, main_~j~0, main_~x~0, main_~y~0;havoc main_~i~0;havoc main_~j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; {292#true} is VALID [2020-07-28 18:17:20,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {292#true} assume !!(main_~i~0 >= 0 && main_~j~0 >= 0);main_~x~0 := main_~i~0;main_~y~0 := main_~j~0; {294#(and (= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:17:20,957 INFO L280 TraceCheckUtils]: 2: Hoare triple {294#(and (= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {295#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:17:20,958 INFO L280 TraceCheckUtils]: 3: Hoare triple {295#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~i~0))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {296#(and (<= (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0)) (<= (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-28 18:17:20,960 INFO L280 TraceCheckUtils]: 4: Hoare triple {296#(and (<= (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0)) (<= (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0)))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {296#(and (<= (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0)) (<= (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-28 18:17:20,962 INFO L280 TraceCheckUtils]: 5: Hoare triple {296#(and (<= (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0)) (<= (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0)))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {297#(and (or (< 0 (+ ULTIMATE.start_main_~y~0 1)) (<= (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0))) (or (<= ULTIMATE.start_main_~y~0 0) (<= (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0))))} is VALID [2020-07-28 18:17:20,963 INFO L280 TraceCheckUtils]: 6: Hoare triple {297#(and (or (< 0 (+ ULTIMATE.start_main_~y~0 1)) (<= (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0))) (or (<= ULTIMATE.start_main_~y~0 0) (<= (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0))))} assume !(0 != main_~x~0); {298#(and (or (< 0 (+ ULTIMATE.start_main_~y~0 1)) (<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0))) (or (<= (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~y~0 0)))} is VALID [2020-07-28 18:17:20,964 INFO L280 TraceCheckUtils]: 7: Hoare triple {298#(and (or (< 0 (+ ULTIMATE.start_main_~y~0 1)) (<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0))) (or (<= (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~y~0 0)))} assume main_~i~0 == main_~j~0;__VERIFIER_assert_#in~cond := (if 0 == main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {299#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:17:20,965 INFO L280 TraceCheckUtils]: 8: Hoare triple {299#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {293#false} is VALID [2020-07-28 18:17:20,966 INFO L280 TraceCheckUtils]: 9: Hoare triple {293#false} assume !false; {293#false} is VALID [2020-07-28 18:17:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:17:20,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903842124] [2020-07-28 18:17:20,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329634626] [2020-07-28 18:17:20,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:17:21,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-28 18:17:21,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:17:21,004 WARN L261 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-28 18:17:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:21,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:17:21,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {292#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post3, main_~i~0, main_~j~0, main_~x~0, main_~y~0;havoc main_~i~0;havoc main_~j~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; {292#true} is VALID [2020-07-28 18:17:21,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {292#true} assume !!(main_~i~0 >= 0 && main_~j~0 >= 0);main_~x~0 := main_~i~0;main_~y~0 := main_~j~0; {294#(and (= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:17:21,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {294#(and (= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~x~0))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {295#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:17:21,215 INFO L280 TraceCheckUtils]: 3: Hoare triple {295#(and (= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~j~0) (= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~i~0))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {312#(and (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 2)) (= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~x~0 2)))} is VALID [2020-07-28 18:17:21,217 INFO L280 TraceCheckUtils]: 4: Hoare triple {312#(and (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 2)) (= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~x~0 2)))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {316#(and (= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~x~0 3)) (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 3)))} is VALID [2020-07-28 18:17:21,218 INFO L280 TraceCheckUtils]: 5: Hoare triple {316#(and (= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~x~0 3)) (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 3)))} assume !!(0 != main_~x~0);main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~y~0;main_~y~0 := main_#t~post3 - 1;havoc main_#t~post3; {320#(and (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 4)) (= (+ ULTIMATE.start_main_~x~0 4) ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:17:21,219 INFO L280 TraceCheckUtils]: 6: Hoare triple {320#(and (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 4)) (= (+ ULTIMATE.start_main_~x~0 4) ULTIMATE.start_main_~i~0))} assume !(0 != main_~x~0); {324#(and (= 4 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 4)))} is VALID [2020-07-28 18:17:21,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {324#(and (= 4 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~y~0 4)))} assume main_~i~0 == main_~j~0;__VERIFIER_assert_#in~cond := (if 0 == main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {328#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:17:21,220 INFO L280 TraceCheckUtils]: 8: Hoare triple {328#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {293#false} is VALID [2020-07-28 18:17:21,221 INFO L280 TraceCheckUtils]: 9: Hoare triple {293#false} assume !false; {293#false} is VALID [2020-07-28 18:17:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:17:21,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:17:21,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2020-07-28 18:17:21,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699740467] [2020-07-28 18:17:21,222 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2020-07-28 18:17:21,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:21,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-28 18:17:21,242 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:21,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-28 18:17:21,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:17:21,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-28 18:17:21,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-07-28 18:17:21,243 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 13 states. [2020-07-28 18:17:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:21,582 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-28 18:17:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-28 18:17:21,582 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2020-07-28 18:17:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 18:17:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-07-28 18:17:21,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 18:17:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-07-28 18:17:21,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 15 transitions. [2020-07-28 18:17:21,605 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 18:17:21,605 INFO L225 Difference]: With dead ends: 14 [2020-07-28 18:17:21,605 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:17:21,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2020-07-28 18:17:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:17:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:17:21,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:21,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:21,607 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:21,607 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:21,608 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:17:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:21,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:21,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:21,608 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:21,608 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:21,609 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:17:21,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:21,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:21,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:21,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:21,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:17:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:17:21,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2020-07-28 18:17:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:21,610 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:17:21,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-28 18:17:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:21,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:21,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:17:21,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:17:21,905 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:17:21,905 INFO L271 CegarLoopResult]: At program point L27(lines 13 28) the Hoare annotation is: true [2020-07-28 18:17:21,905 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-28 18:17:21,905 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:17:21,905 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:17:21,906 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:17:21,906 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:17:21,906 INFO L271 CegarLoopResult]: At program point L24(lines 24 26) the Hoare annotation is: true [2020-07-28 18:17:21,906 INFO L264 CegarLoopResult]: At program point L20-2(lines 20 23) the Hoare annotation is: (let ((.cse1 (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~i~0)) (.cse0 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-28 18:17:21,906 INFO L268 CegarLoopResult]: For program point L20-3(lines 13 28) no Hoare annotation was computed. [2020-07-28 18:17:21,906 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-28 18:17:21,910 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:17:21,910 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-28 18:17:21,910 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-28 18:17:21,910 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:17:21,910 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-28 18:17:21,910 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-28 18:17:21,911 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:17:21,911 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-28 18:17:21,911 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-28 18:17:21,912 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:17:21,912 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:17:21,912 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:17:21,912 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:17:21,912 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:17:21,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:17:21 BoogieIcfgContainer [2020-07-28 18:17:21,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:17:21,923 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:17:21,923 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:17:21,923 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:17:21,924 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:17" (3/4) ... [2020-07-28 18:17:21,930 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:17:21,941 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:17:21,941 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:17:21,987 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:17:21,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:17:21,990 INFO L168 Benchmark]: Toolchain (without parser) took 4786.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:21,990 INFO L168 Benchmark]: CDTParser took 0.99 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:21,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.56 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:21,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:21,992 INFO L168 Benchmark]: Boogie Preprocessor took 23.16 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:21,993 INFO L168 Benchmark]: RCFGBuilder took 299.26 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: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:21,994 INFO L168 Benchmark]: TraceAbstraction took 4063.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.3 MB). Peak memory consumption was 62.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:21,994 INFO L168 Benchmark]: Witness Printer took 63.87 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:21,997 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.99 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 233.56 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 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 95.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.16 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 299.26 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: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4063.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.3 MB). Peak memory consumption was 62.6 MB. Max. memory is 11.5 GB. * Witness Printer took 63.87 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: 8]: 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: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: x + j <= y + i && y + i <= x + j - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 4, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 SDtfs, 19 SDslu, 36 SDs, 0 SdLazy, 157 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 10 NumberOfFragments, 17 HoareAnnotationTreeSize, 3 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 87 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 2949 SizeOfPredicates, 18 NumberOfNonLiveVariables, 116 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1/28 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...