/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/cggmp2005.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:29:02,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:29:02,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:29:02,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:29:02,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:29:02,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:29:02,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:29:02,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:29:02,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:29:02,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:29:02,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:29:02,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:29:02,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:29:02,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:29:02,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:29:02,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:29:02,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:29:02,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:29:02,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:29:02,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:29:02,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:29:02,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:29:02,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:29:02,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:29:02,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:29:02,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:29:02,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:29:02,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:29:02,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:29:02,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:29:02,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:29:02,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:29:02,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:29:02,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:29:02,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:29:02,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:29:02,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:29:02,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:29:02,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:29:02,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:29:02,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:29:02,586 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:02,600 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:29:02,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:29:02,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:29:02,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:29:02,602 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:29:02,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:29:02,602 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:29:02,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:29:02,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:29:02,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:29:02,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:29:02,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:29:02,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:29:02,604 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:29:02,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:29:02,604 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:29:02,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:29:02,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:29:02,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:29:02,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:29:02,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:29:02,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:02,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:29:02,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:29:02,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:29:02,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:29:02,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:29:02,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:29:02,607 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:29:02,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:29:02,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:29:02,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:29:02,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:29:02,989 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:29:02,990 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:29:02,991 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005.i [2020-07-10 15:29:03,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1269352e5/281126c8c29b4bec815bc9bb3196e375/FLAGc3ac87fca [2020-07-10 15:29:03,506 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:29:03,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005.i [2020-07-10 15:29:03,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1269352e5/281126c8c29b4bec815bc9bb3196e375/FLAGc3ac87fca [2020-07-10 15:29:03,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1269352e5/281126c8c29b4bec815bc9bb3196e375 [2020-07-10 15:29:03,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:29:03,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:29:03,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:03,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:29:03,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:29:03,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:03" (1/1) ... [2020-07-10 15:29:03,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11e615c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:03, skipping insertion in model container [2020-07-10 15:29:03,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:03" (1/1) ... [2020-07-10 15:29:03,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:29:03,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:29:04,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:04,129 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:29:04,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:04,158 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:29:04,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:04 WrapperNode [2020-07-10 15:29:04,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:04,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:29:04,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:29:04,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:29:04,169 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:04" (1/1) ... [2020-07-10 15:29:04,170 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:04" (1/1) ... [2020-07-10 15:29:04,174 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:04" (1/1) ... [2020-07-10 15:29:04,174 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:04" (1/1) ... [2020-07-10 15:29:04,179 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:04" (1/1) ... [2020-07-10 15:29:04,184 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:04" (1/1) ... [2020-07-10 15:29:04,185 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:04" (1/1) ... [2020-07-10 15:29:04,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:29:04,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:29:04,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:29:04,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:29:04,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:04" (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:04,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:29:04,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:29:04,349 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:29:04,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:29:04,349 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:29:04,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:29:04,350 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:29:04,350 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:29:04,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:29:04,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:29:04,350 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:29:04,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:29:04,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:29:04,560 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:29:04,561 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:29:04,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:04 BoogieIcfgContainer [2020-07-10 15:29:04,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:29:04,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:29:04,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:29:04,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:29:04,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:29:03" (1/3) ... [2020-07-10 15:29:04,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf5e53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:04, skipping insertion in model container [2020-07-10 15:29:04,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:04" (2/3) ... [2020-07-10 15:29:04,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf5e53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:04, skipping insertion in model container [2020-07-10 15:29:04,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:04" (3/3) ... [2020-07-10 15:29:04,573 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005.i [2020-07-10 15:29:04,587 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:29:04,597 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:29:04,617 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:29:04,642 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:29:04,642 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:29:04,642 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:29:04,643 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:29:04,643 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:29:04,643 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:29:04,643 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:29:04,643 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:29:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-07-10 15:29:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:29:04,669 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:04,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:04,670 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:04,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:04,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1782755915, now seen corresponding path program 1 times [2020-07-10 15:29:04,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:04,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321997690] [2020-07-10 15:29:04,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:04,883 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-10 15:29:04,884 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {21#true} {21#true} #40#return; {21#true} is VALID [2020-07-10 15:29:04,885 INFO L263 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2020-07-10 15:29:04,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-10 15:29:04,886 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #40#return; {21#true} is VALID [2020-07-10 15:29:04,886 INFO L263 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret0 := main(); {21#true} is VALID [2020-07-10 15:29:04,888 INFO L280 TraceCheckUtils]: 4: Hoare triple {21#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {25#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-10 15:29:04,889 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#(<= (+ main_~i~0 9) main_~j~0)} assume !(~j~0 >= ~i~0); {22#false} is VALID [2020-07-10 15:29:04,890 INFO L263 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {22#false} is VALID [2020-07-10 15:29:04,890 INFO L280 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2020-07-10 15:29:04,890 INFO L280 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2020-07-10 15:29:04,891 INFO L280 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2020-07-10 15:29:04,892 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:04,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321997690] [2020-07-10 15:29:04,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:04,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:29:04,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204933749] [2020-07-10 15:29:04,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-10 15:29:04,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:04,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:29:04,939 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-10 15:29:04,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:29:04,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:04,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:29:04,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:29:04,951 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-07-10 15:29:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:05,059 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-10 15:29:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:29:05,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-10 15:29:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:29:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2020-07-10 15:29:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:29:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2020-07-10 15:29:05,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2020-07-10 15:29:05,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:05,151 INFO L225 Difference]: With dead ends: 31 [2020-07-10 15:29:05,151 INFO L226 Difference]: Without dead ends: 12 [2020-07-10 15:29:05,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:29:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-10 15:29:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-10 15:29:05,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:05,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2020-07-10 15:29:05,194 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-10 15:29:05,195 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-10 15:29:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:05,198 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-10 15:29:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-10 15:29:05,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:05,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:05,200 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-10 15:29:05,200 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-10 15:29:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:05,203 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-10 15:29:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-10 15:29:05,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:05,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:05,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:05,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:29:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-07-10 15:29:05,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2020-07-10 15:29:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:05,209 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-07-10 15:29:05,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:29:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-10 15:29:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:29:05,210 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:05,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:05,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:29:05,211 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:05,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash 604679234, now seen corresponding path program 1 times [2020-07-10 15:29:05,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:05,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195512867] [2020-07-10 15:29:05,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:05,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-10 15:29:05,270 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {113#true} {113#true} #40#return; {113#true} is VALID [2020-07-10 15:29:05,271 INFO L263 TraceCheckUtils]: 0: Hoare triple {113#true} call ULTIMATE.init(); {113#true} is VALID [2020-07-10 15:29:05,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-10 15:29:05,272 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {113#true} {113#true} #40#return; {113#true} is VALID [2020-07-10 15:29:05,272 INFO L263 TraceCheckUtils]: 3: Hoare triple {113#true} call #t~ret0 := main(); {113#true} is VALID [2020-07-10 15:29:05,273 INFO L280 TraceCheckUtils]: 4: Hoare triple {113#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {117#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-10 15:29:05,275 INFO L280 TraceCheckUtils]: 5: Hoare triple {117#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {118#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-10 15:29:05,276 INFO L280 TraceCheckUtils]: 6: Hoare triple {118#(<= (+ main_~i~0 6) main_~j~0)} assume !(~j~0 >= ~i~0); {114#false} is VALID [2020-07-10 15:29:05,277 INFO L263 TraceCheckUtils]: 7: Hoare triple {114#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {114#false} is VALID [2020-07-10 15:29:05,277 INFO L280 TraceCheckUtils]: 8: Hoare triple {114#false} ~cond := #in~cond; {114#false} is VALID [2020-07-10 15:29:05,277 INFO L280 TraceCheckUtils]: 9: Hoare triple {114#false} assume 0 == ~cond; {114#false} is VALID [2020-07-10 15:29:05,278 INFO L280 TraceCheckUtils]: 10: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-10 15:29:05,279 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:05,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195512867] [2020-07-10 15:29:05,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166287291] [2020-07-10 15:29:05,280 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:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:05,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:29:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:05,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:05,445 INFO L263 TraceCheckUtils]: 0: Hoare triple {113#true} call ULTIMATE.init(); {113#true} is VALID [2020-07-10 15:29:05,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-10 15:29:05,446 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {113#true} {113#true} #40#return; {113#true} is VALID [2020-07-10 15:29:05,446 INFO L263 TraceCheckUtils]: 3: Hoare triple {113#true} call #t~ret0 := main(); {113#true} is VALID [2020-07-10 15:29:05,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {113#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {134#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:29:05,449 INFO L280 TraceCheckUtils]: 5: Hoare triple {134#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {138#(and (<= 9 main_~j~0) (<= main_~i~0 3))} is VALID [2020-07-10 15:29:05,450 INFO L280 TraceCheckUtils]: 6: Hoare triple {138#(and (<= 9 main_~j~0) (<= main_~i~0 3))} assume !(~j~0 >= ~i~0); {114#false} is VALID [2020-07-10 15:29:05,451 INFO L263 TraceCheckUtils]: 7: Hoare triple {114#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {114#false} is VALID [2020-07-10 15:29:05,451 INFO L280 TraceCheckUtils]: 8: Hoare triple {114#false} ~cond := #in~cond; {114#false} is VALID [2020-07-10 15:29:05,452 INFO L280 TraceCheckUtils]: 9: Hoare triple {114#false} assume 0 == ~cond; {114#false} is VALID [2020-07-10 15:29:05,452 INFO L280 TraceCheckUtils]: 10: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-10 15:29:05,453 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:05,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:05,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-10 15:29:05,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608514654] [2020-07-10 15:29:05,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-10 15:29:05,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:05,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:29:05,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:05,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:29:05,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:05,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:29:05,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:29:05,480 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2020-07-10 15:29:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:05,551 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:29:05,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:29:05,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-10 15:29:05,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-10 15:29:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-10 15:29:05,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2020-07-10 15:29:05,584 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:05,585 INFO L225 Difference]: With dead ends: 18 [2020-07-10 15:29:05,585 INFO L226 Difference]: Without dead ends: 13 [2020-07-10 15:29:05,587 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:29:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-10 15:29:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-10 15:29:05,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:05,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:05,598 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:05,599 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:05,600 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-10 15:29:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:29:05,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:05,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:05,601 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:05,601 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:05,603 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-10 15:29:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:29:05,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:05,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:05,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:05,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-07-10 15:29:05,606 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2020-07-10 15:29:05,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:05,606 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-07-10 15:29:05,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:29:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:29:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:29:05,607 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:05,607 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:05,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:29:05,820 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:05,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1600724821, now seen corresponding path program 2 times [2020-07-10 15:29:05,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:05,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746998123] [2020-07-10 15:29:05,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:05,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {230#true} assume true; {230#true} is VALID [2020-07-10 15:29:05,903 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {230#true} {230#true} #40#return; {230#true} is VALID [2020-07-10 15:29:05,904 INFO L263 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {230#true} is VALID [2020-07-10 15:29:05,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {230#true} assume true; {230#true} is VALID [2020-07-10 15:29:05,905 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {230#true} {230#true} #40#return; {230#true} is VALID [2020-07-10 15:29:05,905 INFO L263 TraceCheckUtils]: 3: Hoare triple {230#true} call #t~ret0 := main(); {230#true} is VALID [2020-07-10 15:29:05,906 INFO L280 TraceCheckUtils]: 4: Hoare triple {230#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {234#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-10 15:29:05,907 INFO L280 TraceCheckUtils]: 5: Hoare triple {234#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {235#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-10 15:29:05,908 INFO L280 TraceCheckUtils]: 6: Hoare triple {235#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {236#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-10 15:29:05,909 INFO L280 TraceCheckUtils]: 7: Hoare triple {236#(<= (+ main_~i~0 3) main_~j~0)} assume !(~j~0 >= ~i~0); {231#false} is VALID [2020-07-10 15:29:05,910 INFO L263 TraceCheckUtils]: 8: Hoare triple {231#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {231#false} is VALID [2020-07-10 15:29:05,910 INFO L280 TraceCheckUtils]: 9: Hoare triple {231#false} ~cond := #in~cond; {231#false} is VALID [2020-07-10 15:29:05,910 INFO L280 TraceCheckUtils]: 10: Hoare triple {231#false} assume 0 == ~cond; {231#false} is VALID [2020-07-10 15:29:05,911 INFO L280 TraceCheckUtils]: 11: Hoare triple {231#false} assume !false; {231#false} is VALID [2020-07-10 15:29:05,911 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-10 15:29:05,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746998123] [2020-07-10 15:29:05,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272427736] [2020-07-10 15:29:05,912 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:05,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:29:05,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:29:05,949 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:29:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:05,958 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:06,079 INFO L263 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {230#true} is VALID [2020-07-10 15:29:06,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {230#true} assume true; {230#true} is VALID [2020-07-10 15:29:06,080 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {230#true} {230#true} #40#return; {230#true} is VALID [2020-07-10 15:29:06,081 INFO L263 TraceCheckUtils]: 3: Hoare triple {230#true} call #t~ret0 := main(); {230#true} is VALID [2020-07-10 15:29:06,082 INFO L280 TraceCheckUtils]: 4: Hoare triple {230#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {252#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:29:06,083 INFO L280 TraceCheckUtils]: 5: Hoare triple {252#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {256#(and (<= 9 main_~j~0) (<= main_~i~0 3))} is VALID [2020-07-10 15:29:06,084 INFO L280 TraceCheckUtils]: 6: Hoare triple {256#(and (<= 9 main_~j~0) (<= main_~i~0 3))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {260#(and (<= 8 main_~j~0) (<= main_~i~0 5))} is VALID [2020-07-10 15:29:06,085 INFO L280 TraceCheckUtils]: 7: Hoare triple {260#(and (<= 8 main_~j~0) (<= main_~i~0 5))} assume !(~j~0 >= ~i~0); {231#false} is VALID [2020-07-10 15:29:06,086 INFO L263 TraceCheckUtils]: 8: Hoare triple {231#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {231#false} is VALID [2020-07-10 15:29:06,086 INFO L280 TraceCheckUtils]: 9: Hoare triple {231#false} ~cond := #in~cond; {231#false} is VALID [2020-07-10 15:29:06,086 INFO L280 TraceCheckUtils]: 10: Hoare triple {231#false} assume 0 == ~cond; {231#false} is VALID [2020-07-10 15:29:06,087 INFO L280 TraceCheckUtils]: 11: Hoare triple {231#false} assume !false; {231#false} is VALID [2020-07-10 15:29:06,087 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-10 15:29:06,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:06,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-10 15:29:06,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295495831] [2020-07-10 15:29:06,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-10 15:29:06,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:06,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:29:06,109 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-10 15:29:06,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:29:06,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:29:06,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:29:06,111 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2020-07-10 15:29:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:06,184 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-10 15:29:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:29:06,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-10 15:29:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:29:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-10 15:29:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:29:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-10 15:29:06,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2020-07-10 15:29:06,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:06,221 INFO L225 Difference]: With dead ends: 19 [2020-07-10 15:29:06,221 INFO L226 Difference]: Without dead ends: 14 [2020-07-10 15:29:06,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:29:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-10 15:29:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-10 15:29:06,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:06,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:06,241 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:06,241 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:06,243 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:29:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:06,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:06,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:06,244 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:06,244 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:06,245 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:29:06,246 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:06,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:06,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:06,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:06,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:29:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-10 15:29:06,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-07-10 15:29:06,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:06,248 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-10 15:29:06,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:29:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:06,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:29:06,249 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:06,249 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:06,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:06,461 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:06,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:06,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1881600350, now seen corresponding path program 3 times [2020-07-10 15:29:06,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:06,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022910318] [2020-07-10 15:29:06,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:06,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {358#true} assume true; {358#true} is VALID [2020-07-10 15:29:06,539 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {358#true} {358#true} #40#return; {358#true} is VALID [2020-07-10 15:29:06,539 INFO L263 TraceCheckUtils]: 0: Hoare triple {358#true} call ULTIMATE.init(); {358#true} is VALID [2020-07-10 15:29:06,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {358#true} assume true; {358#true} is VALID [2020-07-10 15:29:06,540 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {358#true} {358#true} #40#return; {358#true} is VALID [2020-07-10 15:29:06,540 INFO L263 TraceCheckUtils]: 3: Hoare triple {358#true} call #t~ret0 := main(); {358#true} is VALID [2020-07-10 15:29:06,541 INFO L280 TraceCheckUtils]: 4: Hoare triple {358#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {362#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-10 15:29:06,542 INFO L280 TraceCheckUtils]: 5: Hoare triple {362#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {363#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-10 15:29:06,544 INFO L280 TraceCheckUtils]: 6: Hoare triple {363#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {364#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-10 15:29:06,545 INFO L280 TraceCheckUtils]: 7: Hoare triple {364#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {365#(<= main_~i~0 main_~j~0)} is VALID [2020-07-10 15:29:06,545 INFO L280 TraceCheckUtils]: 8: Hoare triple {365#(<= main_~i~0 main_~j~0)} assume !(~j~0 >= ~i~0); {359#false} is VALID [2020-07-10 15:29:06,546 INFO L263 TraceCheckUtils]: 9: Hoare triple {359#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {359#false} is VALID [2020-07-10 15:29:06,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#false} ~cond := #in~cond; {359#false} is VALID [2020-07-10 15:29:06,546 INFO L280 TraceCheckUtils]: 11: Hoare triple {359#false} assume 0 == ~cond; {359#false} is VALID [2020-07-10 15:29:06,546 INFO L280 TraceCheckUtils]: 12: Hoare triple {359#false} assume !false; {359#false} is VALID [2020-07-10 15:29:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:06,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022910318] [2020-07-10 15:29:06,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867084598] [2020-07-10 15:29:06,548 INFO L92 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-10 15:29:06,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:29:06,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:29:06,575 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:29:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:06,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:06,715 INFO L263 TraceCheckUtils]: 0: Hoare triple {358#true} call ULTIMATE.init(); {358#true} is VALID [2020-07-10 15:29:06,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {358#true} assume true; {358#true} is VALID [2020-07-10 15:29:06,716 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {358#true} {358#true} #40#return; {358#true} is VALID [2020-07-10 15:29:06,717 INFO L263 TraceCheckUtils]: 3: Hoare triple {358#true} call #t~ret0 := main(); {358#true} is VALID [2020-07-10 15:29:06,718 INFO L280 TraceCheckUtils]: 4: Hoare triple {358#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {381#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:29:06,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {381#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {385#(and (<= 9 main_~j~0) (<= main_~i~0 3))} is VALID [2020-07-10 15:29:06,720 INFO L280 TraceCheckUtils]: 6: Hoare triple {385#(and (<= 9 main_~j~0) (<= main_~i~0 3))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {389#(and (<= 8 main_~j~0) (<= main_~i~0 5))} is VALID [2020-07-10 15:29:06,722 INFO L280 TraceCheckUtils]: 7: Hoare triple {389#(and (<= 8 main_~j~0) (<= main_~i~0 5))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {393#(and (<= main_~i~0 7) (<= 7 main_~j~0))} is VALID [2020-07-10 15:29:06,723 INFO L280 TraceCheckUtils]: 8: Hoare triple {393#(and (<= main_~i~0 7) (<= 7 main_~j~0))} assume !(~j~0 >= ~i~0); {359#false} is VALID [2020-07-10 15:29:06,723 INFO L263 TraceCheckUtils]: 9: Hoare triple {359#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {359#false} is VALID [2020-07-10 15:29:06,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#false} ~cond := #in~cond; {359#false} is VALID [2020-07-10 15:29:06,724 INFO L280 TraceCheckUtils]: 11: Hoare triple {359#false} assume 0 == ~cond; {359#false} is VALID [2020-07-10 15:29:06,724 INFO L280 TraceCheckUtils]: 12: Hoare triple {359#false} assume !false; {359#false} is VALID [2020-07-10 15:29:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:06,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:06,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-07-10 15:29:06,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524702098] [2020-07-10 15:29:06,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2020-07-10 15:29:06,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:06,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:29:06,750 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:06,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:29:06,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:06,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:29:06,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:29:06,752 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2020-07-10 15:29:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:06,848 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-10 15:29:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:29:06,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2020-07-10 15:29:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:29:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-07-10 15:29:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:29:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-07-10 15:29:06,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2020-07-10 15:29:06,878 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:06,879 INFO L225 Difference]: With dead ends: 20 [2020-07-10 15:29:06,879 INFO L226 Difference]: Without dead ends: 15 [2020-07-10 15:29:06,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:29:06,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-10 15:29:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-10 15:29:06,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:06,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:06,909 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:06,909 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:06,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:06,911 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-10 15:29:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:29:06,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:06,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:06,916 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:06,916 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:06,918 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-10 15:29:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:29:06,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:06,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:06,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:06,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:29:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-07-10 15:29:06,922 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2020-07-10 15:29:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:06,922 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-10 15:29:06,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:29:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:29:06,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:29:06,927 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:06,927 INFO L422 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:07,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:07,128 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:07,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1835469045, now seen corresponding path program 4 times [2020-07-10 15:29:07,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:07,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034786629] [2020-07-10 15:29:07,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:07,318 INFO L280 TraceCheckUtils]: 0: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-10 15:29:07,318 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {497#true} {497#true} #40#return; {497#true} is VALID [2020-07-10 15:29:07,319 INFO L263 TraceCheckUtils]: 0: Hoare triple {497#true} call ULTIMATE.init(); {497#true} is VALID [2020-07-10 15:29:07,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-10 15:29:07,319 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {497#true} {497#true} #40#return; {497#true} is VALID [2020-07-10 15:29:07,319 INFO L263 TraceCheckUtils]: 3: Hoare triple {497#true} call #t~ret0 := main(); {497#true} is VALID [2020-07-10 15:29:07,320 INFO L280 TraceCheckUtils]: 4: Hoare triple {497#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {501#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2020-07-10 15:29:07,321 INFO L280 TraceCheckUtils]: 5: Hoare triple {501#(and (<= main_~j~0 10) (<= 10 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {502#(and (<= 9 main_~j~0) (<= main_~j~0 9))} is VALID [2020-07-10 15:29:07,322 INFO L280 TraceCheckUtils]: 6: Hoare triple {502#(and (<= 9 main_~j~0) (<= main_~j~0 9))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {503#(and (<= main_~j~0 8) (<= 8 main_~j~0))} is VALID [2020-07-10 15:29:07,323 INFO L280 TraceCheckUtils]: 7: Hoare triple {503#(and (<= main_~j~0 8) (<= 8 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {504#(and (<= main_~j~0 7) (<= 7 main_~j~0))} is VALID [2020-07-10 15:29:07,324 INFO L280 TraceCheckUtils]: 8: Hoare triple {504#(and (<= main_~j~0 7) (<= 7 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {505#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2020-07-10 15:29:07,325 INFO L280 TraceCheckUtils]: 9: Hoare triple {505#(and (<= main_~j~0 6) (< 5 main_~j~0))} assume !(~j~0 >= ~i~0); {505#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2020-07-10 15:29:07,326 INFO L263 TraceCheckUtils]: 10: Hoare triple {505#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {506#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:07,327 INFO L280 TraceCheckUtils]: 11: Hoare triple {506#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {507#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:07,328 INFO L280 TraceCheckUtils]: 12: Hoare triple {507#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {498#false} is VALID [2020-07-10 15:29:07,328 INFO L280 TraceCheckUtils]: 13: Hoare triple {498#false} assume !false; {498#false} is VALID [2020-07-10 15:29:07,329 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-10 15:29:07,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034786629] [2020-07-10 15:29:07,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680653540] [2020-07-10 15:29:07,330 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:07,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 15:29:07,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:29:07,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-10 15:29:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:07,362 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:07,434 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:07,488 INFO L263 TraceCheckUtils]: 0: Hoare triple {497#true} call ULTIMATE.init(); {497#true} is VALID [2020-07-10 15:29:07,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-10 15:29:07,489 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {497#true} {497#true} #40#return; {497#true} is VALID [2020-07-10 15:29:07,489 INFO L263 TraceCheckUtils]: 3: Hoare triple {497#true} call #t~ret0 := main(); {497#true} is VALID [2020-07-10 15:29:07,490 INFO L280 TraceCheckUtils]: 4: Hoare triple {497#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {501#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2020-07-10 15:29:07,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {501#(and (<= main_~j~0 10) (<= 10 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {502#(and (<= 9 main_~j~0) (<= main_~j~0 9))} is VALID [2020-07-10 15:29:07,492 INFO L280 TraceCheckUtils]: 6: Hoare triple {502#(and (<= 9 main_~j~0) (<= main_~j~0 9))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {503#(and (<= main_~j~0 8) (<= 8 main_~j~0))} is VALID [2020-07-10 15:29:07,494 INFO L280 TraceCheckUtils]: 7: Hoare triple {503#(and (<= main_~j~0 8) (<= 8 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {504#(and (<= main_~j~0 7) (<= 7 main_~j~0))} is VALID [2020-07-10 15:29:07,495 INFO L280 TraceCheckUtils]: 8: Hoare triple {504#(and (<= main_~j~0 7) (<= 7 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {505#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2020-07-10 15:29:07,496 INFO L280 TraceCheckUtils]: 9: Hoare triple {505#(and (<= main_~j~0 6) (< 5 main_~j~0))} assume !(~j~0 >= ~i~0); {505#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2020-07-10 15:29:07,497 INFO L263 TraceCheckUtils]: 10: Hoare triple {505#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:07,498 INFO L280 TraceCheckUtils]: 11: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:07,498 INFO L280 TraceCheckUtils]: 12: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {498#false} is VALID [2020-07-10 15:29:07,499 INFO L280 TraceCheckUtils]: 13: Hoare triple {498#false} assume !false; {498#false} is VALID [2020-07-10 15:29:07,499 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-10 15:29:07,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:07,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-07-10 15:29:07,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261431273] [2020-07-10 15:29:07,501 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-07-10 15:29:07,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:07,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:29:07,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:07,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:29:07,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:29:07,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:29:07,523 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 11 states. [2020-07-10 15:29:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:07,740 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-10 15:29:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:29:07,740 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-07-10 15:29:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:29:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2020-07-10 15:29:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:29:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2020-07-10 15:29:07,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 21 transitions. [2020-07-10 15:29:07,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:07,767 INFO L225 Difference]: With dead ends: 21 [2020-07-10 15:29:07,767 INFO L226 Difference]: Without dead ends: 16 [2020-07-10 15:29:07,768 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:29:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-10 15:29:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-10 15:29:07,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:07,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-10 15:29:07,781 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-10 15:29:07,781 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-10 15:29:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:07,783 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-10 15:29:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-10 15:29:07,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:07,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:07,784 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-10 15:29:07,784 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-10 15:29:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:07,785 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-10 15:29:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-10 15:29:07,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:07,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:07,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:07,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:29:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-10 15:29:07,788 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2020-07-10 15:29:07,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:07,788 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-10 15:29:07,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:29:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-10 15:29:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 15:29:07,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:07,789 INFO L422 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:08,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:08,002 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:08,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:08,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1100503298, now seen corresponding path program 5 times [2020-07-10 15:29:08,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:08,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287460459] [2020-07-10 15:29:08,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:08,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {648#true} assume true; {648#true} is VALID [2020-07-10 15:29:08,087 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {648#true} {648#true} #40#return; {648#true} is VALID [2020-07-10 15:29:08,087 INFO L263 TraceCheckUtils]: 0: Hoare triple {648#true} call ULTIMATE.init(); {648#true} is VALID [2020-07-10 15:29:08,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {648#true} assume true; {648#true} is VALID [2020-07-10 15:29:08,088 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {648#true} {648#true} #40#return; {648#true} is VALID [2020-07-10 15:29:08,088 INFO L263 TraceCheckUtils]: 3: Hoare triple {648#true} call #t~ret0 := main(); {648#true} is VALID [2020-07-10 15:29:08,090 INFO L280 TraceCheckUtils]: 4: Hoare triple {648#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {652#(<= main_~j~0 (+ main_~i~0 9))} is VALID [2020-07-10 15:29:08,102 INFO L280 TraceCheckUtils]: 5: Hoare triple {652#(<= main_~j~0 (+ main_~i~0 9))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {653#(<= main_~j~0 (+ main_~i~0 6))} is VALID [2020-07-10 15:29:08,107 INFO L280 TraceCheckUtils]: 6: Hoare triple {653#(<= main_~j~0 (+ main_~i~0 6))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {654#(<= main_~j~0 (+ main_~i~0 3))} is VALID [2020-07-10 15:29:08,110 INFO L280 TraceCheckUtils]: 7: Hoare triple {654#(<= main_~j~0 (+ main_~i~0 3))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {655#(<= main_~j~0 main_~i~0)} is VALID [2020-07-10 15:29:08,111 INFO L280 TraceCheckUtils]: 8: Hoare triple {655#(<= main_~j~0 main_~i~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {656#(<= (+ main_~j~0 3) main_~i~0)} is VALID [2020-07-10 15:29:08,112 INFO L280 TraceCheckUtils]: 9: Hoare triple {656#(<= (+ main_~j~0 3) main_~i~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {649#false} is VALID [2020-07-10 15:29:08,112 INFO L280 TraceCheckUtils]: 10: Hoare triple {649#false} assume !(~j~0 >= ~i~0); {649#false} is VALID [2020-07-10 15:29:08,113 INFO L263 TraceCheckUtils]: 11: Hoare triple {649#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {649#false} is VALID [2020-07-10 15:29:08,113 INFO L280 TraceCheckUtils]: 12: Hoare triple {649#false} ~cond := #in~cond; {649#false} is VALID [2020-07-10 15:29:08,113 INFO L280 TraceCheckUtils]: 13: Hoare triple {649#false} assume 0 == ~cond; {649#false} is VALID [2020-07-10 15:29:08,113 INFO L280 TraceCheckUtils]: 14: Hoare triple {649#false} assume !false; {649#false} is VALID [2020-07-10 15:29:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:08,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287460459] [2020-07-10 15:29:08,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:08,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:29:08,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834588987] [2020-07-10 15:29:08,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-10 15:29:08,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:08,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:29:08,138 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-10 15:29:08,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:29:08,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:08,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:29:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:29:08,139 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 7 states. [2020-07-10 15:29:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:08,208 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-10 15:29:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:29:08,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-10 15:29:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:29:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-07-10 15:29:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:29:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-07-10 15:29:08,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 16 transitions. [2020-07-10 15:29:08,230 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-10 15:29:08,230 INFO L225 Difference]: With dead ends: 16 [2020-07-10 15:29:08,231 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:29:08,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:29:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:29:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:29:08,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:08,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:08,232 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:08,232 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:08,232 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:08,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:08,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:08,233 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:08,233 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:08,233 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:08,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:08,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:08,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:08,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:29:08,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:29:08,234 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-07-10 15:29:08,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:08,234 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:29:08,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:29:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:08,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:08,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:29:08,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:29:08,389 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:29:08,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:08,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:08,389 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:29:08,389 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:29:08,390 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:08,390 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:08,390 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:29:08,390 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:08,390 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:08,390 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 23) the Hoare annotation is: true [2020-07-10 15:29:08,391 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 23) no Hoare annotation was computed. [2020-07-10 15:29:08,391 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-10 15:29:08,391 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 20) the Hoare annotation is: (or (and (<= main_~j~0 (+ main_~i~0 3)) (<= 8 main_~j~0) (<= main_~i~0 5)) (and (<= 10 main_~j~0) (<= main_~i~0 1) (<= main_~j~0 (+ main_~i~0 9))) (and (<= 9 main_~j~0) (<= main_~i~0 3) (<= main_~j~0 (+ main_~i~0 6))) (and (<= main_~j~0 6) (<= (+ main_~j~0 3) main_~i~0) (< 5 main_~j~0)) (and (<= main_~i~0 7) (<= 7 main_~j~0) (<= main_~j~0 main_~i~0))) [2020-07-10 15:29:08,391 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 20) the Hoare annotation is: (and (<= main_~j~0 6) (< 5 main_~j~0)) [2020-07-10 15:29:08,391 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 23) no Hoare annotation was computed. [2020-07-10 15:29:08,392 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:29:08,392 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:08,392 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:29:08,392 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:29:08,392 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:08,392 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:29:08,395 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:08,396 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:08,397 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:08,398 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:08,398 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:08,398 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:08,398 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:08,405 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:08,405 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:08,405 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:08,406 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:29:08,406 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 15:29:08,406 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:08,406 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:08,406 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:29:08,406 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 15:29:08,406 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:08,406 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:08,406 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:08,406 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:29:08,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:08 BoogieIcfgContainer [2020-07-10 15:29:08,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:08,421 INFO L168 Benchmark]: Toolchain (without parser) took 4512.43 ms. Allocated memory was 146.8 MB in the beginning and 246.4 MB in the end (delta: 99.6 MB). Free memory was 104.8 MB in the beginning and 192.0 MB in the end (delta: -87.2 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:08,424 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.8 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:29:08,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.75 ms. Allocated memory is still 146.8 MB. Free memory was 104.6 MB in the beginning and 95.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:08,428 INFO L168 Benchmark]: Boogie Preprocessor took 114.71 ms. Allocated memory was 146.8 MB in the beginning and 200.3 MB in the end (delta: 53.5 MB). Free memory was 95.1 MB in the beginning and 180.5 MB in the end (delta: -85.4 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:08,429 INFO L168 Benchmark]: RCFGBuilder took 288.63 ms. Allocated memory is still 200.3 MB. Free memory was 179.6 MB in the beginning and 164.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:08,430 INFO L168 Benchmark]: TraceAbstraction took 3851.90 ms. Allocated memory was 200.3 MB in the beginning and 246.4 MB in the end (delta: 46.1 MB). Free memory was 164.9 MB in the beginning and 192.0 MB in the end (delta: -27.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:08,439 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.23 ms. Allocated memory is still 146.8 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 249.75 ms. Allocated memory is still 146.8 MB. Free memory was 104.6 MB in the beginning and 95.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.71 ms. Allocated memory was 146.8 MB in the beginning and 200.3 MB in the end (delta: 53.5 MB). Free memory was 95.1 MB in the beginning and 180.5 MB in the end (delta: -85.4 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 288.63 ms. Allocated memory is still 200.3 MB. Free memory was 179.6 MB in the beginning and 164.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3851.90 ms. Allocated memory was 200.3 MB in the beginning and 246.4 MB in the end (delta: 46.1 MB). Free memory was 164.9 MB in the beginning and 192.0 MB in the end (delta: -27.1 MB). Peak memory consumption was 19.0 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: 17]: Loop Invariant Derived loop invariant: (((((j <= i + 3 && 8 <= j) && i <= 5) || ((10 <= j && i <= 1) && j <= i + 9)) || ((9 <= j && i <= 3) && j <= i + 6)) || ((j <= 6 && j + 3 <= i) && 5 < j)) || ((i <= 7 && 7 <= j) && j <= i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 5, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 60 SDtfs, 2 SDslu, 191 SDs, 0 SdLazy, 111 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 18 NumberOfFragments, 71 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 3685 SizeOfPredicates, 8 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 15/55 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...