/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/jm2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:29:21,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:29:21,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:29:21,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:29:21,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:29:21,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:29:21,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:29:21,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:29:21,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:29:21,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:29:21,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:29:21,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:29:21,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:29:21,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:29:21,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:29:21,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:29:21,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:29:21,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:29:21,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:29:21,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:29:21,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:29:21,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:29:21,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:29:21,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:29:21,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:29:21,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:29:21,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:29:21,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:29:21,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:29:21,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:29:21,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:29:21,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:29:21,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:29:21,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:29:21,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:29:21,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:29:21,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:29:21,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:29:21,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:29:21,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:29:21,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:29:21,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:29:21,581 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:29:21,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:29:21,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:29:21,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:29:21,582 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:29:21,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:29:21,583 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:29:21,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:29:21,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:29:21,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:29:21,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:29:21,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:29:21,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:29:21,584 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:29:21,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:29:21,585 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:29:21,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:29:21,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:29:21,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:29:21,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:29:21,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:29:21,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:21,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:29:21,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:29:21,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:29:21,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:29:21,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:29:21,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:29:21,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:29:21,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:29:21,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:29:21,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:29:21,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:29:21,891 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:29:21,892 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:29:21,893 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.i [2020-07-10 15:29:21,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd48c3fb0/c11cc795e4d1452a908982d22e2879d4/FLAG3a5a59daa [2020-07-10 15:29:22,414 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:29:22,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i [2020-07-10 15:29:22,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd48c3fb0/c11cc795e4d1452a908982d22e2879d4/FLAG3a5a59daa [2020-07-10 15:29:22,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd48c3fb0/c11cc795e4d1452a908982d22e2879d4 [2020-07-10 15:29:22,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:29:22,845 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:29:22,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:22,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:29:22,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:29:22,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:22" (1/1) ... [2020-07-10 15:29:22,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386982a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:22, skipping insertion in model container [2020-07-10 15:29:22,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:22" (1/1) ... [2020-07-10 15:29:22,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:29:22,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:29:23,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:23,089 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:29:23,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:23,128 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:29:23,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23 WrapperNode [2020-07-10 15:29:23,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:23,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:29:23,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:29:23,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:29:23,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:29:23,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:29:23,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:29:23,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:29:23,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:23,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:29:23,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:29:23,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:29:23,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:29:23,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:29:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:29:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:29:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:29:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:29:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:29:23,329 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:29:23,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:29:23,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:29:23,602 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:29:23,603 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:29:23,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:23 BoogieIcfgContainer [2020-07-10 15:29:23,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:29:23,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:29:23,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:29:23,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:29:23,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:29:22" (1/3) ... [2020-07-10 15:29:23,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71830ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:23, skipping insertion in model container [2020-07-10 15:29:23,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (2/3) ... [2020-07-10 15:29:23,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71830ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:23, skipping insertion in model container [2020-07-10 15:29:23,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:23" (3/3) ... [2020-07-10 15:29:23,619 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006.i [2020-07-10 15:29:23,631 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:29:23,638 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:29:23,655 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:29:23,681 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:29:23,681 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:29:23,681 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:29:23,682 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:29:23,682 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:29:23,682 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:29:23,682 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:29:23,682 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:29:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-10 15:29:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:29:23,708 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:23,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:23,709 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:23,716 INFO L82 PathProgramCache]: Analyzing trace with hash -42161200, now seen corresponding path program 1 times [2020-07-10 15:29:23,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:23,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990463470] [2020-07-10 15:29:23,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:24,128 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 15:29:24,129 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #50#return; {23#true} is VALID [2020-07-10 15:29:24,131 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-10 15:29:24,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 15:29:24,132 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #50#return; {23#true} is VALID [2020-07-10 15:29:24,132 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret4 := main(); {23#true} is VALID [2020-07-10 15:29:24,133 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2020-07-10 15:29:24,135 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {27#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-10 15:29:24,137 INFO L280 TraceCheckUtils]: 6: Hoare triple {27#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} assume !(0 != ~x~0); {28#(and (or (<= (+ main_~i~0 main_~y~0) main_~j~0) (<= main_~y~0 0)) (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-10 15:29:24,138 INFO L280 TraceCheckUtils]: 7: Hoare triple {28#(and (or (<= (+ main_~i~0 main_~y~0) main_~j~0) (<= main_~y~0 0)) (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {29#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2020-07-10 15:29:24,140 INFO L263 TraceCheckUtils]: 8: Hoare triple {29#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {30#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:24,141 INFO L280 TraceCheckUtils]: 9: Hoare triple {30#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {31#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:24,142 INFO L280 TraceCheckUtils]: 10: Hoare triple {31#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {24#false} is VALID [2020-07-10 15:29:24,143 INFO L280 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-10 15:29:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:24,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990463470] [2020-07-10 15:29:24,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:24,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:29:24,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087190308] [2020-07-10 15:29:24,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-10 15:29:24,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:24,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:29:24,186 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-10 15:29:24,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:29:24,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:24,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:29:24,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:29:24,199 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 7 states. [2020-07-10 15:29:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:24,570 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2020-07-10 15:29:24,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:29:24,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-10 15:29:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:29:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2020-07-10 15:29:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:29:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2020-07-10 15:29:24,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2020-07-10 15:29:24,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:24,677 INFO L225 Difference]: With dead ends: 46 [2020-07-10 15:29:24,677 INFO L226 Difference]: Without dead ends: 14 [2020-07-10 15:29:24,680 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:29:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-10 15:29:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-10 15:29:24,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:24,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:24,723 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:24,723 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:24,726 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:29:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:24,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:24,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:24,727 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:24,727 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:24,730 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:29:24,730 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:24,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:24,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:24,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:24,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:29:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-10 15:29:24,734 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-07-10 15:29:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:24,735 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-10 15:29:24,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:29:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:29:24,736 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:24,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:24,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:29:24,737 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash 219103455, now seen corresponding path program 1 times [2020-07-10 15:29:24,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:24,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394136846] [2020-07-10 15:29:24,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:24,960 INFO L280 TraceCheckUtils]: 0: Hoare triple {146#true} assume true; {146#true} is VALID [2020-07-10 15:29:24,960 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {146#true} {146#true} #50#return; {146#true} is VALID [2020-07-10 15:29:24,961 INFO L263 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {146#true} is VALID [2020-07-10 15:29:24,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {146#true} assume true; {146#true} is VALID [2020-07-10 15:29:24,961 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {146#true} {146#true} #50#return; {146#true} is VALID [2020-07-10 15:29:24,962 INFO L263 TraceCheckUtils]: 3: Hoare triple {146#true} call #t~ret4 := main(); {146#true} is VALID [2020-07-10 15:29:24,962 INFO L280 TraceCheckUtils]: 4: Hoare triple {146#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1; {146#true} is VALID [2020-07-10 15:29:24,963 INFO L280 TraceCheckUtils]: 5: Hoare triple {146#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {150#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)))} is VALID [2020-07-10 15:29:24,965 INFO L280 TraceCheckUtils]: 6: Hoare triple {150#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)))} assume !!(0 != ~x~0);#t~post2 := ~x~0;~x~0 := #t~post2 - 1;havoc #t~post2;#t~post3 := ~y~0;~y~0 := #t~post3 - 1;havoc #t~post3; {151#(and (or (<= (+ main_~y~0 main_~i~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (< 0 (+ main_~y~0 1)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0))))} is VALID [2020-07-10 15:29:24,966 INFO L280 TraceCheckUtils]: 7: Hoare triple {151#(and (or (<= (+ main_~y~0 main_~i~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (< 0 (+ main_~y~0 1)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0))))} assume !(0 != ~x~0); {152#(and (or (<= main_~j~0 (+ main_~y~0 main_~i~0)) (< 0 (+ main_~y~0 1))) (or (<= (+ main_~y~0 main_~i~0) main_~j~0) (<= main_~y~0 0)))} is VALID [2020-07-10 15:29:24,968 INFO L280 TraceCheckUtils]: 8: Hoare triple {152#(and (or (<= main_~j~0 (+ main_~y~0 main_~i~0)) (< 0 (+ main_~y~0 1))) (or (<= (+ main_~y~0 main_~i~0) main_~j~0) (<= main_~y~0 0)))} assume ~i~0 == ~j~0; {153#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2020-07-10 15:29:24,970 INFO L263 TraceCheckUtils]: 9: Hoare triple {153#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {154#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:24,971 INFO L280 TraceCheckUtils]: 10: Hoare triple {154#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {155#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:24,971 INFO L280 TraceCheckUtils]: 11: Hoare triple {155#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {147#false} is VALID [2020-07-10 15:29:24,972 INFO L280 TraceCheckUtils]: 12: Hoare triple {147#false} assume !false; {147#false} is VALID [2020-07-10 15:29:24,973 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-10 15:29:24,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394136846] [2020-07-10 15:29:24,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176661178] [2020-07-10 15:29:24,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,035 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-10 15:29:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,051 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:25,212 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:25,266 INFO L263 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {146#true} is VALID [2020-07-10 15:29:25,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {146#true} assume true; {146#true} is VALID [2020-07-10 15:29:25,266 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {146#true} {146#true} #50#return; {146#true} is VALID [2020-07-10 15:29:25,267 INFO L263 TraceCheckUtils]: 3: Hoare triple {146#true} call #t~ret4 := main(); {146#true} is VALID [2020-07-10 15:29:25,267 INFO L280 TraceCheckUtils]: 4: Hoare triple {146#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1; {146#true} is VALID [2020-07-10 15:29:25,268 INFO L280 TraceCheckUtils]: 5: Hoare triple {146#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {174#(and (= main_~j~0 main_~y~0) (= main_~i~0 main_~x~0))} is VALID [2020-07-10 15:29:25,269 INFO L280 TraceCheckUtils]: 6: Hoare triple {174#(and (= main_~j~0 main_~y~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post2 := ~x~0;~x~0 := #t~post2 - 1;havoc #t~post2;#t~post3 := ~y~0;~y~0 := #t~post3 - 1;havoc #t~post3; {178#(and (= main_~i~0 (+ main_~x~0 1)) (= main_~j~0 (+ main_~y~0 1)))} is VALID [2020-07-10 15:29:25,270 INFO L280 TraceCheckUtils]: 7: Hoare triple {178#(and (= main_~i~0 (+ main_~x~0 1)) (= main_~j~0 (+ main_~y~0 1)))} assume !(0 != ~x~0); {182#(and (= main_~j~0 (+ main_~y~0 1)) (= 1 main_~i~0))} is VALID [2020-07-10 15:29:25,271 INFO L280 TraceCheckUtils]: 8: Hoare triple {182#(and (= main_~j~0 (+ main_~y~0 1)) (= 1 main_~i~0))} assume ~i~0 == ~j~0; {153#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2020-07-10 15:29:25,273 INFO L263 TraceCheckUtils]: 9: Hoare triple {153#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:25,273 INFO L280 TraceCheckUtils]: 10: Hoare triple {189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:25,274 INFO L280 TraceCheckUtils]: 11: Hoare triple {193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {147#false} is VALID [2020-07-10 15:29:25,274 INFO L280 TraceCheckUtils]: 12: Hoare triple {147#false} assume !false; {147#false} is VALID [2020-07-10 15:29:25,276 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-10 15:29:25,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:25,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-10 15:29:25,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861563734] [2020-07-10 15:29:25,278 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2020-07-10 15:29:25,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:25,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:29:25,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:25,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:29:25,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:25,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:29:25,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:29:25,305 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2020-07-10 15:29:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:25,644 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-10 15:29:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:29:25,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2020-07-10 15:29:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2020-07-10 15:29:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2020-07-10 15:29:25,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 18 transitions. [2020-07-10 15:29:25,681 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-10 15:29:25,682 INFO L225 Difference]: With dead ends: 17 [2020-07-10 15:29:25,682 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:29:25,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2020-07-10 15:29:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:29:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:29:25,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:25,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:25,685 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:25,685 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:25,686 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:25,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:25,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:25,687 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:25,687 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:25,687 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:25,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:25,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:25,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:25,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:29:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:29:25,689 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-10 15:29:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:25,690 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:29:25,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:29:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:25,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:25,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:29:25,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:29:25,979 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:29:25,980 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:25,980 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:25,980 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:29:25,980 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:29:25,981 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:25,981 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:25,981 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:29:25,981 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:25,982 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:25,982 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 28) the Hoare annotation is: true [2020-07-10 15:29:25,982 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) [2020-07-10 15:29:25,982 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 28) no Hoare annotation was computed. [2020-07-10 15:29:25,982 INFO L268 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2020-07-10 15:29:25,983 INFO L264 CegarLoopResult]: At program point L20-2(lines 20 23) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~y~0)) (.cse0 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 15:29:25,983 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-10 15:29:25,983 INFO L268 CegarLoopResult]: For program point L20-3(lines 13 28) no Hoare annotation was computed. [2020-07-10 15:29:25,983 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 28) no Hoare annotation was computed. [2020-07-10 15:29:25,984 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:29:25,984 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:25,984 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:29:25,984 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:29:25,984 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:25,985 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:29:25,989 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:25,990 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:25,990 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:25,990 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:25,990 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:25,990 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:25,991 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:25,991 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:25,991 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:25,991 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:25,991 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:25,991 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:25,991 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:25,992 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:29:25,992 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:25,992 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 15:29:25,992 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 15:29:25,994 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:25,994 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:25,994 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:29:25,995 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:25,995 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 15:29:25,995 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 15:29:25,995 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:25,995 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:29:25,995 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:29:25,996 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:29:26,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:26 BoogieIcfgContainer [2020-07-10 15:29:26,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:26,013 INFO L168 Benchmark]: Toolchain (without parser) took 3167.52 ms. Allocated memory was 138.4 MB in the beginning and 248.0 MB in the end (delta: 109.6 MB). Free memory was 103.8 MB in the beginning and 192.6 MB in the end (delta: -88.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:26,014 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:29:26,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.86 ms. Allocated memory is still 138.4 MB. Free memory was 103.6 MB in the beginning and 93.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:26,016 INFO L168 Benchmark]: Boogie Preprocessor took 133.50 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 93.5 MB in the beginning and 181.6 MB in the end (delta: -88.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:26,017 INFO L168 Benchmark]: RCFGBuilder took 344.53 ms. Allocated memory is still 201.9 MB. Free memory was 181.6 MB in the beginning and 163.0 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:26,018 INFO L168 Benchmark]: TraceAbstraction took 2399.06 ms. Allocated memory was 201.9 MB in the beginning and 248.0 MB in the end (delta: 46.1 MB). Free memory was 162.3 MB in the beginning and 192.6 MB in the end (delta: -30.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:26,022 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.26 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 282.86 ms. Allocated memory is still 138.4 MB. Free memory was 103.6 MB in the beginning and 93.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.50 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 93.5 MB in the beginning and 181.6 MB in the end (delta: -88.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 344.53 ms. Allocated memory is still 201.9 MB. Free memory was 181.6 MB in the beginning and 163.0 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2399.06 ms. Allocated memory was 201.9 MB in the beginning and 248.0 MB in the end (delta: 46.1 MB). Free memory was 162.3 MB in the beginning and 192.6 MB in the end (delta: -30.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 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: 20]: Loop Invariant Derived loop invariant: x + j <= i + y && i + y <= x + j - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.2s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28 SDtfs, 25 SDslu, 118 SDs, 0 SdLazy, 83 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 15 NumberOfFragments, 29 HoareAnnotationTreeSize, 10 FomulaSimplifications, 46 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 2343 SizeOfPredicates, 5 NumberOfNonLiveVariables, 42 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2 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...