java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sep05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d63d1fb [2018-01-27 23:05:03,501 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-27 23:05:03,503 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-27 23:05:03,528 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-27 23:05:03,528 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-27 23:05:03,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-27 23:05:03,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-27 23:05:03,534 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-27 23:05:03,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-27 23:05:03,538 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-27 23:05:03,539 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-27 23:05:03,539 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-27 23:05:03,540 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-27 23:05:03,541 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-27 23:05:03,550 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-27 23:05:03,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-27 23:05:03,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-27 23:05:03,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-27 23:05:03,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-27 23:05:03,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-27 23:05:03,567 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-27 23:05:03,568 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-27 23:05:03,569 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-27 23:05:03,569 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-27 23:05:03,570 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-27 23:05:03,573 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-27 23:05:03,573 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-27 23:05:03,574 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-27 23:05:03,574 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-27 23:05:03,574 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-27 23:05:03,575 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-27 23:05:03,577 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-27 23:05:03,588 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-27 23:05:03,588 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-27 23:05:03,589 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-27 23:05:03,589 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-27 23:05:03,589 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-27 23:05:03,589 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-27 23:05:03,589 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-27 23:05:03,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-27 23:05:03,590 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-27 23:05:03,590 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-27 23:05:03,590 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-27 23:05:03,591 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-27 23:05:03,591 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-27 23:05:03,591 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-27 23:05:03,591 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-27 23:05:03,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-27 23:05:03,592 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-27 23:05:03,592 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-27 23:05:03,592 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-27 23:05:03,592 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-27 23:05:03,592 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-27 23:05:03,592 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-27 23:05:03,593 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-27 23:05:03,593 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-27 23:05:03,594 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-27 23:05:03,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-27 23:05:03,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-27 23:05:03,595 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-27 23:05:03,595 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-27 23:05:03,595 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-27 23:05:03,595 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-27 23:05:03,595 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-27 23:05:03,596 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-27 23:05:03,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-27 23:05:03,596 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-27 23:05:03,597 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-27 23:05:03,597 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-27 23:05:03,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-27 23:05:03,664 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-27 23:05:03,668 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-27 23:05:03,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-27 23:05:03,670 INFO L276 PluginConnector]: CDTParser initialized [2018-01-27 23:05:03,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep05_true-unreach-call_true-termination.i [2018-01-27 23:05:03,804 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-27 23:05:03,812 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-27 23:05:03,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-27 23:05:03,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-27 23:05:03,834 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-27 23:05:03,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:05:03" (1/1) ... [2018-01-27 23:05:03,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bb441a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:03, skipping insertion in model container [2018-01-27 23:05:03,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:05:03" (1/1) ... [2018-01-27 23:05:03,861 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 23:05:03,882 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 23:05:04,052 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 23:05:04,077 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 23:05:04,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:04 WrapperNode [2018-01-27 23:05:04,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-27 23:05:04,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-27 23:05:04,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-27 23:05:04,089 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-27 23:05:04,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:04" (1/1) ... [2018-01-27 23:05:04,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:04" (1/1) ... [2018-01-27 23:05:04,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:04" (1/1) ... [2018-01-27 23:05:04,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:04" (1/1) ... [2018-01-27 23:05:04,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:04" (1/1) ... [2018-01-27 23:05:04,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:04" (1/1) ... [2018-01-27 23:05:04,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:04" (1/1) ... [2018-01-27 23:05:04,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-27 23:05:04,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-27 23:05:04,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-27 23:05:04,140 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-27 23:05:04,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:04" (1/1) ... No working directory specified, using /storage/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 [2018-01-27 23:05:04,213 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-27 23:05:04,214 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-27 23:05:04,214 INFO L136 BoogieDeclarations]: Found implementation of procedure sep [2018-01-27 23:05:04,214 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-27 23:05:04,214 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-27 23:05:04,214 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-27 23:05:04,215 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-27 23:05:04,215 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-27 23:05:04,215 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-27 23:05:04,218 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-27 23:05:04,218 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-27 23:05:04,218 INFO L128 BoogieDeclarations]: Found specification of procedure sep [2018-01-27 23:05:04,218 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-27 23:05:04,218 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-27 23:05:04,218 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-27 23:05:04,728 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-27 23:05:04,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:05:04 BoogieIcfgContainer [2018-01-27 23:05:04,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-27 23:05:04,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-27 23:05:04,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-27 23:05:04,733 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-27 23:05:04,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:05:03" (1/3) ... [2018-01-27 23:05:04,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9bc973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:05:04, skipping insertion in model container [2018-01-27 23:05:04,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:05:04" (2/3) ... [2018-01-27 23:05:04,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9bc973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:05:04, skipping insertion in model container [2018-01-27 23:05:04,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:05:04" (3/3) ... [2018-01-27 23:05:04,736 INFO L105 eAbstractionObserver]: Analyzing ICFG sep05_true-unreach-call_true-termination.i [2018-01-27 23:05:04,742 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-27 23:05:04,751 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-27 23:05:04,805 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:05:04,806 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:05:04,806 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:05:04,806 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:05:04,806 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:05:04,806 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:05:04,806 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:05:04,807 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-27 23:05:04,807 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:05:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:05:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-27 23:05:04,839 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:04,840 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-27 23:05:04,840 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-27 23:05:04,848 INFO L82 PathProgramCache]: Analyzing trace with hash 118205, now seen corresponding path program 1 times [2018-01-27 23:05:04,849 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:04,849 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:04,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:04,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:04,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:05:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:05:04,974 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 23:05:04,983 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:04,993 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:05:04,993 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:05:04,993 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:05:04,993 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:05:04,993 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:05:04,993 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:05:04,994 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:05:04,994 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-27 23:05:04,994 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:05:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:05:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-27 23:05:05,000 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:05,000 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:05,000 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1534485562, now seen corresponding path program 1 times [2018-01-27 23:05:05,000 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:05,000 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:05,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:05,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:05,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:05,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-27 23:05:05,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:05,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:05:05,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:05:05,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:05:05,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:05:05,134 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:05:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:05,161 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-01-27 23:05:05,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:05:05,162 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 46 [2018-01-27 23:05:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:05,171 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:05:05,172 INFO L226 Difference]: Without dead ends: 50 [2018-01-27 23:05:05,174 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:05:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-27 23:05:05,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-27 23:05:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-27 23:05:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-27 23:05:05,312 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 46 [2018-01-27 23:05:05,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:05,312 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-27 23:05:05,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:05:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-27 23:05:05,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-27 23:05:05,315 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:05,315 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:05,316 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:05,316 INFO L82 PathProgramCache]: Analyzing trace with hash -156806073, now seen corresponding path program 1 times [2018-01-27 23:05:05,316 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:05,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:05,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:05,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:05,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:05,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-27 23:05:05,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:05,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:05:05,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:05:05,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:05:05,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:05,442 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 3 states. [2018-01-27 23:05:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:05,529 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-01-27 23:05:05,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:05:05,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-01-27 23:05:05,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:05,534 INFO L225 Difference]: With dead ends: 93 [2018-01-27 23:05:05,534 INFO L226 Difference]: Without dead ends: 55 [2018-01-27 23:05:05,538 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-27 23:05:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-27 23:05:05,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-27 23:05:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-27 23:05:05,549 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 51 [2018-01-27 23:05:05,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:05,552 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-27 23:05:05,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:05:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-27 23:05:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-27 23:05:05,553 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:05,554 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:05,554 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash 977157338, now seen corresponding path program 1 times [2018-01-27 23:05:05,554 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:05,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:05,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:05,555 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:05,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:05,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-27 23:05:05,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:05,678 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:05,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:05,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-27 23:05:05,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:05:05,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-01-27 23:05:05,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-27 23:05:05,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-27 23:05:05,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:05:05,826 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 4 states. [2018-01-27 23:05:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:05,868 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-01-27 23:05:05,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:05:05,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-01-27 23:05:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:05,873 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:05:05,874 INFO L226 Difference]: Without dead ends: 57 [2018-01-27 23:05:05,875 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:05:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-27 23:05:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-01-27 23:05:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-27 23:05:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-27 23:05:05,883 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 56 [2018-01-27 23:05:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:05,883 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-27 23:05:05,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-27 23:05:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-27 23:05:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-27 23:05:05,886 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:05,886 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:05,886 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:05,886 INFO L82 PathProgramCache]: Analyzing trace with hash 901586011, now seen corresponding path program 1 times [2018-01-27 23:05:05,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:05,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:05,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:05,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:05,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:05,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:06,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:06,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:05:06,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:05:06,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:05:06,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:06,112 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 3 states. [2018-01-27 23:05:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:06,204 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-01-27 23:05:06,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:05:06,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-01-27 23:05:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:06,207 INFO L225 Difference]: With dead ends: 82 [2018-01-27 23:05:06,207 INFO L226 Difference]: Without dead ends: 60 [2018-01-27 23:05:06,208 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-27 23:05:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-01-27 23:05:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-27 23:05:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-27 23:05:06,215 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 71 [2018-01-27 23:05:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:06,218 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-27 23:05:06,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:05:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-27 23:05:06,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-27 23:05:06,220 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:06,221 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:06,221 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:06,222 INFO L82 PathProgramCache]: Analyzing trace with hash -61334317, now seen corresponding path program 1 times [2018-01-27 23:05:06,222 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:06,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:06,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:06,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:06,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:06,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:06,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:06,392 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:06,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:06,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:06,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:06,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-27 23:05:06,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-27 23:05:06,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-27 23:05:06,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:05:06,628 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2018-01-27 23:05:06,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:06,691 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-01-27 23:05:06,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-27 23:05:06,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-01-27 23:05:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:06,694 INFO L225 Difference]: With dead ends: 106 [2018-01-27 23:05:06,694 INFO L226 Difference]: Without dead ends: 64 [2018-01-27 23:05:06,695 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:05:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-27 23:05:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-27 23:05:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-27 23:05:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-01-27 23:05:06,706 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 77 [2018-01-27 23:05:06,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:06,707 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-01-27 23:05:06,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-27 23:05:06,707 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-01-27 23:05:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-27 23:05:06,709 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:06,710 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:06,710 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:06,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1322671194, now seen corresponding path program 2 times [2018-01-27 23:05:06,710 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:06,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:06,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:06,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:06,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:06,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:06,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:06,910 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:06,929 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:05:06,956 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:06,988 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:06,999 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:07,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:07,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:07,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-27 23:05:07,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-27 23:05:07,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-27 23:05:07,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:05:07,124 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-01-27 23:05:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:07,234 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-01-27 23:05:07,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-27 23:05:07,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-01-27 23:05:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:07,236 INFO L225 Difference]: With dead ends: 111 [2018-01-27 23:05:07,236 INFO L226 Difference]: Without dead ends: 69 [2018-01-27 23:05:07,237 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:05:07,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-27 23:05:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-01-27 23:05:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-27 23:05:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-01-27 23:05:07,246 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 82 [2018-01-27 23:05:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:07,247 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-01-27 23:05:07,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-27 23:05:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-01-27 23:05:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-27 23:05:07,249 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:07,249 INFO L330 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:07,249 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1751804083, now seen corresponding path program 3 times [2018-01-27 23:05:07,249 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:07,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:07,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:07,251 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:07,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:07,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:07,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:07,555 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:07,560 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 23:05:07,586 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:07,606 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:07,619 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:07,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-27 23:05:07,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:07,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-01-27 23:05:07,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:05:07,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:05:07,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:07,882 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 8 states. [2018-01-27 23:05:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:08,152 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2018-01-27 23:05:08,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:05:08,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-01-27 23:05:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:08,156 INFO L225 Difference]: With dead ends: 124 [2018-01-27 23:05:08,157 INFO L226 Difference]: Without dead ends: 82 [2018-01-27 23:05:08,157 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-27 23:05:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-01-27 23:05:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-27 23:05:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-27 23:05:08,166 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 87 [2018-01-27 23:05:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:08,166 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-27 23:05:08,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:05:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-27 23:05:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-27 23:05:08,168 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:08,168 INFO L330 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:08,168 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:08,169 INFO L82 PathProgramCache]: Analyzing trace with hash -465935121, now seen corresponding path program 4 times [2018-01-27 23:05:08,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:08,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:08,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:08,170 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:08,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:08,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-01-27 23:05:08,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:08,488 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:08,498 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-27 23:05:08,542 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:08,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-01-27 23:05:08,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:08,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:05:08,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:05:08,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:05:08,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:08,627 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 8 states. [2018-01-27 23:05:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:08,675 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2018-01-27 23:05:08,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:05:08,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2018-01-27 23:05:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:08,678 INFO L225 Difference]: With dead ends: 128 [2018-01-27 23:05:08,678 INFO L226 Difference]: Without dead ends: 81 [2018-01-27 23:05:08,679 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:08,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-27 23:05:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-27 23:05:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-27 23:05:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-27 23:05:08,694 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 107 [2018-01-27 23:05:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:08,695 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-27 23:05:08,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:05:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-27 23:05:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-27 23:05:08,697 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:08,697 INFO L330 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:08,697 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:08,697 INFO L82 PathProgramCache]: Analyzing trace with hash 704280706, now seen corresponding path program 5 times [2018-01-27 23:05:08,699 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:08,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:08,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:08,700 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:08,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:08,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-01-27 23:05:08,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:08,895 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:08,901 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-27 23:05:08,915 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:08,918 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:08,925 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:08,932 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:08,947 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:08,950 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:08,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-27 23:05:09,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:09,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-27 23:05:09,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-27 23:05:09,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-27 23:05:09,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:05:09,028 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2018-01-27 23:05:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:09,121 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2018-01-27 23:05:09,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-27 23:05:09,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-01-27 23:05:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:09,125 INFO L225 Difference]: With dead ends: 135 [2018-01-27 23:05:09,125 INFO L226 Difference]: Without dead ends: 89 [2018-01-27 23:05:09,126 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:05:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-27 23:05:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-01-27 23:05:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-27 23:05:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-01-27 23:05:09,146 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 112 [2018-01-27 23:05:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:09,146 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-01-27 23:05:09,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-27 23:05:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-01-27 23:05:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-01-27 23:05:09,148 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:09,148 INFO L330 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:09,148 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:09,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1275694259, now seen corresponding path program 6 times [2018-01-27 23:05:09,148 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:09,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:09,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:09,149 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:09,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:09,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-01-27 23:05:09,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:09,450 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:09,457 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-27 23:05:09,474 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:09,480 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:09,484 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:09,492 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:09,501 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:05:09,502 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:09,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-01-27 23:05:09,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:09,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-01-27 23:05:09,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:05:09,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:05:09,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:09,561 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 8 states. [2018-01-27 23:05:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:09,718 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2018-01-27 23:05:09,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:05:09,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-01-27 23:05:09,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:09,720 INFO L225 Difference]: With dead ends: 155 [2018-01-27 23:05:09,720 INFO L226 Difference]: Without dead ends: 104 [2018-01-27 23:05:09,720 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-27 23:05:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-01-27 23:05:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-27 23:05:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-27 23:05:09,732 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 127 [2018-01-27 23:05:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:09,732 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-27 23:05:09,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:05:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-27 23:05:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-27 23:05:09,734 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:09,735 INFO L330 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 12, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:09,735 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:09,737 INFO L82 PathProgramCache]: Analyzing trace with hash 143247850, now seen corresponding path program 7 times [2018-01-27 23:05:09,737 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:09,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:09,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:09,738 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:09,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:09,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-01-27 23:05:10,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:10,239 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:10,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:10,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 198 proven. 38 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-01-27 23:05:10,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:10,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:05:10,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:05:10,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:05:10,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:10,350 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 8 states. [2018-01-27 23:05:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:10,408 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2018-01-27 23:05:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:05:10,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2018-01-27 23:05:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:10,410 INFO L225 Difference]: With dead ends: 164 [2018-01-27 23:05:10,410 INFO L226 Difference]: Without dead ends: 102 [2018-01-27 23:05:10,410 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:05:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-27 23:05:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-01-27 23:05:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-27 23:05:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-01-27 23:05:10,419 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 148 [2018-01-27 23:05:10,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:10,419 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-01-27 23:05:10,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:05:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2018-01-27 23:05:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-01-27 23:05:10,420 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:10,421 INFO L330 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:10,421 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:10,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1138847563, now seen corresponding path program 8 times [2018-01-27 23:05:10,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:10,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:10,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:10,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:10,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:10,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-01-27 23:05:10,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:10,557 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:10,562 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:05:10,579 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:10,607 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:10,616 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:10,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 302 proven. 10 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-01-27 23:05:10,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:10,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-27 23:05:10,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-27 23:05:10,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-27 23:05:10,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:05:10,696 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 6 states. [2018-01-27 23:05:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:10,718 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2018-01-27 23:05:10,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-27 23:05:10,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-01-27 23:05:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:10,720 INFO L225 Difference]: With dead ends: 154 [2018-01-27 23:05:10,720 INFO L226 Difference]: Without dead ends: 112 [2018-01-27 23:05:10,721 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:05:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-27 23:05:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-01-27 23:05:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-27 23:05:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-01-27 23:05:10,727 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 163 [2018-01-27 23:05:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:10,727 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-01-27 23:05:10,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-27 23:05:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-01-27 23:05:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-01-27 23:05:10,729 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:10,729 INFO L330 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:10,729 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:10,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1690705981, now seen corresponding path program 9 times [2018-01-27 23:05:10,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:10,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:10,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:10,731 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:10,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:10,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-01-27 23:05:11,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:11,156 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:05:11,168 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:11,189 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:11,211 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:11,228 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:11,245 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:11,262 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:05:11,279 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:11,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 302 proven. 24 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-01-27 23:05:11,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:11,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-01-27 23:05:11,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-27 23:05:11,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-27 23:05:11,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-27 23:05:11,434 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 7 states. [2018-01-27 23:05:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:11,618 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2018-01-27 23:05:11,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-27 23:05:11,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2018-01-27 23:05:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:11,620 INFO L225 Difference]: With dead ends: 156 [2018-01-27 23:05:11,620 INFO L226 Difference]: Without dead ends: 114 [2018-01-27 23:05:11,620 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-27 23:05:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-27 23:05:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-27 23:05:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-27 23:05:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-01-27 23:05:11,626 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 169 [2018-01-27 23:05:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:11,627 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-01-27 23:05:11,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-27 23:05:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-01-27 23:05:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-01-27 23:05:11,627 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:11,628 INFO L330 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:11,628 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:05:11,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1771432389, now seen corresponding path program 10 times [2018-01-27 23:05:11,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:11,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:11,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:11,629 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:05:11,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:05:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:05:12,095 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 23:05:12,125 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:12,134 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:12,146 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:12,159 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:12,159 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:12,159 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:05:12,226 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:05:12,226 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:05:12,226 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:05:12,227 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:05:12,227 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:05:12,227 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:05:12,227 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:05:12,227 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-27 23:05:12,227 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:05:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:05:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-27 23:05:12,230 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:12,231 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:12,231 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-27 23:05:12,231 INFO L82 PathProgramCache]: Analyzing trace with hash -762648204, now seen corresponding path program 1 times [2018-01-27 23:05:12,231 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:12,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:12,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:12,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:12,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:12,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-27 23:05:12,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:12,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:05:12,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:05:12,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:05:12,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:05:12,246 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:05:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:12,250 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-01-27 23:05:12,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:05:12,250 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2018-01-27 23:05:12,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:12,251 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:05:12,251 INFO L226 Difference]: Without dead ends: 48 [2018-01-27 23:05:12,252 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:05:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-27 23:05:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-27 23:05:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-27 23:05:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-27 23:05:12,256 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 44 [2018-01-27 23:05:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:12,256 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-27 23:05:12,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:05:12,256 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-27 23:05:12,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-27 23:05:12,258 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:12,258 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:12,258 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-27 23:05:12,258 INFO L82 PathProgramCache]: Analyzing trace with hash -983402303, now seen corresponding path program 1 times [2018-01-27 23:05:12,258 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:12,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:12,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:12,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:12,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:12,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:12,330 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-27 23:05:12,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:12,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:05:12,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:05:12,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:05:12,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:12,331 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-01-27 23:05:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:12,370 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-01-27 23:05:12,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:05:12,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-01-27 23:05:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:12,371 INFO L225 Difference]: With dead ends: 89 [2018-01-27 23:05:12,371 INFO L226 Difference]: Without dead ends: 53 [2018-01-27 23:05:12,372 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-27 23:05:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-27 23:05:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-27 23:05:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-27 23:05:12,378 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 49 [2018-01-27 23:05:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:12,378 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-27 23:05:12,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:05:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-27 23:05:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-27 23:05:12,379 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:12,379 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:12,379 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-27 23:05:12,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1531942380, now seen corresponding path program 1 times [2018-01-27 23:05:12,379 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:12,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:12,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:12,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:12,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:12,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-27 23:05:12,454 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:12,454 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:12,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:12,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-27 23:05:12,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:05:12,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-01-27 23:05:12,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-27 23:05:12,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-27 23:05:12,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:05:12,628 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-01-27 23:05:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:12,691 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-01-27 23:05:12,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:05:12,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-01-27 23:05:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:12,692 INFO L225 Difference]: With dead ends: 90 [2018-01-27 23:05:12,692 INFO L226 Difference]: Without dead ends: 55 [2018-01-27 23:05:12,692 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:05:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-27 23:05:12,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-27 23:05:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-27 23:05:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-27 23:05:12,697 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 54 [2018-01-27 23:05:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:12,697 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-27 23:05:12,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-27 23:05:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-27 23:05:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-27 23:05:12,698 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:12,698 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:12,698 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-27 23:05:12,699 INFO L82 PathProgramCache]: Analyzing trace with hash -709675563, now seen corresponding path program 1 times [2018-01-27 23:05:12,699 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:12,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:12,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:12,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:12,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:12,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:12,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:12,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:05:12,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:05:12,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:05:12,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:12,777 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 3 states. [2018-01-27 23:05:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:12,834 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-01-27 23:05:12,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:05:12,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-01-27 23:05:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:12,835 INFO L225 Difference]: With dead ends: 78 [2018-01-27 23:05:12,835 INFO L226 Difference]: Without dead ends: 58 [2018-01-27 23:05:12,835 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:05:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-27 23:05:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-01-27 23:05:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-27 23:05:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-27 23:05:12,838 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 69 [2018-01-27 23:05:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:12,841 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-27 23:05:12,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:05:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-27 23:05:12,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-27 23:05:12,842 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:12,842 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:12,842 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-27 23:05:12,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1300493389, now seen corresponding path program 1 times [2018-01-27 23:05:12,843 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:12,843 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:12,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:12,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:12,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:12,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:13,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:13,011 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:05:13,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:13,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:13,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:05:13,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-27 23:05:13,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-27 23:05:13,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-27 23:05:13,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:05:13,157 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 5 states. [2018-01-27 23:05:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:13,240 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-01-27 23:05:13,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-27 23:05:13,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-01-27 23:05:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:13,241 INFO L225 Difference]: With dead ends: 102 [2018-01-27 23:05:13,241 INFO L226 Difference]: Without dead ends: 62 [2018-01-27 23:05:13,242 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:05:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-27 23:05:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-01-27 23:05:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-27 23:05:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-01-27 23:05:13,246 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 75 [2018-01-27 23:05:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:13,246 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-01-27 23:05:13,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-27 23:05:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-01-27 23:05:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-27 23:05:13,247 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:13,247 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:13,247 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-27 23:05:13,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1553929184, now seen corresponding path program 2 times [2018-01-27 23:05:13,247 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:13,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:13,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:13,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:13,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:13,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:05:13,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:05:13,525 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:05:13,537 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:05:13,552 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:05:13,569 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:05:13,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:05:13,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:05:13,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-27 23:05:13,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:05:13,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-27 23:05:13,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:05:14,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:05:14,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-27 23:05:14,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:05:14,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-27 23:05:14,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:05:14,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:05:14,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-27 23:05:14,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:05:14,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-27 23:05:14,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:05:14,872 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#x~5.base| Int)) (and (= (store |c_old(#valid)| |main_~#x~5.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#x~5.base|) 0))) is different from true [2018-01-27 23:05:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-01-27 23:05:14,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:05:14,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-01-27 23:05:14,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-27 23:05:14,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-27 23:05:14,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-01-27 23:05:14,931 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 9 states. [2018-01-27 23:05:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:15,593 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2018-01-27 23:05:15,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-27 23:05:15,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-01-27 23:05:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:15,593 INFO L225 Difference]: With dead ends: 106 [2018-01-27 23:05:15,593 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 23:05:15,594 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=47, Invalid=112, Unknown=1, NotChecked=22, Total=182 [2018-01-27 23:05:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 23:05:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 23:05:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 23:05:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 23:05:15,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-01-27 23:05:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:15,595 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 23:05:15,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-27 23:05:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 23:05:15,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 23:05:15,597 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:05:15,597 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:05:15,597 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:05:15,597 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:05:15,598 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:05:15,598 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:05:15,598 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:05:15,598 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == sepErr0EnsuresViolation======== [2018-01-27 23:05:15,598 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:05:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:05:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-27 23:05:15,599 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:05:15,600 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:05:15,600 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sepErr0EnsuresViolation]=== [2018-01-27 23:05:15,600 INFO L82 PathProgramCache]: Analyzing trace with hash 145376028, now seen corresponding path program 1 times [2018-01-27 23:05:15,600 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:05:15,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:05:15,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:15,601 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:05:15,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:05:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:05:15,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:05:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 23:05:15,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:05:15,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:05:15,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:05:15,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:05:15,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:05:15,608 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:05:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:05:15,616 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-01-27 23:05:15,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:05:15,617 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-27 23:05:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:05:15,617 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:05:15,617 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 23:05:15,618 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:05:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 23:05:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 23:05:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 23:05:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 23:05:15,619 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-01-27 23:05:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:05:15,619 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 23:05:15,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:05:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 23:05:15,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 23:05:15,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:05:15 BoogieIcfgContainer [2018-01-27 23:05:15,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-27 23:05:15,625 INFO L168 Benchmark]: Toolchain (without parser) took 11820.04 ms. Allocated memory was 303.0 MB in the beginning and 581.4 MB in the end (delta: 278.4 MB). Free memory was 263.7 MB in the beginning and 526.0 MB in the end (delta: -262.3 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. [2018-01-27 23:05:15,626 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 303.0 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-27 23:05:15,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.33 ms. Allocated memory is still 303.0 MB. Free memory was 262.7 MB in the beginning and 254.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-27 23:05:15,627 INFO L168 Benchmark]: Boogie Preprocessor took 44.30 ms. Allocated memory is still 303.0 MB. Free memory was 254.7 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-27 23:05:15,627 INFO L168 Benchmark]: RCFGBuilder took 588.98 ms. Allocated memory is still 303.0 MB. Free memory was 252.8 MB in the beginning and 233.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-27 23:05:15,628 INFO L168 Benchmark]: TraceAbstraction took 10894.17 ms. Allocated memory was 303.0 MB in the beginning and 581.4 MB in the end (delta: 278.4 MB). Free memory was 233.8 MB in the beginning and 526.0 MB in the end (delta: -292.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-27 23:05:15,629 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 303.0 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 263.33 ms. Allocated memory is still 303.0 MB. Free memory was 262.7 MB in the beginning and 254.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.30 ms. Allocated memory is still 303.0 MB. Free memory was 254.7 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 588.98 ms. Allocated memory is still 303.0 MB. Free memory was 252.8 MB in the beginning and 233.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10894.17 ms. Allocated memory was 303.0 MB in the beginning and 581.4 MB in the end (delta: 278.4 MB). Free memory was 233.8 MB in the beginning and 526.0 MB in the end (delta: -292.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L20] FCALL int x[5]; VAL [x={23:0}] [L21] int temp; [L22] int ret; [L23] int ret2; [L24] int ret5; [L26] int i = 0; VAL [i=0, x={23:0}] [L26] COND TRUE i < 5 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-8, i=0, x={23:0}] [L26] i++ VAL [i=1, x={23:0}] [L26] COND TRUE i < 5 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-20, i=1, x={23:0}] [L26] i++ VAL [i=2, x={23:0}] [L26] COND TRUE i < 5 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-4, i=2, x={23:0}] [L26] i++ VAL [i=3, x={23:0}] [L26] COND TRUE i < 5 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=3, x={23:0}] [L26] i++ VAL [i=4, x={23:0}] [L26] COND TRUE i < 5 [L27] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-6, i=4, x={23:0}] [L26] i++ VAL [i=5, x={23:0}] [L26] COND FALSE !(i < 5) VAL [i=5, x={23:0}] [L30] CALL, EXPR sep(x) VAL [x={23:0}] [L6] long long ret =0; [L7] int i=0; VAL [i=0, ret=0, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=0, ret=0, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=0, ret=0, x={23:0}, x={23:0}, x[i]=-8] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=0, ret=1, x={23:0}, x={23:0}] [L7] i++ VAL [i=1, ret=1, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=1, ret=1, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=1, ret=1, x={23:0}, x={23:0}, x[i]=-20] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=1, ret=2, x={23:0}, x={23:0}] [L7] i++ VAL [i=2, ret=2, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=2, ret=2, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=2, ret=2, x={23:0}, x={23:0}, x[i]=-4] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=2, ret=3, x={23:0}, x={23:0}] [L7] i++ VAL [i=3, ret=3, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=3, ret=3, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=3, ret=3, x={23:0}, x={23:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=3, ret=4, x={23:0}, x={23:0}] [L7] i++ VAL [i=4, ret=4, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=4, ret=4, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=4, ret=4, x={23:0}, x={23:0}, x[i]=-6] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=4, ret=5, x={23:0}, x={23:0}] [L7] i++ VAL [i=5, ret=5, x={23:0}, x={23:0}] [L7] COND FALSE !(i<5) VAL [i=5, ret=5, x={23:0}, x={23:0}] [L14] RET return ret; VAL [\result=5, i=5, ret=5, x={23:0}, x={23:0}] [L30] EXPR sep(x) VAL [i=5, sep(x)=5, x={23:0}] [L30] ret = sep(x) [L32] EXPR, FCALL x[0] VAL [i=5, ret=5, x={23:0}, x[0]=-8] [L32] temp=x[0] [L32] EXPR, FCALL x[1] VAL [i=5, ret=5, temp=-8, x={23:0}, x[1]=-20] [L32] FCALL x[0] = x[1] VAL [i=5, ret=5, temp=-8, x={23:0}, x[1]=-20] [L32] FCALL x[1] = temp VAL [i=5, ret=5, temp=-8, x={23:0}] [L33] CALL, EXPR sep(x) VAL [x={23:0}] [L6] long long ret =0; [L7] int i=0; VAL [i=0, ret=0, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=0, ret=0, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=0, ret=0, x={23:0}, x={23:0}, x[i]=-20] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=0, ret=1, x={23:0}, x={23:0}] [L7] i++ VAL [i=1, ret=1, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=1, ret=1, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=1, ret=1, x={23:0}, x={23:0}, x[i]=-8] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=1, ret=2, x={23:0}, x={23:0}] [L7] i++ VAL [i=2, ret=2, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=2, ret=2, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=2, ret=2, x={23:0}, x={23:0}, x[i]=-4] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=2, ret=3, x={23:0}, x={23:0}] [L7] i++ VAL [i=3, ret=3, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=3, ret=3, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=3, ret=3, x={23:0}, x={23:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=3, ret=4, x={23:0}, x={23:0}] [L7] i++ VAL [i=4, ret=4, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=4, ret=4, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=4, ret=4, x={23:0}, x={23:0}, x[i]=-6] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=4, ret=5, x={23:0}, x={23:0}] [L7] i++ VAL [i=5, ret=5, x={23:0}, x={23:0}] [L7] COND FALSE !(i<5) VAL [i=5, ret=5, x={23:0}, x={23:0}] [L14] RET return ret; VAL [\result=5, i=5, ret=5, x={23:0}, x={23:0}] [L33] EXPR sep(x) VAL [i=5, ret=5, sep(x)=5, temp=-8, x={23:0}] [L33] ret2 = sep(x) [L34] EXPR, FCALL x[0] VAL [i=5, ret=5, ret2=5, temp=-8, x={23:0}, x[0]=-20] [L34] temp=x[0] [L35] int i =0 ; VAL [i=5, i=0, ret=5, ret2=5, temp=-20, x={23:0}] [L35] COND TRUE i<5 -1 VAL [i=0, i=5, ret=5, ret2=5, temp=-20, x={23:0}] [L36] EXPR, FCALL x[i+1] VAL [i=5, i=0, ret=5, ret2=5, temp=-20, x={23:0}, x[i+1]=-8] [L36] FCALL x[i] = x[i+1] VAL [i=0, i=5, ret=5, ret2=5, temp=-20, x={23:0}, x[i+1]=-8] [L35] i++ VAL [i=5, i=1, ret=5, ret2=5, temp=-20, x={23:0}] [L35] COND TRUE i<5 -1 VAL [i=5, i=1, ret=5, ret2=5, temp=-20, x={23:0}] [L36] EXPR, FCALL x[i+1] VAL [i=1, i=5, ret=5, ret2=5, temp=-20, x={23:0}, x[i+1]=-4] [L36] FCALL x[i] = x[i+1] VAL [i=1, i=5, ret=5, ret2=5, temp=-20, x={23:0}, x[i+1]=-4] [L35] i++ VAL [i=2, i=5, ret=5, ret2=5, temp=-20, x={23:0}] [L35] COND TRUE i<5 -1 VAL [i=2, i=5, ret=5, ret2=5, temp=-20, x={23:0}] [L36] EXPR, FCALL x[i+1] VAL [i=5, i=2, ret=5, ret2=5, temp=-20, x={23:0}, x[i+1]=0] [L36] FCALL x[i] = x[i+1] VAL [i=2, i=5, ret=5, ret2=5, temp=-20, x={23:0}, x[i+1]=0] [L35] i++ VAL [i=5, i=3, ret=5, ret2=5, temp=-20, x={23:0}] [L35] COND TRUE i<5 -1 VAL [i=3, i=5, ret=5, ret2=5, temp=-20, x={23:0}] [L36] EXPR, FCALL x[i+1] VAL [i=3, i=5, ret=5, ret2=5, temp=-20, x={23:0}, x[i+1]=-6] [L36] FCALL x[i] = x[i+1] VAL [i=5, i=3, ret=5, ret2=5, temp=-20, x={23:0}, x[i+1]=-6] [L35] i++ VAL [i=5, i=4, ret=5, ret2=5, temp=-20, x={23:0}] [L35] COND FALSE !(i<5 -1) VAL [i=5, i=4, ret=5, ret2=5, temp=-20, x={23:0}] [L38] FCALL x[5 -1] = temp VAL [i=5, i=4, ret=5, ret2=5, temp=-20, x={23:0}] [L39] CALL, EXPR sep(x) VAL [x={23:0}] [L6] long long ret =0; [L7] int i=0; VAL [i=0, ret=0, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=0, ret=0, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=0, ret=0, x={23:0}, x={23:0}, x[i]=-8] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=0, ret=1, x={23:0}, x={23:0}] [L7] i++ VAL [i=1, ret=1, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=1, ret=1, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=1, ret=1, x={23:0}, x={23:0}, x[i]=-4] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=1, ret=2, x={23:0}, x={23:0}] [L7] i++ VAL [i=2, ret=2, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=2, ret=2, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=2, ret=2, x={23:0}, x={23:0}, x[i]=0] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=2, ret=3, x={23:0}, x={23:0}] [L7] i++ VAL [i=3, ret=3, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=3, ret=3, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=3, ret=3, x={23:0}, x={23:0}, x[i]=-6] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=3, ret=4, x={23:0}, x={23:0}] [L7] i++ VAL [i=4, ret=4, x={23:0}, x={23:0}] [L7] COND TRUE i<5 VAL [i=4, ret=4, x={23:0}, x={23:0}] [L9] EXPR, FCALL x[i] VAL [i=4, ret=4, x={23:0}, x={23:0}, x[i]=-20] [L9] COND TRUE x[i]%2==0 [L10] ret++ VAL [i=4, ret=5, x={23:0}, x={23:0}] [L7] i++ VAL [i=5, ret=5, x={23:0}, x={23:0}] [L7] COND FALSE !(i<5) VAL [i=5, ret=5, x={23:0}, x={23:0}] [L14] RET return ret; VAL [\result=5, i=5, ret=5, x={23:0}, x={23:0}] [L39] EXPR sep(x) VAL [i=5, i=4, ret=5, ret2=5, sep(x)=5, temp=-20, x={23:0}] [L39] ret5 = sep(x) [L41] COND FALSE !(ret != ret2 || ret !=ret5) VAL [i=4, i=5, ret=5, ret2=5, ret5=5, temp=-20, x={23:0}] [L44] return 1; VAL [\result=1, i=4, i=5, ret=5, ret2=5, ret5=5, temp=-20, x={23:0}] [L44] return 1; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. UNSAFE Result, 7.2s OverallTime, 14 OverallIterations, 18 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 672 SDtfs, 149 SDslu, 1864 SDs, 0 SdLazy, 263 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1180 GetRequests, 1132 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 36 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2599 NumberOfCodeBlocks, 2429 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2401 ConstructedInterpolants, 0 QuantifiedInterpolants, 353429 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2167 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 4968/5676 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. SAFE Result, 3.3s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 292 SDtfs, 78 SDslu, 376 SDs, 0 SdLazy, 173 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 208 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 580 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 571 ConstructedInterpolants, 35 QuantifiedInterpolants, 91665 SizeOfPredicates, 5 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 337/360 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 4]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: sepErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 58 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep05_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-27_23-05-15-649.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep05_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-27_23-05-15-649.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep05_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-27_23-05-15-649.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep05_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-27_23-05-15-649.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep05_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-27_23-05-15-649.csv Received shutdown request...