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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:40:35,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:40:35,983 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:40:36,009 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:40:36,010 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:40:36,011 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:40:36,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:40:36,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:40:36,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:40:36,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:40:36,023 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:40:36,023 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:40:36,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:40:36,026 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:40:36,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:40:36,039 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:40:36,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:40:36,042 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:40:36,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:40:36,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:40:36,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:40:36,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:40:36,047 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:40:36,048 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:40:36,049 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:40:36,050 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:40:36,050 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:40:36,051 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:40:36,051 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:40:36,051 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:40:36,052 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:40:36,052 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:40:36,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:40:36,066 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:40:36,067 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:40:36,067 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:40:36,067 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:40:36,068 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:40:36,068 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:40:36,068 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:40:36,069 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:40:36,069 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:40:36,069 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:40:36,069 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:40:36,069 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:40:36,069 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:40:36,070 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:40:36,070 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:40:36,070 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:40:36,070 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:40:36,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:40:36,071 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:40:36,071 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:40:36,071 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:40:36,071 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:40:36,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:40:36,072 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:40:36,072 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:40:36,072 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:40:36,072 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:40:36,072 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:40:36,073 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:40:36,073 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:40:36,073 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:40:36,074 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:40:36,077 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:40:36,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:40:36,139 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:40:36,145 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:40:36,147 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:40:36,147 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:40:36,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-01-31 09:40:36,259 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:40:36,268 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:40:36,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:40:36,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:40:36,277 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:40:36,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:40:36" (1/1) ... [2018-01-31 09:40:36,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a99aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:36, skipping insertion in model container [2018-01-31 09:40:36,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:40:36" (1/1) ... [2018-01-31 09:40:36,301 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:40:36,321 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:40:36,494 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:40:36,519 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:40:36,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:36 WrapperNode [2018-01-31 09:40:36,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:40:36,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:40:36,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:40:36,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:40:36,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:36" (1/1) ... [2018-01-31 09:40:36,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:36" (1/1) ... [2018-01-31 09:40:36,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:36" (1/1) ... [2018-01-31 09:40:36,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:36" (1/1) ... [2018-01-31 09:40:36,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:36" (1/1) ... [2018-01-31 09:40:36,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:36" (1/1) ... [2018-01-31 09:40:36,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:36" (1/1) ... [2018-01-31 09:40:36,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:40:36,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:40:36,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:40:36,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:40:36,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:36" (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-31 09:40:36,653 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:40:36,654 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:40:36,654 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 09:40:36,654 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:40:36,654 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:40:36,654 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:40:36,655 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:40:36,655 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:40:36,655 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:40:36,655 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 09:40:36,655 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:40:36,656 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:40:36,656 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:40:37,077 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:40:37,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:40:37 BoogieIcfgContainer [2018-01-31 09:40:37,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:40:37,078 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:40:37,078 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:40:37,079 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:40:37,083 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:40:37" (1/1) ... [2018-01-31 09:40:37,093 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:40:37,093 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:40:37,094 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:40:37,148 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 6 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:40:37,182 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:40:37,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:40:50,137 INFO L314 AbstractInterpreter]: Visited 70 different actions 513 times. Merged at 46 different actions 280 times. Widened at 2 different actions 2 times. Found 34 fixpoints after 9 different actions. Largest state had 39 variables. [2018-01-31 09:40:50,142 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:40:50,155 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-01-31 09:40:50,156 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:40:50,156 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:40:50,156 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v_foo_~b.base_2) (+ v_foo_~b.offset_2 v_foo_~i~1_6)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~1 * 1, 1); srcloc: L18')) [2018-01-31 09:40:50,162 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:40:50,162 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:40:50,163 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:40:50,163 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-31 09:40:50,163 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:40:50,163 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:40:50,163 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-31 09:40:50,163 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:40:50,164 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:40:50,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:40:50 BasicIcfg [2018-01-31 09:40:50,183 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:40:50,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:40:50,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:40:50,190 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:40:50,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:40:36" (1/4) ... [2018-01-31 09:40:50,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344aa2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:40:50, skipping insertion in model container [2018-01-31 09:40:50,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:36" (2/4) ... [2018-01-31 09:40:50,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344aa2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:40:50, skipping insertion in model container [2018-01-31 09:40:50,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:40:37" (3/4) ... [2018-01-31 09:40:50,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344aa2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:40:50, skipping insertion in model container [2018-01-31 09:40:50,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:40:50" (4/4) ... [2018-01-31 09:40:50,195 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:40:50,204 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:40:50,212 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-31 09:40:50,363 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:40:50,364 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:40:50,364 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:40:50,364 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:40:50,364 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:40:50,364 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:40:50,364 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:40:50,365 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:40:50,365 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:40:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-31 09:40:50,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-31 09:40:50,386 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:50,387 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:40:50,387 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:50,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1068910584, now seen corresponding path program 1 times [2018-01-31 09:40:50,393 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:50,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:50,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:50,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:50,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:50,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:50,602 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-31 09:40:50,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:40:50,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:40:50,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:40:50,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:40:50,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:40:50,616 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-01-31 09:40:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:50,793 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2018-01-31 09:40:50,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:40:50,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-01-31 09:40:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:50,807 INFO L225 Difference]: With dead ends: 133 [2018-01-31 09:40:50,807 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 09:40:50,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:40:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 09:40:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-31 09:40:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 09:40:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-31 09:40:50,854 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 9 [2018-01-31 09:40:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:50,854 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-31 09:40:50,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:40:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-31 09:40:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 09:40:50,855 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:50,856 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:40:50,856 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:50,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1115648547, now seen corresponding path program 1 times [2018-01-31 09:40:50,856 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:50,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:50,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:50,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:50,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:50,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:51,148 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-31 09:40:51,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:40:51,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:40:51,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:40:51,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:40:51,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:40:51,151 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 7 states. [2018-01-31 09:40:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:51,554 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-01-31 09:40:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:40:51,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-31 09:40:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:51,560 INFO L225 Difference]: With dead ends: 125 [2018-01-31 09:40:51,560 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 09:40:51,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:40:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 09:40:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 67. [2018-01-31 09:40:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-31 09:40:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-31 09:40:51,571 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 18 [2018-01-31 09:40:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:51,571 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-31 09:40:51,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:40:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-31 09:40:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 09:40:51,572 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:51,572 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:40:51,572 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash -225366126, now seen corresponding path program 1 times [2018-01-31 09:40:51,573 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:51,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:51,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:51,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:51,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:51,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:51,706 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-31 09:40:51,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:40:51,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:40:51,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:40:51,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:40:51,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:40:51,707 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 5 states. [2018-01-31 09:40:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:51,770 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-01-31 09:40:51,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:40:51,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-31 09:40:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:51,771 INFO L225 Difference]: With dead ends: 67 [2018-01-31 09:40:51,771 INFO L226 Difference]: Without dead ends: 66 [2018-01-31 09:40:51,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:40:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-31 09:40:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-31 09:40:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-31 09:40:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-31 09:40:51,779 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 19 [2018-01-31 09:40:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:51,779 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-31 09:40:51,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:40:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-31 09:40:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 09:40:51,780 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:51,781 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:40:51,781 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:51,781 INFO L82 PathProgramCache]: Analyzing trace with hash -225366124, now seen corresponding path program 1 times [2018-01-31 09:40:51,781 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:51,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:51,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:51,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:51,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:51,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:52,072 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 15 DAG size of output 10 [2018-01-31 09:40:52,305 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 17 DAG size of output 12 [2018-01-31 09:40:52,307 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-31 09:40:52,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:40:52,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:40:52,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:40:52,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:40:52,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:40:52,308 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 6 states. [2018-01-31 09:40:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:52,416 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-31 09:40:52,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:40:52,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-31 09:40:52,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:52,417 INFO L225 Difference]: With dead ends: 75 [2018-01-31 09:40:52,417 INFO L226 Difference]: Without dead ends: 74 [2018-01-31 09:40:52,418 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:40:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-31 09:40:52,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2018-01-31 09:40:52,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-31 09:40:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-31 09:40:52,426 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 19 [2018-01-31 09:40:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:52,426 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-31 09:40:52,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:40:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-31 09:40:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 09:40:52,427 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:52,428 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:40:52,428 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:52,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1537306562, now seen corresponding path program 1 times [2018-01-31 09:40:52,428 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:52,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:52,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:52,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:52,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:52,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:40:52,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:52,583 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-31 09:40:52,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:52,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:40:52,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:40:52,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-31 09:40:52,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:40:52,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:40:52,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:40:52,750 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2018-01-31 09:40:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:52,926 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-31 09:40:52,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:40:52,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-31 09:40:52,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:52,929 INFO L225 Difference]: With dead ends: 106 [2018-01-31 09:40:52,929 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 09:40:52,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:40:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 09:40:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-01-31 09:40:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 09:40:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-01-31 09:40:52,951 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 19 [2018-01-31 09:40:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:52,951 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-01-31 09:40:52,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:40:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-01-31 09:40:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 09:40:52,953 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:52,953 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-01-31 09:40:52,953 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:52,954 INFO L82 PathProgramCache]: Analyzing trace with hash 184823418, now seen corresponding path program 1 times [2018-01-31 09:40:52,954 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:52,954 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:52,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:52,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:52,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:52,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:40:53,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:53,128 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-31 09:40:53,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:53,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:40:53,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:53,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-31 09:40:53,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:40:53,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:40:53,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:40:53,193 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 5 states. [2018-01-31 09:40:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:53,360 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2018-01-31 09:40:53,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:40:53,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-31 09:40:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:53,362 INFO L225 Difference]: With dead ends: 96 [2018-01-31 09:40:53,362 INFO L226 Difference]: Without dead ends: 95 [2018-01-31 09:40:53,362 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:40:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-31 09:40:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-01-31 09:40:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 09:40:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-31 09:40:53,379 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 27 [2018-01-31 09:40:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:53,379 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-31 09:40:53,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:40:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-31 09:40:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:40:53,380 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:53,381 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-01-31 09:40:53,381 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1434559127, now seen corresponding path program 1 times [2018-01-31 09:40:53,381 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:53,381 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:53,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:53,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:53,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:53,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:40:53,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:53,798 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-31 09:40:53,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:53,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:53,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:40:53,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:40:53,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:40:53,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:40:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:40:54,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:54,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-31 09:40:54,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:40:54,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:40:54,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:40:54,086 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 9 states. [2018-01-31 09:40:54,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:54,267 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-01-31 09:40:54,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:40:54,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-31 09:40:54,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:54,269 INFO L225 Difference]: With dead ends: 95 [2018-01-31 09:40:54,269 INFO L226 Difference]: Without dead ends: 94 [2018-01-31 09:40:54,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:40:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-31 09:40:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2018-01-31 09:40:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 09:40:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-01-31 09:40:54,279 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 28 [2018-01-31 09:40:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:54,279 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-01-31 09:40:54,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:40:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-01-31 09:40:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 09:40:54,287 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:54,287 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:40:54,287 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:54,287 INFO L82 PathProgramCache]: Analyzing trace with hash -123801987, now seen corresponding path program 2 times [2018-01-31 09:40:54,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:54,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:54,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:54,289 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:54,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:54,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:40:54,416 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:54,416 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) [2018-01-31 09:40:54,434 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:40:54,447 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:54,451 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:54,459 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:54,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:40:54,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:40:54,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 16 [2018-01-31 09:40:54,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 09:40:54,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 09:40:54,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:40:54,712 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 16 states. [2018-01-31 09:40:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:55,050 INFO L93 Difference]: Finished difference Result 196 states and 214 transitions. [2018-01-31 09:40:55,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 09:40:55,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-01-31 09:40:55,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:55,052 INFO L225 Difference]: With dead ends: 196 [2018-01-31 09:40:55,052 INFO L226 Difference]: Without dead ends: 126 [2018-01-31 09:40:55,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2018-01-31 09:40:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-31 09:40:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2018-01-31 09:40:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 09:40:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-01-31 09:40:55,064 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 36 [2018-01-31 09:40:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:55,064 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-01-31 09:40:55,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 09:40:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-01-31 09:40:55,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 09:40:55,066 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:55,066 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:40:55,066 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:55,066 INFO L82 PathProgramCache]: Analyzing trace with hash 729468996, now seen corresponding path program 1 times [2018-01-31 09:40:55,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:55,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:55,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:55,068 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:55,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:55,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:40:55,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:55,132 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-31 09:40:55,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:55,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:40:55,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:55,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-31 09:40:55,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:40:55,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:40:55,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:40:55,198 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 9 states. [2018-01-31 09:40:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:55,339 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2018-01-31 09:40:55,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:40:55,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-31 09:40:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:55,341 INFO L225 Difference]: With dead ends: 157 [2018-01-31 09:40:55,341 INFO L226 Difference]: Without dead ends: 137 [2018-01-31 09:40:55,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:40:55,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-31 09:40:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2018-01-31 09:40:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-31 09:40:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-01-31 09:40:55,357 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 37 [2018-01-31 09:40:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:55,358 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-01-31 09:40:55,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:40:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-01-31 09:40:55,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 09:40:55,360 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:55,360 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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] [2018-01-31 09:40:55,360 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:55,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1381672071, now seen corresponding path program 1 times [2018-01-31 09:40:55,360 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:55,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:55,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:55,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:55,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:55,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 09:40:55,570 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:55,570 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-31 09:40:55,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:55,588 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 09:40:55,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:55,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-31 09:40:55,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:40:55,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:40:55,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:40:55,632 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 7 states. [2018-01-31 09:40:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:55,760 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2018-01-31 09:40:55,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:40:55,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-31 09:40:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:55,762 INFO L225 Difference]: With dead ends: 152 [2018-01-31 09:40:55,762 INFO L226 Difference]: Without dead ends: 151 [2018-01-31 09:40:55,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:40:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-31 09:40:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2018-01-31 09:40:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-31 09:40:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2018-01-31 09:40:55,775 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 46 [2018-01-31 09:40:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:55,776 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2018-01-31 09:40:55,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:40:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2018-01-31 09:40:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 09:40:55,777 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:55,778 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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] [2018-01-31 09:40:55,778 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash -117838294, now seen corresponding path program 1 times [2018-01-31 09:40:55,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:55,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:55,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:55,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:55,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:55,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:55,988 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 10 [2018-01-31 09:40:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 09:40:56,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:56,238 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-31 09:40:56,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:56,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:56,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:40:56,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:40:56,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:40:56,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:40:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 09:40:56,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:56,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-01-31 09:40:56,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 09:40:56,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 09:40:56,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:40:56,384 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 13 states. [2018-01-31 09:40:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:56,704 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2018-01-31 09:40:56,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:40:56,704 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-01-31 09:40:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:56,706 INFO L225 Difference]: With dead ends: 151 [2018-01-31 09:40:56,706 INFO L226 Difference]: Without dead ends: 150 [2018-01-31 09:40:56,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-01-31 09:40:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-31 09:40:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 131. [2018-01-31 09:40:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-31 09:40:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2018-01-31 09:40:56,718 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 47 [2018-01-31 09:40:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:56,719 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2018-01-31 09:40:56,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 09:40:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2018-01-31 09:40:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 09:40:56,720 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:56,721 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-01-31 09:40:56,721 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:56,721 INFO L82 PathProgramCache]: Analyzing trace with hash 154524538, now seen corresponding path program 2 times [2018-01-31 09:40:56,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:56,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:56,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:56,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:56,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:56,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:40:56,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:56,895 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-31 09:40:56,912 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:40:56,919 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:56,928 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:56,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-31 09:40:57,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:40:57,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-01-31 09:40:57,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:40:57,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:40:57,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=100, Unknown=1, NotChecked=0, Total=132 [2018-01-31 09:40:57,030 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand 12 states. [2018-01-31 09:40:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:57,667 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2018-01-31 09:40:57,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:40:57,667 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-01-31 09:40:57,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:57,668 INFO L225 Difference]: With dead ends: 174 [2018-01-31 09:40:57,668 INFO L226 Difference]: Without dead ends: 143 [2018-01-31 09:40:57,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=363, Unknown=1, NotChecked=0, Total=506 [2018-01-31 09:40:57,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-31 09:40:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2018-01-31 09:40:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-31 09:40:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-01-31 09:40:57,679 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 47 [2018-01-31 09:40:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:57,679 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-01-31 09:40:57,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:40:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-01-31 09:40:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-31 09:40:57,679 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:57,680 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:40:57,680 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:57,680 INFO L82 PathProgramCache]: Analyzing trace with hash -739772656, now seen corresponding path program 2 times [2018-01-31 09:40:57,680 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:57,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:57,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:57,681 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:57,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:57,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-31 09:40:58,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:58,185 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-31 09:40:58,195 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:40:58,202 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:58,207 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:58,208 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:58,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:40:58,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:58,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2018-01-31 09:40:58,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 09:40:58,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 09:40:58,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-01-31 09:40:58,443 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand 25 states. [2018-01-31 09:40:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:59,695 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2018-01-31 09:40:59,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-31 09:40:59,696 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-01-31 09:40:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:59,698 INFO L225 Difference]: With dead ends: 275 [2018-01-31 09:40:59,698 INFO L226 Difference]: Without dead ends: 194 [2018-01-31 09:40:59,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 09:40:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-31 09:40:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2018-01-31 09:40:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-31 09:40:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2018-01-31 09:40:59,713 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 55 [2018-01-31 09:40:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:59,713 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2018-01-31 09:40:59,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 09:40:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2018-01-31 09:40:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 09:40:59,714 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:59,714 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:40:59,715 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:59,715 INFO L82 PathProgramCache]: Analyzing trace with hash 245732012, now seen corresponding path program 1 times [2018-01-31 09:40:59,715 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:59,715 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:59,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:59,716 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:59,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:59,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:40:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-01-31 09:40:59,948 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:59,948 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:40:59,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:59,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:41:00,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:00,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-01-31 09:41:00,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:41:00,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:41:00,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:41:00,116 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand 15 states. [2018-01-31 09:41:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:00,404 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2018-01-31 09:41:00,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:41:00,405 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-01-31 09:41:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:00,405 INFO L225 Difference]: With dead ends: 209 [2018-01-31 09:41:00,406 INFO L226 Difference]: Without dead ends: 197 [2018-01-31 09:41:00,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-01-31 09:41:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-31 09:41:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 187. [2018-01-31 09:41:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-31 09:41:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 205 transitions. [2018-01-31 09:41:00,419 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 205 transitions. Word has length 59 [2018-01-31 09:41:00,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:00,420 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 205 transitions. [2018-01-31 09:41:00,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:41:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 205 transitions. [2018-01-31 09:41:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-31 09:41:00,421 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:00,421 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:00,421 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:00,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1928929082, now seen corresponding path program 3 times [2018-01-31 09:41:00,422 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:00,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:00,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:00,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:41:00,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:00,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 09:41:00,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:00,963 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-31 09:41:00,969 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:41:00,976 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:00,979 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:00,982 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:00,983 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:00,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-31 09:41:01,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:01,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 21 [2018-01-31 09:41:01,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 09:41:01,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 09:41:01,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:41:01,196 INFO L87 Difference]: Start difference. First operand 187 states and 205 transitions. Second operand 22 states. [2018-01-31 09:41:02,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:02,204 INFO L93 Difference]: Finished difference Result 295 states and 324 transitions. [2018-01-31 09:41:02,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-31 09:41:02,204 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-01-31 09:41:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:02,206 INFO L225 Difference]: With dead ends: 295 [2018-01-31 09:41:02,206 INFO L226 Difference]: Without dead ends: 294 [2018-01-31 09:41:02,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=377, Invalid=2379, Unknown=0, NotChecked=0, Total=2756 [2018-01-31 09:41:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-01-31 09:41:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 234. [2018-01-31 09:41:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-31 09:41:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 257 transitions. [2018-01-31 09:41:02,229 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 257 transitions. Word has length 65 [2018-01-31 09:41:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:02,230 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 257 transitions. [2018-01-31 09:41:02,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 09:41:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 257 transitions. [2018-01-31 09:41:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 09:41:02,231 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:02,231 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:02,231 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:02,232 INFO L82 PathProgramCache]: Analyzing trace with hash 332741067, now seen corresponding path program 2 times [2018-01-31 09:41:02,232 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:02,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:02,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:02,233 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:02,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:02,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 09:41:02,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:02,753 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:02,758 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:41:02,766 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:02,771 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:02,772 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:02,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:02,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:41:02,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:02,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:02,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 09:41:03,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:03,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-01-31 09:41:03,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 09:41:03,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 09:41:03,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-01-31 09:41:03,065 INFO L87 Difference]: Start difference. First operand 234 states and 257 transitions. Second operand 23 states. [2018-01-31 09:41:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:03,945 INFO L93 Difference]: Finished difference Result 292 states and 321 transitions. [2018-01-31 09:41:03,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 09:41:03,945 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-01-31 09:41:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:03,947 INFO L225 Difference]: With dead ends: 292 [2018-01-31 09:41:03,947 INFO L226 Difference]: Without dead ends: 291 [2018-01-31 09:41:03,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 09:41:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-31 09:41:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 244. [2018-01-31 09:41:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-31 09:41:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 268 transitions. [2018-01-31 09:41:03,966 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 268 transitions. Word has length 66 [2018-01-31 09:41:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:03,967 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 268 transitions. [2018-01-31 09:41:03,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 09:41:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 268 transitions. [2018-01-31 09:41:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-31 09:41:03,968 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:03,968 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:03,968 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:03,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1158666688, now seen corresponding path program 3 times [2018-01-31 09:41:03,969 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:03,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:03,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:03,970 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:03,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:03,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 45 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-31 09:41:04,372 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:04,372 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:04,379 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:41:04,387 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:04,390 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:04,393 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:04,394 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:04,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:04,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:41:04,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:04,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:04,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-31 09:41:04,650 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:04,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-31 09:41:04,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 09:41:04,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 09:41:04,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2018-01-31 09:41:04,651 INFO L87 Difference]: Start difference. First operand 244 states and 268 transitions. Second operand 29 states. [2018-01-31 09:41:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:05,325 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2018-01-31 09:41:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 09:41:05,325 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2018-01-31 09:41:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:05,327 INFO L225 Difference]: With dead ends: 263 [2018-01-31 09:41:05,327 INFO L226 Difference]: Without dead ends: 262 [2018-01-31 09:41:05,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=357, Invalid=1623, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 09:41:05,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-01-31 09:41:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 213. [2018-01-31 09:41:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-31 09:41:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 232 transitions. [2018-01-31 09:41:05,347 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 232 transitions. Word has length 75 [2018-01-31 09:41:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:05,348 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 232 transitions. [2018-01-31 09:41:05,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 09:41:05,348 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 232 transitions. [2018-01-31 09:41:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-31 09:41:05,349 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:05,349 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:05,349 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:05,350 INFO L82 PathProgramCache]: Analyzing trace with hash -337153039, now seen corresponding path program 2 times [2018-01-31 09:41:05,350 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:05,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:05,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:05,351 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:05,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:05,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-31 09:41:05,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:05,484 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:05,490 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:41:05,496 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:05,502 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:05,503 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:05,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-31 09:41:05,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:05,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 19 [2018-01-31 09:41:05,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 09:41:05,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 09:41:05,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:41:05,646 INFO L87 Difference]: Start difference. First operand 213 states and 232 transitions. Second operand 19 states. [2018-01-31 09:41:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:05,997 INFO L93 Difference]: Finished difference Result 251 states and 276 transitions. [2018-01-31 09:41:05,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 09:41:05,997 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-01-31 09:41:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:05,998 INFO L225 Difference]: With dead ends: 251 [2018-01-31 09:41:05,998 INFO L226 Difference]: Without dead ends: 211 [2018-01-31 09:41:05,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 09:41:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-31 09:41:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 176. [2018-01-31 09:41:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-31 09:41:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2018-01-31 09:41:06,014 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 76 [2018-01-31 09:41:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:06,015 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2018-01-31 09:41:06,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 09:41:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2018-01-31 09:41:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-31 09:41:06,016 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:06,016 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:06,016 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash -291573701, now seen corresponding path program 4 times [2018-01-31 09:41:06,017 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:06,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:06,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:06,018 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:06,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:06,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-31 09:41:06,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:06,964 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:06,969 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:41:06,986 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:06,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-01-31 09:41:07,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:07,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 25 [2018-01-31 09:41:07,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 09:41:07,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 09:41:07,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-01-31 09:41:07,129 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand 26 states. [2018-01-31 09:41:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:09,074 INFO L93 Difference]: Finished difference Result 386 states and 419 transitions. [2018-01-31 09:41:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-31 09:41:09,110 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-01-31 09:41:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:09,111 INFO L225 Difference]: With dead ends: 386 [2018-01-31 09:41:09,111 INFO L226 Difference]: Without dead ends: 385 [2018-01-31 09:41:09,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=504, Invalid=3278, Unknown=0, NotChecked=0, Total=3782 [2018-01-31 09:41:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-01-31 09:41:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 251. [2018-01-31 09:41:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-31 09:41:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 277 transitions. [2018-01-31 09:41:09,132 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 277 transitions. Word has length 84 [2018-01-31 09:41:09,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:09,132 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 277 transitions. [2018-01-31 09:41:09,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 09:41:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 277 transitions. [2018-01-31 09:41:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-31 09:41:09,133 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:09,134 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:09,134 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:09,135 INFO L82 PathProgramCache]: Analyzing trace with hash -448849674, now seen corresponding path program 4 times [2018-01-31 09:41:09,135 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:09,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:09,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:09,136 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:09,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:09,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 23 proven. 50 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-31 09:41:09,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:09,521 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:09,525 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:41:09,542 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:09,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:09,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:41:09,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:09,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:09,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-01-31 09:41:09,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:09,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-31 09:41:09,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 09:41:09,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 09:41:09,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-01-31 09:41:09,827 INFO L87 Difference]: Start difference. First operand 251 states and 277 transitions. Second operand 29 states. [2018-01-31 09:41:12,256 WARN L143 SmtUtils]: Spent 216ms on a formula simplification that was a NOOP. DAG size: 24 [2018-01-31 09:41:12,872 WARN L143 SmtUtils]: Spent 147ms on a formula simplification that was a NOOP. DAG size: 19 [2018-01-31 09:41:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:13,023 INFO L93 Difference]: Finished difference Result 374 states and 406 transitions. [2018-01-31 09:41:13,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-31 09:41:13,023 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-01-31 09:41:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:13,025 INFO L225 Difference]: With dead ends: 374 [2018-01-31 09:41:13,025 INFO L226 Difference]: Without dead ends: 373 [2018-01-31 09:41:13,027 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=763, Invalid=5557, Unknown=0, NotChecked=0, Total=6320 [2018-01-31 09:41:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-01-31 09:41:13,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 220. [2018-01-31 09:41:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-31 09:41:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 240 transitions. [2018-01-31 09:41:13,045 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 240 transitions. Word has length 85 [2018-01-31 09:41:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:13,045 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 240 transitions. [2018-01-31 09:41:13,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 09:41:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 240 transitions. [2018-01-31 09:41:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-31 09:41:13,047 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:13,047 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:13,047 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:13,047 INFO L82 PathProgramCache]: Analyzing trace with hash 36527359, now seen corresponding path program 5 times [2018-01-31 09:41:13,048 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:13,048 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:13,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:13,049 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:13,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:13,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:13,429 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 09:41:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 30 proven. 86 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-31 09:41:13,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:13,906 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 09:41:13,915 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:13,922 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:13,925 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:13,927 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:13,930 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:13,933 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:13,937 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:13,938 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:13,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:13,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:41:13,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:13,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:13,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-01-31 09:41:14,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:14,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-01-31 09:41:14,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-31 09:41:14,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-31 09:41:14,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 09:41:14,300 INFO L87 Difference]: Start difference. First operand 220 states and 240 transitions. Second operand 33 states. [2018-01-31 09:41:15,448 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 36 DAG size of output 27 [2018-01-31 09:41:17,206 WARN L146 SmtUtils]: Spent 263ms on a formula simplification. DAG size of input: 33 DAG size of output 29 [2018-01-31 09:41:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:17,495 INFO L93 Difference]: Finished difference Result 505 states and 547 transitions. [2018-01-31 09:41:17,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-31 09:41:17,496 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-01-31 09:41:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:17,499 INFO L225 Difference]: With dead ends: 505 [2018-01-31 09:41:17,499 INFO L226 Difference]: Without dead ends: 503 [2018-01-31 09:41:17,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2424 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=934, Invalid=7622, Unknown=0, NotChecked=0, Total=8556 [2018-01-31 09:41:17,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-01-31 09:41:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 248. [2018-01-31 09:41:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-01-31 09:41:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-01-31 09:41:17,520 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 104 [2018-01-31 09:41:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:17,521 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-01-31 09:41:17,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-31 09:41:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-01-31 09:41:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-01-31 09:41:17,522 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:17,523 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:17,523 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash -705075217, now seen corresponding path program 5 times [2018-01-31 09:41:17,523 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:17,523 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:17,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:17,524 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:17,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:17,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-31 09:41:17,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:17,887 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:17,892 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 09:41:17,901 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:17,903 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:17,906 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:17,909 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:17,911 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:17,915 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:17,919 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:17,920 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:17,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-31 09:41:18,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:18,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 33 [2018-01-31 09:41:18,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-31 09:41:18,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-31 09:41:18,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1014, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 09:41:18,107 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 34 states. [2018-01-31 09:41:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:20,889 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-01-31 09:41:20,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-01-31 09:41:20,890 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 122 [2018-01-31 09:41:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:20,892 INFO L225 Difference]: With dead ends: 665 [2018-01-31 09:41:20,892 INFO L226 Difference]: Without dead ends: 664 [2018-01-31 09:41:20,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2521 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=749, Invalid=7083, Unknown=0, NotChecked=0, Total=7832 [2018-01-31 09:41:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-01-31 09:41:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 332. [2018-01-31 09:41:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-01-31 09:41:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 364 transitions. [2018-01-31 09:41:20,919 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 364 transitions. Word has length 122 [2018-01-31 09:41:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:20,920 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 364 transitions. [2018-01-31 09:41:20,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-31 09:41:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 364 transitions. [2018-01-31 09:41:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-31 09:41:20,921 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:20,921 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:20,921 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:20,922 INFO L82 PathProgramCache]: Analyzing trace with hash -382494782, now seen corresponding path program 6 times [2018-01-31 09:41:20,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:20,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:20,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:20,923 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:20,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:20,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-31 09:41:22,215 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:22,215 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:22,220 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 09:41:22,228 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:22,230 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:22,233 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:22,235 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:22,238 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:22,241 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:22,244 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:22,245 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:22,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:22,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:41:22,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:22,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:22,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 37 proven. 132 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-31 09:41:22,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:22,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2018-01-31 09:41:22,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-31 09:41:22,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-31 09:41:22,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2018-01-31 09:41:22,685 INFO L87 Difference]: Start difference. First operand 332 states and 364 transitions. Second operand 43 states. [2018-01-31 09:41:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:24,957 INFO L93 Difference]: Finished difference Result 467 states and 507 transitions. [2018-01-31 09:41:24,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-31 09:41:24,957 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 123 [2018-01-31 09:41:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:24,960 INFO L225 Difference]: With dead ends: 467 [2018-01-31 09:41:24,960 INFO L226 Difference]: Without dead ends: 466 [2018-01-31 09:41:24,962 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=736, Invalid=3956, Unknown=0, NotChecked=0, Total=4692 [2018-01-31 09:41:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-01-31 09:41:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 283. [2018-01-31 09:41:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-31 09:41:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 308 transitions. [2018-01-31 09:41:24,985 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 308 transitions. Word has length 123 [2018-01-31 09:41:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:24,985 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 308 transitions. [2018-01-31 09:41:24,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-31 09:41:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 308 transitions. [2018-01-31 09:41:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-01-31 09:41:24,987 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:24,987 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:24,987 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:24,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1091959176, now seen corresponding path program 7 times [2018-01-31 09:41:24,987 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:24,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:24,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:24,988 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:24,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:25,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:25,593 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 14 DAG size of output 9 [2018-01-31 09:41:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-31 09:41:25,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:25,999 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:26,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:41:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:26,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:26,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:41:26,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:26,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:26,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-31 09:41:26,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:26,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-01-31 09:41:26,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-31 09:41:26,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-31 09:41:26,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 09:41:26,576 INFO L87 Difference]: Start difference. First operand 283 states and 308 transitions. Second operand 35 states. [2018-01-31 09:41:27,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:27,476 INFO L93 Difference]: Finished difference Result 657 states and 710 transitions. [2018-01-31 09:41:27,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 09:41:27,476 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2018-01-31 09:41:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:27,479 INFO L225 Difference]: With dead ends: 657 [2018-01-31 09:41:27,479 INFO L226 Difference]: Without dead ends: 656 [2018-01-31 09:41:27,480 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=493, Invalid=2477, Unknown=0, NotChecked=0, Total=2970 [2018-01-31 09:41:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-01-31 09:41:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 284. [2018-01-31 09:41:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-01-31 09:41:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 309 transitions. [2018-01-31 09:41:27,499 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 309 transitions. Word has length 133 [2018-01-31 09:41:27,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:27,499 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 309 transitions. [2018-01-31 09:41:27,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-31 09:41:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 309 transitions. [2018-01-31 09:41:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-31 09:41:27,501 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:27,501 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:27,501 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:27,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1092215134, now seen corresponding path program 6 times [2018-01-31 09:41:27,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:27,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:27,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:27,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:41:27,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:27,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-31 09:41:28,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:28,339 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:28,344 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 09:41:28,353 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:28,355 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:28,358 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:28,360 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:28,363 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:28,366 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:28,369 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:28,373 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:28,373 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:28,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-31 09:41:28,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:28,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2018-01-31 09:41:28,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 09:41:28,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 09:41:28,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-01-31 09:41:28,476 INFO L87 Difference]: Start difference. First operand 284 states and 309 transitions. Second operand 25 states. [2018-01-31 09:41:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:28,943 INFO L93 Difference]: Finished difference Result 429 states and 467 transitions. [2018-01-31 09:41:28,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-31 09:41:28,944 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 141 [2018-01-31 09:41:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:28,946 INFO L225 Difference]: With dead ends: 429 [2018-01-31 09:41:28,946 INFO L226 Difference]: Without dead ends: 428 [2018-01-31 09:41:28,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=386, Invalid=1594, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 09:41:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-01-31 09:41:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 369. [2018-01-31 09:41:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-01-31 09:41:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 404 transitions. [2018-01-31 09:41:28,972 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 404 transitions. Word has length 141 [2018-01-31 09:41:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:28,972 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 404 transitions. [2018-01-31 09:41:28,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 09:41:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 404 transitions. [2018-01-31 09:41:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-31 09:41:28,974 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:28,974 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:28,974 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:28,974 INFO L82 PathProgramCache]: Analyzing trace with hash -501068749, now seen corresponding path program 8 times [2018-01-31 09:41:28,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:28,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:28,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:28,975 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:28,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:28,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 44 proven. 188 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-31 09:41:29,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:29,491 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:29,496 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:41:29,506 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:29,520 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:29,522 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:29,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:29,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:41:29,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:29,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:29,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-31 09:41:30,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:30,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 40 [2018-01-31 09:41:30,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-31 09:41:30,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-31 09:41:30,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1496, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 09:41:30,051 INFO L87 Difference]: Start difference. First operand 369 states and 404 transitions. Second operand 41 states. [2018-01-31 09:41:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:34,632 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-01-31 09:41:34,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-01-31 09:41:34,632 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 142 [2018-01-31 09:41:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:34,635 INFO L225 Difference]: With dead ends: 845 [2018-01-31 09:41:34,635 INFO L226 Difference]: Without dead ends: 843 [2018-01-31 09:41:34,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4238 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1342, Invalid=13178, Unknown=0, NotChecked=0, Total=14520 [2018-01-31 09:41:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-01-31 09:41:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 320. [2018-01-31 09:41:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-01-31 09:41:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 348 transitions. [2018-01-31 09:41:34,663 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 348 transitions. Word has length 142 [2018-01-31 09:41:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:34,664 INFO L432 AbstractCegarLoop]: Abstraction has 320 states and 348 transitions. [2018-01-31 09:41:34,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-31 09:41:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 348 transitions. [2018-01-31 09:41:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-01-31 09:41:34,665 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:34,666 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:34,666 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:34,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1165341789, now seen corresponding path program 7 times [2018-01-31 09:41:34,666 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:34,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:34,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:34,668 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:34,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:34,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-01-31 09:41:35,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:35,368 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:35,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:41:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:35,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-01-31 09:41:35,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:35,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 39 [2018-01-31 09:41:35,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-31 09:41:35,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-31 09:41:35,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 09:41:35,633 INFO L87 Difference]: Start difference. First operand 320 states and 348 transitions. Second operand 40 states. [2018-01-31 09:41:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:36,884 INFO L93 Difference]: Finished difference Result 912 states and 986 transitions. [2018-01-31 09:41:36,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-31 09:41:36,884 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 160 [2018-01-31 09:41:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:36,888 INFO L225 Difference]: With dead ends: 912 [2018-01-31 09:41:36,888 INFO L226 Difference]: Without dead ends: 911 [2018-01-31 09:41:36,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=559, Invalid=3731, Unknown=0, NotChecked=0, Total=4290 [2018-01-31 09:41:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-01-31 09:41:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 328. [2018-01-31 09:41:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-01-31 09:41:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 357 transitions. [2018-01-31 09:41:36,919 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 357 transitions. Word has length 160 [2018-01-31 09:41:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:36,920 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 357 transitions. [2018-01-31 09:41:36,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-31 09:41:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 357 transitions. [2018-01-31 09:41:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-31 09:41:36,922 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:36,922 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:36,922 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:36,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1765856626, now seen corresponding path program 9 times [2018-01-31 09:41:36,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:36,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:36,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:36,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:41:36,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:36,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 51 proven. 254 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-31 09:41:38,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:38,052 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:38,057 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:41:38,068 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:38,071 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:38,073 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:38,076 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:38,079 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:38,082 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:38,086 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:38,089 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:38,090 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:38,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:38,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:41:38,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:38,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:38,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 51 proven. 254 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-31 09:41:38,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:38,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-01-31 09:41:38,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-31 09:41:38,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-31 09:41:38,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1860, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 09:41:38,634 INFO L87 Difference]: Start difference. First operand 328 states and 357 transitions. Second operand 47 states. [2018-01-31 09:41:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:39,366 INFO L93 Difference]: Finished difference Result 501 states and 546 transitions. [2018-01-31 09:41:39,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 09:41:39,367 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 161 [2018-01-31 09:41:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:39,368 INFO L225 Difference]: With dead ends: 501 [2018-01-31 09:41:39,368 INFO L226 Difference]: Without dead ends: 499 [2018-01-31 09:41:39,369 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=790, Invalid=3902, Unknown=0, NotChecked=0, Total=4692 [2018-01-31 09:41:39,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-01-31 09:41:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 355. [2018-01-31 09:41:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-01-31 09:41:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 386 transitions. [2018-01-31 09:41:39,398 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 386 transitions. Word has length 161 [2018-01-31 09:41:39,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:39,398 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 386 transitions. [2018-01-31 09:41:39,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-31 09:41:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 386 transitions. [2018-01-31 09:41:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-01-31 09:41:39,400 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:39,400 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:39,400 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash -991764284, now seen corresponding path program 10 times [2018-01-31 09:41:39,400 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:39,400 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:39,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:39,401 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:39,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:39,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 109 proven. 328 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-31 09:41:40,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:40,094 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:40,099 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:41:40,128 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:40,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:40,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:41:40,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:40,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:40,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-01-31 09:41:40,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:40,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 48 [2018-01-31 09:41:40,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-31 09:41:40,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-31 09:41:40,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2156, Unknown=0, NotChecked=0, Total=2352 [2018-01-31 09:41:40,806 INFO L87 Difference]: Start difference. First operand 355 states and 386 transitions. Second operand 49 states. [2018-01-31 09:41:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:46,899 INFO L93 Difference]: Finished difference Result 1185 states and 1283 transitions. [2018-01-31 09:41:46,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-01-31 09:41:46,899 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 171 [2018-01-31 09:41:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:46,902 INFO L225 Difference]: With dead ends: 1185 [2018-01-31 09:41:46,903 INFO L226 Difference]: Without dead ends: 1184 [2018-01-31 09:41:46,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6098 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1726, Invalid=18580, Unknown=0, NotChecked=0, Total=20306 [2018-01-31 09:41:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-01-31 09:41:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 458. [2018-01-31 09:41:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-01-31 09:41:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 501 transitions. [2018-01-31 09:41:46,945 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 501 transitions. Word has length 171 [2018-01-31 09:41:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:46,945 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 501 transitions. [2018-01-31 09:41:46,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-31 09:41:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 501 transitions. [2018-01-31 09:41:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-01-31 09:41:46,947 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:46,947 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:46,947 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash 434745258, now seen corresponding path program 8 times [2018-01-31 09:41:46,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:46,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:46,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:46,948 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:46,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:46,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-01-31 09:41:48,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:48,374 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:48,380 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:41:48,390 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:48,406 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:48,409 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:48,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-01-31 09:41:48,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:48,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 45 [2018-01-31 09:41:48,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-31 09:41:48,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-31 09:41:48,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1890, Unknown=0, NotChecked=0, Total=2070 [2018-01-31 09:41:48,758 INFO L87 Difference]: Start difference. First operand 458 states and 501 transitions. Second operand 46 states. [2018-01-31 09:41:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:52,488 INFO L93 Difference]: Finished difference Result 1281 states and 1387 transitions. [2018-01-31 09:41:52,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-01-31 09:41:52,506 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 179 [2018-01-31 09:41:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:52,511 INFO L225 Difference]: With dead ends: 1281 [2018-01-31 09:41:52,512 INFO L226 Difference]: Without dead ends: 1280 [2018-01-31 09:41:52,516 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5296 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1211, Invalid=14289, Unknown=0, NotChecked=0, Total=15500 [2018-01-31 09:41:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2018-01-31 09:41:52,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 391. [2018-01-31 09:41:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-01-31 09:41:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 425 transitions. [2018-01-31 09:41:52,558 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 425 transitions. Word has length 179 [2018-01-31 09:41:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:52,558 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 425 transitions. [2018-01-31 09:41:52,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-31 09:41:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 425 transitions. [2018-01-31 09:41:52,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-31 09:41:52,560 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:52,560 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:52,560 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:52,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1859389809, now seen corresponding path program 11 times [2018-01-31 09:41:52,561 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:52,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:52,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:52,561 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:52,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:52,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:41:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 125 proven. 414 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-31 09:41:53,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:53,654 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:53,659 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 09:41:53,669 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:53,672 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:53,680 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:53,683 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:53,686 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:53,689 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:53,693 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:53,696 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:53,701 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:53,706 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:53,708 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:53,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:53,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:41:53,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:53,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:53,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-01-31 09:41:54,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:54,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24] total 52 [2018-01-31 09:41:54,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-31 09:41:54,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-31 09:41:54,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2532, Unknown=0, NotChecked=0, Total=2756 [2018-01-31 09:41:54,554 INFO L87 Difference]: Start difference. First operand 391 states and 425 transitions. Second operand 53 states. [2018-01-31 09:42:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:01,153 INFO L93 Difference]: Finished difference Result 1427 states and 1545 transitions. [2018-01-31 09:42:01,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-01-31 09:42:01,153 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 190 [2018-01-31 09:42:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:01,156 INFO L225 Difference]: With dead ends: 1427 [2018-01-31 09:42:01,156 INFO L226 Difference]: Without dead ends: 1426 [2018-01-31 09:42:01,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7399 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1981, Invalid=22511, Unknown=0, NotChecked=0, Total=24492 [2018-01-31 09:42:01,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2018-01-31 09:42:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 503. [2018-01-31 09:42:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-01-31 09:42:01,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 550 transitions. [2018-01-31 09:42:01,206 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 550 transitions. Word has length 190 [2018-01-31 09:42:01,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:01,206 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 550 transitions. [2018-01-31 09:42:01,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-31 09:42:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 550 transitions. [2018-01-31 09:42:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-01-31 09:42:01,209 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:01,209 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:01,209 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:01,209 INFO L82 PathProgramCache]: Analyzing trace with hash 644995927, now seen corresponding path program 9 times [2018-01-31 09:42:01,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:01,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:01,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:01,211 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:42:01,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:01,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 7 proven. 540 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-01-31 09:42:01,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:01,945 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:42:01,950 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:42:01,967 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:42:01,983 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:42:01,998 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:42:02,009 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:42:02,024 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:42:02,043 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:42:02,053 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:42:02,069 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:42:02,088 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:42:02,099 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:42:02,112 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:42:02,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 0 proven. 471 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-01-31 09:42:02,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:02,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 33 [2018-01-31 09:42:02,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-31 09:42:02,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-31 09:42:02,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 09:42:02,935 INFO L87 Difference]: Start difference. First operand 503 states and 550 transitions. Second operand 34 states. [2018-01-31 09:42:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:03,812 INFO L93 Difference]: Finished difference Result 688 states and 748 transitions. [2018-01-31 09:42:03,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-31 09:42:03,812 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 198 [2018-01-31 09:42:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:03,814 INFO L225 Difference]: With dead ends: 688 [2018-01-31 09:42:03,814 INFO L226 Difference]: Without dead ends: 687 [2018-01-31 09:42:03,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=738, Invalid=3294, Unknown=0, NotChecked=0, Total=4032 [2018-01-31 09:42:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-01-31 09:42:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 419. [2018-01-31 09:42:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-01-31 09:42:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 455 transitions. [2018-01-31 09:42:03,841 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 455 transitions. Word has length 198 [2018-01-31 09:42:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:03,842 INFO L432 AbstractCegarLoop]: Abstraction has 419 states and 455 transitions. [2018-01-31 09:42:03,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-31 09:42:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 455 transitions. [2018-01-31 09:42:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-01-31 09:42:03,844 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:03,844 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:03,844 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:03,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1693773537, now seen corresponding path program 10 times [2018-01-31 09:42:03,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:03,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:03,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:03,845 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:42:03,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:03,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 565 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-01-31 09:42:04,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:04,891 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:42:04,896 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:42:04,933 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:42:04,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-01-31 09:42:05,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:05,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22] total 51 [2018-01-31 09:42:05,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-31 09:42:05,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-31 09:42:05,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2419, Unknown=0, NotChecked=0, Total=2652 [2018-01-31 09:42:05,323 INFO L87 Difference]: Start difference. First operand 419 states and 455 transitions. Second operand 52 states. [2018-01-31 09:42:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:09,696 INFO L93 Difference]: Finished difference Result 1695 states and 1835 transitions. [2018-01-31 09:42:09,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-01-31 09:42:09,697 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 208 [2018-01-31 09:42:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:09,702 INFO L225 Difference]: With dead ends: 1695 [2018-01-31 09:42:09,702 INFO L226 Difference]: Without dead ends: 1694 [2018-01-31 09:42:09,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6908 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1494, Invalid=18246, Unknown=0, NotChecked=0, Total=19740 [2018-01-31 09:42:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2018-01-31 09:42:09,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 539. [2018-01-31 09:42:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-01-31 09:42:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 589 transitions. [2018-01-31 09:42:09,761 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 589 transitions. Word has length 208 [2018-01-31 09:42:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:09,764 INFO L432 AbstractCegarLoop]: Abstraction has 539 states and 589 transitions. [2018-01-31 09:42:09,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-31 09:42:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 589 transitions. [2018-01-31 09:42:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-01-31 09:42:09,766 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:09,766 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:09,766 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:09,766 INFO L82 PathProgramCache]: Analyzing trace with hash 967372560, now seen corresponding path program 12 times [2018-01-31 09:42:09,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:09,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:09,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:09,767 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:42:09,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:09,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 65 proven. 510 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-01-31 09:42:11,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:11,568 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:42:11,574 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 09:42:11,588 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:42:11,604 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:42:11,619 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:42:11,629 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:42:11,632 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:42:11,637 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:42:11,640 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:42:11,643 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:42:11,647 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:42:11,651 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:42:11,656 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:42:11,657 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:42:11,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:11,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:42:11,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:42:11,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:42:11,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:42:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-01-31 09:42:12,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:12,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 54 [2018-01-31 09:42:12,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-31 09:42:12,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-31 09:42:12,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2652, Unknown=0, NotChecked=0, Total=2970 [2018-01-31 09:42:12,554 INFO L87 Difference]: Start difference. First operand 539 states and 589 transitions. Second operand 55 states. [2018-01-31 09:42:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:18,628 INFO L93 Difference]: Finished difference Result 1692 states and 1832 transitions. [2018-01-31 09:42:18,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-01-31 09:42:18,629 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2018-01-31 09:42:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:18,634 INFO L225 Difference]: With dead ends: 1692 [2018-01-31 09:42:18,634 INFO L226 Difference]: Without dead ends: 1691 [2018-01-31 09:42:18,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8643 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=4052, Invalid=24340, Unknown=0, NotChecked=0, Total=28392 [2018-01-31 09:42:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2018-01-31 09:42:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 455. [2018-01-31 09:42:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-01-31 09:42:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 494 transitions. [2018-01-31 09:42:18,695 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 494 transitions. Word has length 209 [2018-01-31 09:42:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:18,696 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 494 transitions. [2018-01-31 09:42:18,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-31 09:42:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 494 transitions. [2018-01-31 09:42:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-01-31 09:42:18,698 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:18,699 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:18,699 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:18,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1076474324, now seen corresponding path program 11 times [2018-01-31 09:42:18,699 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:18,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:18,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:18,700 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:42:18,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:18,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 125 proven. 887 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-31 09:42:20,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:20,314 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:42:20,319 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 09:42:20,329 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:20,331 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:20,334 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:20,337 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:20,340 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:20,343 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:20,346 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:20,350 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:20,355 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:20,360 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:20,365 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:20,372 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:20,374 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:42:20,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-01-31 09:42:22,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:22,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 24] total 65 [2018-01-31 09:42:22,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-01-31 09:42:22,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-01-31 09:42:22,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=3975, Unknown=0, NotChecked=0, Total=4290 [2018-01-31 09:42:22,012 INFO L87 Difference]: Start difference. First operand 455 states and 494 transitions. Second operand 66 states. [2018-01-31 09:42:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:28,269 INFO L93 Difference]: Finished difference Result 1985 states and 2149 transitions. [2018-01-31 09:42:28,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-01-31 09:42:28,270 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 227 [2018-01-31 09:42:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:28,274 INFO L225 Difference]: With dead ends: 1985 [2018-01-31 09:42:28,274 INFO L226 Difference]: Without dead ends: 1984 [2018-01-31 09:42:28,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1933, Invalid=24473, Unknown=0, NotChecked=0, Total=26406 [2018-01-31 09:42:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2018-01-31 09:42:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 584. [2018-01-31 09:42:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-01-31 09:42:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 638 transitions. [2018-01-31 09:42:28,337 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 638 transitions. Word has length 227 [2018-01-31 09:42:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:28,338 INFO L432 AbstractCegarLoop]: Abstraction has 584 states and 638 transitions. [2018-01-31 09:42:28,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-01-31 09:42:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 638 transitions. [2018-01-31 09:42:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-31 09:42:28,340 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:28,340 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:28,340 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash 989034789, now seen corresponding path program 13 times [2018-01-31 09:42:28,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:28,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:28,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:28,341 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:42:28,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:28,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 435 proven. 698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:42:30,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:30,252 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:42:30,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:30,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:30,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:42:30,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:42:30,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:42:30,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:42:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-01-31 09:42:31,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:31,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 27] total 77 [2018-01-31 09:42:31,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-01-31 09:42:31,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-01-31 09:42:31,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=5604, Unknown=0, NotChecked=0, Total=6006 [2018-01-31 09:42:31,650 INFO L87 Difference]: Start difference. First operand 584 states and 638 transitions. Second operand 78 states. [2018-01-31 09:42:36,080 WARN L146 SmtUtils]: Spent 378ms on a formula simplification. DAG size of input: 36 DAG size of output 29 Received shutdown request... [2018-01-31 09:42:38,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-01-31 09:42:38,747 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 09:42:38,751 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 09:42:38,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:42:38 BasicIcfg [2018-01-31 09:42:38,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:42:38,752 INFO L168 Benchmark]: Toolchain (without parser) took 122492.34 ms. Allocated memory was 308.8 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 269.7 MB in the beginning and 1.1 GB in the end (delta: -785.8 MB). Peak memory consumption was 699.5 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:38,753 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 308.8 MB. Free memory is still 274.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:42:38,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.50 ms. Allocated memory is still 308.8 MB. Free memory was 268.7 MB in the beginning and 260.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:38,753 INFO L168 Benchmark]: Boogie Preprocessor took 50.06 ms. Allocated memory is still 308.8 MB. Free memory was 260.7 MB in the beginning and 258.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:38,754 INFO L168 Benchmark]: RCFGBuilder took 494.76 ms. Allocated memory is still 308.8 MB. Free memory was 258.7 MB in the beginning and 241.6 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:38,754 INFO L168 Benchmark]: IcfgTransformer took 13105.33 ms. Allocated memory was 308.8 MB in the beginning and 919.6 MB in the end (delta: 610.8 MB). Free memory was 241.6 MB in the beginning and 832.3 MB in the end (delta: -590.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:38,757 INFO L168 Benchmark]: TraceAbstraction took 108564.23 ms. Allocated memory was 919.6 MB in the beginning and 1.8 GB in the end (delta: 874.5 MB). Free memory was 832.3 MB in the beginning and 1.1 GB in the end (delta: -223.2 MB). Peak memory consumption was 651.3 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:38,758 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 308.8 MB. Free memory is still 274.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 262.50 ms. Allocated memory is still 308.8 MB. Free memory was 268.7 MB in the beginning and 260.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 50.06 ms. Allocated memory is still 308.8 MB. Free memory was 260.7 MB in the beginning and 258.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 494.76 ms. Allocated memory is still 308.8 MB. Free memory was 258.7 MB in the beginning and 241.6 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 13105.33 ms. Allocated memory was 308.8 MB in the beginning and 919.6 MB in the end (delta: 610.8 MB). Free memory was 241.6 MB in the beginning and 832.3 MB in the end (delta: -590.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 108564.23 ms. Allocated memory was 919.6 MB in the beginning and 1.8 GB in the end (delta: 874.5 MB). Free memory was 832.3 MB in the beginning and 1.1 GB in the end (delta: -223.2 MB). Peak memory consumption was 651.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 59 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 1005 LocStat_NO_SUPPORTING_DISEQUALITIES : 461 LocStat_NO_DISJUNCTIONS : -118 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 79 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 102 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 80 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.866599 RENAME_VARIABLES(MILLISECONDS) : 0.253220 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.838656 PROJECTAWAY(MILLISECONDS) : 0.416331 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.071926 DISJOIN(MILLISECONDS) : 0.309370 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.288064 ADD_EQUALITY(MILLISECONDS) : 0.021961 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.039588 #CONJOIN_DISJUNCTIVE : 762 #RENAME_VARIABLES : 1685 #UNFREEZE : 0 #CONJOIN : 1052 #PROJECTAWAY : 985 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 183 #RENAME_VARIABLES_DISJUNCTIVE : 1665 #ADD_EQUALITY : 102 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (584states) and interpolant automaton (currently 77 states, 78 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 150 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (584states) and interpolant automaton (currently 77 states, 78 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 150 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (584states) and interpolant automaton (currently 77 states, 78 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 150 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (584states) and interpolant automaton (currently 77 states, 78 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 150 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (584states) and interpolant automaton (currently 77 states, 78 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 150 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (584states) and interpolant automaton (currently 77 states, 78 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 150 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. TIMEOUT Result, 108.3s OverallTime, 36 OverallIterations, 12 TraceHistogramMax, 69.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2036 SDtfs, 14847 SDslu, 31747 SDs, 0 SdLazy, 59492 SolverSat, 3358 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 29.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5356 GetRequests, 3163 SyntacticMatches, 12 SemanticMatches, 2180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71551 ImplicationChecksByTransitivity, 61.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=584occurred in iteration=35, 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.8s AutomataMinimizationTime, 35 MinimizatonAttempts, 9749 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 7161 NumberOfCodeBlocks, 7086 NumberOfCodeBlocksAsserted, 152 NumberOfCheckSat, 7093 ConstructedInterpolants, 2 QuantifiedInterpolants, 8724563 SizeOfPredicates, 399 NumberOfNonLiveVariables, 5760 ConjunctsInSsa, 821 ConjunctsInUnsatCore, 68 InterpolantComputations, 7 PerfectInterpolantSequences, 9639/21222 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-42-38-771.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-42-38-771.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-42-38-771.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-42-38-771.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-42-38-771.csv Completed graceful shutdown