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-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:40:15,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:40:15,518 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:40:15,534 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:40:15,534 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:40:15,535 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:40:15,536 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:40:15,538 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:40:15,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:40:15,541 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:40:15,542 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:40:15,543 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:40:15,544 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:40:15,545 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:40:15,546 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:40:15,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:40:15,551 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:40:15,553 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:40:15,554 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:40:15,555 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:40:15,557 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:40:15,558 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:40:15,558 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:40:15,559 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:40:15,560 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:40:15,561 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:40:15,561 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:40:15,562 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:40:15,562 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:40:15,563 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:40:15,563 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:40:15,564 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:15,578 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:40:15,579 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:40:15,580 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:40:15,580 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:40:15,580 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:40:15,580 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:40:15,581 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:40:15,581 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:40:15,581 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:40:15,582 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:40:15,582 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:40:15,582 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:40:15,582 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:40:15,583 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:40:15,583 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:40:15,583 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:40:15,583 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:40:15,584 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:40:15,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:40:15,584 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:40:15,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:40:15,585 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:40:15,585 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:40:15,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:40:15,592 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:40:15,592 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:40:15,592 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:40:15,592 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:40:15,592 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:40:15,592 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:40:15,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:40:15,593 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:40:15,594 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:40:15,594 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:40:15,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:40:15,648 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:40:15,658 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:40:15,659 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:40:15,660 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:40:15,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-01-31 09:40:15,756 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:40:15,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:40:15,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:40:15,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:40:15,774 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:40:15,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:40:15" (1/1) ... [2018-01-31 09:40:15,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4058971b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:15, skipping insertion in model container [2018-01-31 09:40:15,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:40:15" (1/1) ... [2018-01-31 09:40:15,801 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:40:15,823 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:40:15,996 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:40:16,015 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:40:16,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:16 WrapperNode [2018-01-31 09:40:16,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:40:16,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:40:16,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:40:16,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:40:16,042 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:16" (1/1) ... [2018-01-31 09:40:16,042 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:16" (1/1) ... [2018-01-31 09:40:16,055 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:16" (1/1) ... [2018-01-31 09:40:16,055 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:16" (1/1) ... [2018-01-31 09:40:16,061 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:16" (1/1) ... [2018-01-31 09:40:16,075 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:16" (1/1) ... [2018-01-31 09:40:16,076 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:16" (1/1) ... [2018-01-31 09:40:16,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:40:16,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:40:16,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:40:16,079 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:40:16,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:16" (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:16,150 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:40:16,150 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:40:16,150 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 09:40:16,150 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:40:16,150 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:40:16,151 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:40:16,151 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:40:16,151 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:40:16,151 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:40:16,151 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 09:40:16,151 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:40:16,151 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:40:16,152 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:40:16,576 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:40:16,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:40:16 BoogieIcfgContainer [2018-01-31 09:40:16,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:40:16,577 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:40:16,577 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:40:16,578 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:40:16,581 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:40:16" (1/1) ... [2018-01-31 09:40:16,591 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:40:16,592 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:40:16,592 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:40:16,633 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 6 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:40:16,667 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:40:16,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:40:30,535 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:30,540 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:40:30,555 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-01-31 09:40:30,555 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:40:30,556 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:40:30,557 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:30,564 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:40:30,564 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:40:30,565 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:40:30,565 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-31 09:40:30,565 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:40:30,565 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:40:30,566 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-31 09:40:30,566 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:40:30,567 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:40:30,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:40:30 BasicIcfg [2018-01-31 09:40:30,588 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:40:30,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:40:30,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:40:30,600 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:40:30,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:40:15" (1/4) ... [2018-01-31 09:40:30,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e485d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:40:30, skipping insertion in model container [2018-01-31 09:40:30,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:40:16" (2/4) ... [2018-01-31 09:40:30,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e485d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:40:30, skipping insertion in model container [2018-01-31 09:40:30,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:40:16" (3/4) ... [2018-01-31 09:40:30,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e485d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:40:30, skipping insertion in model container [2018-01-31 09:40:30,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:40:30" (4/4) ... [2018-01-31 09:40:30,606 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:40:30,615 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:40:30,622 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-31 09:40:30,753 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:40:30,754 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:40:30,754 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:40:30,754 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:40:30,754 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:40:30,754 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:40:30,755 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:40:30,755 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:40:30,755 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:40:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-31 09:40:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-31 09:40:30,777 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:30,778 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:40:30,778 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:30,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1068910584, now seen corresponding path program 1 times [2018-01-31 09:40:30,786 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:30,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:30,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:30,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:30,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:30,897 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:31,053 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:31,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:40:31,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:40:31,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:40:31,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:40:31,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:40:31,072 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-01-31 09:40:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:31,430 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2018-01-31 09:40:31,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:40:31,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-01-31 09:40:31,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:31,445 INFO L225 Difference]: With dead ends: 133 [2018-01-31 09:40:31,446 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 09:40:31,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:40:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 09:40:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-31 09:40:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 09:40:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-31 09:40:31,498 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 9 [2018-01-31 09:40:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:31,499 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-31 09:40:31,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:40:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-31 09:40:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 09:40:31,500 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:31,500 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:31,500 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1115648547, now seen corresponding path program 1 times [2018-01-31 09:40:31,500 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:31,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:31,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:31,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:31,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:31,522 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:32,163 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:32,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:40:32,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:40:32,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:40:32,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:40:32,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:40:32,167 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 7 states. [2018-01-31 09:40:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:32,728 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2018-01-31 09:40:32,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:40:32,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-31 09:40:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:32,768 INFO L225 Difference]: With dead ends: 172 [2018-01-31 09:40:32,769 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 09:40:32,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:40:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 09:40:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2018-01-31 09:40:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 09:40:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-01-31 09:40:32,782 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 18 [2018-01-31 09:40:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:32,783 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-01-31 09:40:32,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:40:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-01-31 09:40:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 09:40:32,784 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:32,784 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:32,784 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:32,784 INFO L82 PathProgramCache]: Analyzing trace with hash -225366126, now seen corresponding path program 1 times [2018-01-31 09:40:32,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:32,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:32,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:32,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:32,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:32,794 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:32,905 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:32,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:40:32,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:40:32,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:40:32,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:40:32,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:40:32,906 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 5 states. [2018-01-31 09:40:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:33,065 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-01-31 09:40:33,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:40:33,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-31 09:40:33,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:33,067 INFO L225 Difference]: With dead ends: 88 [2018-01-31 09:40:33,067 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 09:40:33,068 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:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 09:40:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-31 09:40:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 09:40:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-31 09:40:33,078 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 19 [2018-01-31 09:40:33,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:33,078 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-31 09:40:33,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:40:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-31 09:40:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 09:40:33,079 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:33,079 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:33,079 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:33,080 INFO L82 PathProgramCache]: Analyzing trace with hash -225366124, now seen corresponding path program 1 times [2018-01-31 09:40:33,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:33,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:33,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:33,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:33,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:33,092 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:33,362 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:33,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:40:33,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:40:33,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:40:33,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:40:33,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:40:33,364 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 6 states. [2018-01-31 09:40:33,561 WARN L143 SmtUtils]: Spent 166ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-31 09:40:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:33,846 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-01-31 09:40:33,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:40:33,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-31 09:40:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:33,848 INFO L225 Difference]: With dead ends: 101 [2018-01-31 09:40:33,848 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 09:40:33,848 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:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 09:40:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2018-01-31 09:40:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 09:40:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-01-31 09:40:33,859 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 19 [2018-01-31 09:40:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:33,860 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-01-31 09:40:33,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:40:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-01-31 09:40:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 09:40:33,861 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:33,861 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:33,861 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:33,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1537306562, now seen corresponding path program 1 times [2018-01-31 09:40:33,862 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:33,862 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:33,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:33,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:33,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:33,874 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:34,040 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:34,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:34,041 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:34,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:34,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:34,148 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:34,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:40:34,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-31 09:40:34,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:40:34,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:40:34,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:40:34,169 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 8 states. [2018-01-31 09:40:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:34,345 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-01-31 09:40:34,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:40:34,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-31 09:40:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:34,347 INFO L225 Difference]: With dead ends: 127 [2018-01-31 09:40:34,347 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 09:40:34,348 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:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 09:40:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2018-01-31 09:40:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-31 09:40:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-01-31 09:40:34,358 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 19 [2018-01-31 09:40:34,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:34,358 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-01-31 09:40:34,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:40:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-01-31 09:40:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 09:40:34,359 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:34,360 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:34,360 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:34,360 INFO L82 PathProgramCache]: Analyzing trace with hash 184823418, now seen corresponding path program 1 times [2018-01-31 09:40:34,360 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:34,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:34,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:34,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:34,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:34,371 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:34,452 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:34,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:34,452 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) [2018-01-31 09:40:34,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:40:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:34,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:34,535 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:34,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:34,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-31 09:40:34,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:40:34,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:40:34,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:40:34,559 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 5 states. [2018-01-31 09:40:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:34,638 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-01-31 09:40:34,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:40:34,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-31 09:40:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:34,639 INFO L225 Difference]: With dead ends: 133 [2018-01-31 09:40:34,639 INFO L226 Difference]: Without dead ends: 132 [2018-01-31 09:40:34,640 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:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-31 09:40:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2018-01-31 09:40:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 09:40:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-01-31 09:40:34,659 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 27 [2018-01-31 09:40:34,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:34,659 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2018-01-31 09:40:34,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:40:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-01-31 09:40:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:40:34,661 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:34,661 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:34,661 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:34,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1434559127, now seen corresponding path program 1 times [2018-01-31 09:40:34,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:34,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:34,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:34,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:34,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:34,673 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:34,938 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:34,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:34,938 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:34,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:34,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:34,977 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:34,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:40:34,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:40:34,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:40:35,194 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:35,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:35,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-31 09:40:35,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:40:35,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:40:35,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:40:35,215 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 9 states. [2018-01-31 09:40:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:35,479 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-01-31 09:40:35,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:40:35,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-31 09:40:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:35,483 INFO L225 Difference]: With dead ends: 132 [2018-01-31 09:40:35,483 INFO L226 Difference]: Without dead ends: 131 [2018-01-31 09:40:35,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:40:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-31 09:40:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2018-01-31 09:40:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-31 09:40:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2018-01-31 09:40:35,496 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 28 [2018-01-31 09:40:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:35,496 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2018-01-31 09:40:35,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:40:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2018-01-31 09:40:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 09:40:35,498 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:35,498 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:35,498 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash -123801987, now seen corresponding path program 2 times [2018-01-31 09:40:35,499 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:35,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:35,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:35,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:35,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:35,512 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:35,725 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:35,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:35,725 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:40:35,740 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:40:35,756 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:35,759 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:35,760 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:35,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:36,003 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:36,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:40:36,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-01-31 09:40:36,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:40:36,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:40:36,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:40:36,024 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 18 states. [2018-01-31 09:40:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:36,224 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2018-01-31 09:40:36,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:40:36,227 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-01-31 09:40:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:36,229 INFO L225 Difference]: With dead ends: 202 [2018-01-31 09:40:36,229 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 09:40:36,230 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-01-31 09:40:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 09:40:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2018-01-31 09:40:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 09:40:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-01-31 09:40:36,239 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 36 [2018-01-31 09:40:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:36,240 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-01-31 09:40:36,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:40:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-01-31 09:40:36,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 09:40:36,242 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:36,242 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:36,242 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:36,242 INFO L82 PathProgramCache]: Analyzing trace with hash 729468996, now seen corresponding path program 1 times [2018-01-31 09:40:36,242 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:36,242 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:36,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:36,243 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:36,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:36,253 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:36,321 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:36,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:36,321 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:36,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:36,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:36,367 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:36,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:36,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-31 09:40:36,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:40:36,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:40:36,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:40:36,394 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 9 states. [2018-01-31 09:40:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:36,498 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2018-01-31 09:40:36,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:40:36,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-31 09:40:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:36,503 INFO L225 Difference]: With dead ends: 157 [2018-01-31 09:40:36,503 INFO L226 Difference]: Without dead ends: 137 [2018-01-31 09:40:36,503 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:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-31 09:40:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2018-01-31 09:40:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-31 09:40:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-01-31 09:40:36,513 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 37 [2018-01-31 09:40:36,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:36,514 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-01-31 09:40:36,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:40:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-01-31 09:40:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 09:40:36,518 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:36,519 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:36,519 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:36,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1381672071, now seen corresponding path program 1 times [2018-01-31 09:40:36,519 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:36,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:36,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:36,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:36,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:36,534 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:36,600 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:36,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:36,600 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:36,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:36,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:36,723 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:36,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:36,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-31 09:40:36,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:40:36,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:40:36,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:40:36,749 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 7 states. [2018-01-31 09:40:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:36,961 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2018-01-31 09:40:36,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:40:36,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-31 09:40:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:36,963 INFO L225 Difference]: With dead ends: 149 [2018-01-31 09:40:36,963 INFO L226 Difference]: Without dead ends: 148 [2018-01-31 09:40:36,963 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:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-31 09:40:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2018-01-31 09:40:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-31 09:40:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2018-01-31 09:40:36,975 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 46 [2018-01-31 09:40:36,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:36,975 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2018-01-31 09:40:36,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:40:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2018-01-31 09:40:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 09:40:36,976 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:36,977 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:36,977 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:36,977 INFO L82 PathProgramCache]: Analyzing trace with hash -117838294, now seen corresponding path program 1 times [2018-01-31 09:40:36,977 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:36,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:36,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:36,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:36,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:36,995 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:37,374 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:37,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:37,375 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:37,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:37,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:37,406 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:37,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:40:37,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:40:37,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:40:37,523 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:37,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:37,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-01-31 09:40:37,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 09:40:37,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 09:40:37,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:40:37,544 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 13 states. [2018-01-31 09:40:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:37,974 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-01-31 09:40:38,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:40:38,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-01-31 09:40:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:38,017 INFO L225 Difference]: With dead ends: 148 [2018-01-31 09:40:38,018 INFO L226 Difference]: Without dead ends: 147 [2018-01-31 09:40:38,018 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-01-31 09:40:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-31 09:40:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2018-01-31 09:40:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-31 09:40:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2018-01-31 09:40:38,028 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 47 [2018-01-31 09:40:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:38,029 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2018-01-31 09:40:38,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 09:40:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2018-01-31 09:40:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 09:40:38,030 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:38,030 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:38,030 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:38,031 INFO L82 PathProgramCache]: Analyzing trace with hash 154524538, now seen corresponding path program 2 times [2018-01-31 09:40:38,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:38,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:38,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:38,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:38,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:38,040 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:38,142 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:38,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:38,142 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:38,148 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:40:38,155 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:38,160 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:38,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:38,225 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:38,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:40:38,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-01-31 09:40:38,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:40:38,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:40:38,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=100, Unknown=1, NotChecked=0, Total=132 [2018-01-31 09:40:38,260 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand 12 states. [2018-01-31 09:40:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:38,617 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2018-01-31 09:40:38,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:40:38,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-01-31 09:40:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:38,619 INFO L225 Difference]: With dead ends: 174 [2018-01-31 09:40:38,619 INFO L226 Difference]: Without dead ends: 143 [2018-01-31 09:40:38,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=363, Unknown=1, NotChecked=0, Total=506 [2018-01-31 09:40:38,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-31 09:40:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2018-01-31 09:40:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-31 09:40:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2018-01-31 09:40:38,632 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 47 [2018-01-31 09:40:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:38,632 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2018-01-31 09:40:38,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:40:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2018-01-31 09:40:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-31 09:40:38,634 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:38,634 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:38,634 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:38,634 INFO L82 PathProgramCache]: Analyzing trace with hash -739772656, now seen corresponding path program 2 times [2018-01-31 09:40:38,635 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:38,635 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:38,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:38,636 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:38,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:38,647 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:38,857 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:38,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:38,857 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:38,862 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:40:38,869 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:38,876 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:38,889 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:38,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:39,190 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:39,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:39,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2018-01-31 09:40:39,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 09:40:39,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 09:40:39,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-01-31 09:40:39,211 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand 25 states. [2018-01-31 09:40:40,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:40,319 INFO L93 Difference]: Finished difference Result 272 states and 299 transitions. [2018-01-31 09:40:40,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-31 09:40:40,319 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-01-31 09:40:40,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:40,320 INFO L225 Difference]: With dead ends: 272 [2018-01-31 09:40:40,320 INFO L226 Difference]: Without dead ends: 191 [2018-01-31 09:40:40,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 09:40:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-31 09:40:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2018-01-31 09:40:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-31 09:40:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 185 transitions. [2018-01-31 09:40:40,334 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 185 transitions. Word has length 55 [2018-01-31 09:40:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:40,335 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 185 transitions. [2018-01-31 09:40:40,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 09:40:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 185 transitions. [2018-01-31 09:40:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 09:40:40,336 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:40,336 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:40,336 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash 245732012, now seen corresponding path program 1 times [2018-01-31 09:40:40,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:40,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:40,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:40,338 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:40,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:40,345 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:40,725 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:40,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:40,725 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:40,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:40,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:41,016 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:40:41,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:41,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-01-31 09:40:41,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:40:41,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:40:41,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:40:41,041 INFO L87 Difference]: Start difference. First operand 170 states and 185 transitions. Second operand 15 states. [2018-01-31 09:40:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:41,235 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2018-01-31 09:40:41,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:40:41,236 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-01-31 09:40:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:41,237 INFO L225 Difference]: With dead ends: 209 [2018-01-31 09:40:41,237 INFO L226 Difference]: Without dead ends: 197 [2018-01-31 09:40:41,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-01-31 09:40:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-31 09:40:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 187. [2018-01-31 09:40:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-31 09:40:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2018-01-31 09:40:41,251 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 59 [2018-01-31 09:40:41,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:41,252 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2018-01-31 09:40:41,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:40:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2018-01-31 09:40:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-31 09:40:41,253 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:41,253 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:40:41,253 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:41,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1928929082, now seen corresponding path program 3 times [2018-01-31 09:40:41,254 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:41,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:41,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:41,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:41,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:41,266 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:41,380 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:40:41,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:41,380 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:40:41,387 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:40:41,394 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:40:41,397 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:40:41,398 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:41,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-31 09:40:41,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:41,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-01-31 09:40:41,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:40:41,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:40:41,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:40:41,537 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand 18 states. [2018-01-31 09:40:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:42,319 INFO L93 Difference]: Finished difference Result 225 states and 252 transitions. [2018-01-31 09:40:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 09:40:42,319 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-01-31 09:40:42,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:42,321 INFO L225 Difference]: With dead ends: 225 [2018-01-31 09:40:42,321 INFO L226 Difference]: Without dead ends: 224 [2018-01-31 09:40:42,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=929, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 09:40:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-31 09:40:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 186. [2018-01-31 09:40:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-31 09:40:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 203 transitions. [2018-01-31 09:40:42,337 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 203 transitions. Word has length 65 [2018-01-31 09:40:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:42,337 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 203 transitions. [2018-01-31 09:40:42,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:40:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 203 transitions. [2018-01-31 09:40:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 09:40:42,338 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:42,339 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:40:42,339 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash 332741067, now seen corresponding path program 2 times [2018-01-31 09:40:42,339 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:42,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:42,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:42,340 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:42,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:42,352 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:43,003 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 14 DAG size of output 9 [2018-01-31 09:40:43,146 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:40:43,146 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:43,146 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:40:43,151 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:40:43,159 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:43,166 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:43,167 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:43,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:43,172 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:43,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:40:43,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:40:43,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:40:43,542 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:40:43,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:43,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-01-31 09:40:43,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 09:40:43,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 09:40:43,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-01-31 09:40:43,563 INFO L87 Difference]: Start difference. First operand 186 states and 203 transitions. Second operand 23 states. [2018-01-31 09:40:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:44,560 INFO L93 Difference]: Finished difference Result 224 states and 250 transitions. [2018-01-31 09:40:44,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 09:40:44,560 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-01-31 09:40:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:44,562 INFO L225 Difference]: With dead ends: 224 [2018-01-31 09:40:44,562 INFO L226 Difference]: Without dead ends: 223 [2018-01-31 09:40:44,562 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 09:40:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-31 09:40:44,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 195. [2018-01-31 09:40:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-31 09:40:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-01-31 09:40:44,580 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 66 [2018-01-31 09:40:44,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:44,581 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-01-31 09:40:44,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 09:40:44,581 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-01-31 09:40:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-31 09:40:44,582 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:44,582 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:40:44,582 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:44,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1158666688, now seen corresponding path program 3 times [2018-01-31 09:40:44,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:44,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:44,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:44,584 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:44,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:44,604 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:45,107 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:40:45,107 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:45,107 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:40:45,114 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:40:45,122 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:40:45,126 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:40:45,129 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:40:45,130 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:45,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:45,136 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:45,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:40:45,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:40:45,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:40:45,491 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:40:45,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:45,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-31 09:40:45,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 09:40:45,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 09:40:45,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2018-01-31 09:40:45,512 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 29 states. [2018-01-31 09:40:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:46,130 INFO L93 Difference]: Finished difference Result 259 states and 281 transitions. [2018-01-31 09:40:46,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 09:40:46,131 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2018-01-31 09:40:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:46,133 INFO L225 Difference]: With dead ends: 259 [2018-01-31 09:40:46,133 INFO L226 Difference]: Without dead ends: 258 [2018-01-31 09:40:46,134 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=357, Invalid=1623, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 09:40:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-31 09:40:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 212. [2018-01-31 09:40:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-31 09:40:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 230 transitions. [2018-01-31 09:40:46,152 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 230 transitions. Word has length 75 [2018-01-31 09:40:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:46,152 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 230 transitions. [2018-01-31 09:40:46,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 09:40:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 230 transitions. [2018-01-31 09:40:46,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-31 09:40:46,154 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:46,154 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:40:46,154 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:46,154 INFO L82 PathProgramCache]: Analyzing trace with hash -337153039, now seen corresponding path program 2 times [2018-01-31 09:40:46,154 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:46,154 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:46,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:46,155 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:46,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:46,164 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:46,865 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:40:46,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:46,865 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) [2018-01-31 09:40:46,878 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:40:46,888 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:46,908 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:46,921 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:46,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:47,050 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:40:47,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:47,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 19 [2018-01-31 09:40:47,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 09:40:47,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 09:40:47,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:40:47,071 INFO L87 Difference]: Start difference. First operand 212 states and 230 transitions. Second operand 19 states. [2018-01-31 09:40:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:48,391 INFO L93 Difference]: Finished difference Result 250 states and 274 transitions. [2018-01-31 09:40:48,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 09:40:48,420 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-01-31 09:40:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:48,421 INFO L225 Difference]: With dead ends: 250 [2018-01-31 09:40:48,422 INFO L226 Difference]: Without dead ends: 210 [2018-01-31 09:40:48,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 09:40:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-31 09:40:48,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2018-01-31 09:40:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-31 09:40:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2018-01-31 09:40:48,439 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 76 [2018-01-31 09:40:48,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:48,439 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2018-01-31 09:40:48,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 09:40:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2018-01-31 09:40:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-31 09:40:48,440 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:48,440 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:40:48,440 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:48,440 INFO L82 PathProgramCache]: Analyzing trace with hash -448849674, now seen corresponding path program 4 times [2018-01-31 09:40:48,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:48,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:48,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:48,441 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:48,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:48,452 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:48,808 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:40:48,809 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:48,809 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:40:48,814 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:40:48,841 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:48,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:48,845 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:48,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:40:48,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:40:48,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:40:49,111 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:40:49,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:49,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-31 09:40:49,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 09:40:49,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 09:40:49,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-01-31 09:40:49,133 INFO L87 Difference]: Start difference. First operand 175 states and 190 transitions. Second operand 29 states. [2018-01-31 09:40:51,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:51,309 INFO L93 Difference]: Finished difference Result 366 states and 396 transitions. [2018-01-31 09:40:51,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-31 09:40:51,309 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-01-31 09:40:51,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:51,311 INFO L225 Difference]: With dead ends: 366 [2018-01-31 09:40:51,311 INFO L226 Difference]: Without dead ends: 365 [2018-01-31 09:40:51,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=763, Invalid=5557, Unknown=0, NotChecked=0, Total=6320 [2018-01-31 09:40:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-01-31 09:40:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 211. [2018-01-31 09:40:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-31 09:40:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 229 transitions. [2018-01-31 09:40:51,333 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 229 transitions. Word has length 85 [2018-01-31 09:40:51,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:51,334 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 229 transitions. [2018-01-31 09:40:51,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 09:40:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 229 transitions. [2018-01-31 09:40:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-31 09:40:51,335 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:51,335 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:40:51,336 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:51,336 INFO L82 PathProgramCache]: Analyzing trace with hash 36527359, now seen corresponding path program 5 times [2018-01-31 09:40:51,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:51,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:51,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:51,337 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:51,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:51,354 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,039 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:40:52,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:52,039 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:40:52,044 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 09:40:52,052 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:52,054 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:52,057 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:52,060 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:52,063 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:52,067 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:40:52,068 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:52,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:52,072 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:52,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:40:52,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:40:52,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:40:52,372 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:40:52,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:52,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-01-31 09:40:52,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-31 09:40:52,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-31 09:40:52,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 09:40:52,393 INFO L87 Difference]: Start difference. First operand 211 states and 229 transitions. Second operand 33 states. [2018-01-31 09:40:53,860 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 23 DAG size of output 20 [2018-01-31 09:40:54,690 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 35 DAG size of output 26 [2018-01-31 09:40:56,080 WARN L146 SmtUtils]: Spent 340ms on a formula simplification. DAG size of input: 24 DAG size of output 20 [2018-01-31 09:40:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:56,408 INFO L93 Difference]: Finished difference Result 500 states and 541 transitions. [2018-01-31 09:40:56,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-31 09:40:56,409 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-01-31 09:40:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:56,411 INFO L225 Difference]: With dead ends: 500 [2018-01-31 09:40:56,411 INFO L226 Difference]: Without dead ends: 499 [2018-01-31 09:40:56,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2424 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=934, Invalid=7622, Unknown=0, NotChecked=0, Total=8556 [2018-01-31 09:40:56,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-01-31 09:40:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 247. [2018-01-31 09:40:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-01-31 09:40:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 268 transitions. [2018-01-31 09:40:56,438 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 268 transitions. Word has length 104 [2018-01-31 09:40:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:56,439 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 268 transitions. [2018-01-31 09:40:56,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-31 09:40:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 268 transitions. [2018-01-31 09:40:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-31 09:40:56,440 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:56,440 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:40:56,441 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:56,441 INFO L82 PathProgramCache]: Analyzing trace with hash -382494782, now seen corresponding path program 6 times [2018-01-31 09:40:56,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:56,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:56,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:56,442 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:56,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:56,463 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:57,216 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:40:57,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:57,217 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) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:40:57,222 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 09:40:57,231 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:40:57,233 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:40:57,235 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:40:57,238 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:40:57,241 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:40:57,244 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:40:57,247 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:40:57,248 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:40:57,250 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:57,253 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:57,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:40:57,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:40:57,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:40:57,674 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:40:57,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:40:57,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2018-01-31 09:40:57,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-31 09:40:57,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-31 09:40:57,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2018-01-31 09:40:57,695 INFO L87 Difference]: Start difference. First operand 247 states and 268 transitions. Second operand 43 states. [2018-01-31 09:40:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:40:59,217 INFO L93 Difference]: Finished difference Result 455 states and 493 transitions. [2018-01-31 09:40:59,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-31 09:40:59,217 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 123 [2018-01-31 09:40:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:40:59,219 INFO L225 Difference]: With dead ends: 455 [2018-01-31 09:40:59,219 INFO L226 Difference]: Without dead ends: 454 [2018-01-31 09:40:59,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=736, Invalid=3956, Unknown=0, NotChecked=0, Total=4692 [2018-01-31 09:40:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-01-31 09:40:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 274. [2018-01-31 09:40:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-01-31 09:40:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 297 transitions. [2018-01-31 09:40:59,242 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 297 transitions. Word has length 123 [2018-01-31 09:40:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:40:59,243 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 297 transitions. [2018-01-31 09:40:59,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-31 09:40:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 297 transitions. [2018-01-31 09:40:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-01-31 09:40:59,244 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:40:59,245 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:40:59,245 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:40:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1091959176, now seen corresponding path program 7 times [2018-01-31 09:40:59,245 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:40:59,245 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:40:59,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:59,246 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:40:59,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:40:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:59,262 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,722 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:40:59,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:40:59,722 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:40:59,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:40:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:40:59,766 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:40:59,769 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:59,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:40:59,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:40:59,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:00,208 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:00,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:00,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-01-31 09:41:00,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-31 09:41:00,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-31 09:41:00,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 09:41:00,229 INFO L87 Difference]: Start difference. First operand 274 states and 297 transitions. Second operand 35 states. [2018-01-31 09:41:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:00,965 INFO L93 Difference]: Finished difference Result 653 states and 705 transitions. [2018-01-31 09:41:00,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 09:41:00,966 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2018-01-31 09:41:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:00,971 INFO L225 Difference]: With dead ends: 653 [2018-01-31 09:41:00,971 INFO L226 Difference]: Without dead ends: 652 [2018-01-31 09:41:00,972 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=493, Invalid=2477, Unknown=0, NotChecked=0, Total=2970 [2018-01-31 09:41:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-01-31 09:41:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 283. [2018-01-31 09:41:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-31 09:41:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 307 transitions. [2018-01-31 09:41:01,000 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 307 transitions. Word has length 133 [2018-01-31 09:41:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:01,000 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 307 transitions. [2018-01-31 09:41:01,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-31 09:41:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 307 transitions. [2018-01-31 09:41:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-31 09:41:01,001 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:01,002 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:01,002 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:01,004 INFO L82 PathProgramCache]: Analyzing trace with hash -501068749, now seen corresponding path program 8 times [2018-01-31 09:41:01,004 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:01,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:01,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:01,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:41:01,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:01,021 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:01,420 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 09:41:01,861 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:01,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:01,861 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:01,866 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:41:01,876 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:01,888 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:01,891 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:01,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:01,910 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:01,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:01,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:01,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:02,377 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:02,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:02,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 40 [2018-01-31 09:41:02,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-31 09:41:02,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-31 09:41:02,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1496, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 09:41:02,397 INFO L87 Difference]: Start difference. First operand 283 states and 307 transitions. Second operand 41 states. [2018-01-31 09:41:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:06,587 INFO L93 Difference]: Finished difference Result 840 states and 909 transitions. [2018-01-31 09:41:06,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-01-31 09:41:06,587 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 142 [2018-01-31 09:41:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:06,591 INFO L225 Difference]: With dead ends: 840 [2018-01-31 09:41:06,591 INFO L226 Difference]: Without dead ends: 839 [2018-01-31 09:41:06,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4238 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1342, Invalid=13178, Unknown=0, NotChecked=0, Total=14520 [2018-01-31 09:41:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-01-31 09:41:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 319. [2018-01-31 09:41:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-01-31 09:41:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 346 transitions. [2018-01-31 09:41:06,624 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 346 transitions. Word has length 142 [2018-01-31 09:41:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:06,624 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 346 transitions. [2018-01-31 09:41:06,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-31 09:41:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 346 transitions. [2018-01-31 09:41:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-31 09:41:06,626 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:06,626 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:06,626 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:06,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1765856626, now seen corresponding path program 9 times [2018-01-31 09:41:06,627 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:06,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:06,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:06,627 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:06,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:06,645 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:07,246 WARN L143 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 09:41:07,771 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:07,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:07,771 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:07,777 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:41:07,786 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:07,789 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:07,792 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:07,795 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:07,798 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:07,801 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:07,805 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:07,808 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:07,809 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:07,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:07,831 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:07,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:07,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:07,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:08,428 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:08,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:08,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-01-31 09:41:08,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-31 09:41:08,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-31 09:41:08,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1860, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 09:41:08,449 INFO L87 Difference]: Start difference. First operand 319 states and 346 transitions. Second operand 47 states. [2018-01-31 09:41:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:09,344 INFO L93 Difference]: Finished difference Result 480 states and 522 transitions. [2018-01-31 09:41:09,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 09:41:09,345 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 161 [2018-01-31 09:41:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:09,346 INFO L225 Difference]: With dead ends: 480 [2018-01-31 09:41:09,346 INFO L226 Difference]: Without dead ends: 479 [2018-01-31 09:41:09,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=790, Invalid=3902, Unknown=0, NotChecked=0, Total=4692 [2018-01-31 09:41:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-01-31 09:41:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 346. [2018-01-31 09:41:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-01-31 09:41:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 375 transitions. [2018-01-31 09:41:09,375 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 375 transitions. Word has length 161 [2018-01-31 09:41:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:09,376 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 375 transitions. [2018-01-31 09:41:09,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-31 09:41:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 375 transitions. [2018-01-31 09:41:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-01-31 09:41:09,377 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:09,378 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:09,378 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash -991764284, now seen corresponding path program 10 times [2018-01-31 09:41:09,378 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:09,378 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:09,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:09,379 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:09,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:09,405 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:10,406 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:10,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:10,406 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:10,411 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:41:10,441 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:10,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:10,447 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:10,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:10,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:10,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:11,092 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:11,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:11,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 48 [2018-01-31 09:41:11,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-31 09:41:11,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-31 09:41:11,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2156, Unknown=0, NotChecked=0, Total=2352 [2018-01-31 09:41:11,113 INFO L87 Difference]: Start difference. First operand 346 states and 375 transitions. Second operand 49 states. [2018-01-31 09:41:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:16,798 INFO L93 Difference]: Finished difference Result 1180 states and 1277 transitions. [2018-01-31 09:41:16,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-01-31 09:41:16,798 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 171 [2018-01-31 09:41:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:16,801 INFO L225 Difference]: With dead ends: 1180 [2018-01-31 09:41:16,801 INFO L226 Difference]: Without dead ends: 1179 [2018-01-31 09:41:16,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6098 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1726, Invalid=18580, Unknown=0, NotChecked=0, Total=20306 [2018-01-31 09:41:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-01-31 09:41:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 382. [2018-01-31 09:41:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-01-31 09:41:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 414 transitions. [2018-01-31 09:41:16,841 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 414 transitions. Word has length 171 [2018-01-31 09:41:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:16,842 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 414 transitions. [2018-01-31 09:41:16,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-31 09:41:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 414 transitions. [2018-01-31 09:41:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-31 09:41:16,844 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:16,844 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:16,844 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:16,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1859389809, now seen corresponding path program 11 times [2018-01-31 09:41:16,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:16,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:16,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:16,845 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:16,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:16,863 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,999 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:17,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:17,999 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) [2018-01-31 09:41:18,013 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:41:18,026 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:18,035 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:18,038 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:18,041 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:18,044 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:18,047 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:18,051 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:18,055 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:18,059 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:18,065 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:18,066 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:18,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:18,073 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:18,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:18,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:18,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:18,822 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:18,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:18,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 52 [2018-01-31 09:41:18,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-31 09:41:18,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-31 09:41:18,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2533, Unknown=0, NotChecked=0, Total=2756 [2018-01-31 09:41:18,843 INFO L87 Difference]: Start difference. First operand 382 states and 414 transitions. Second operand 53 states. [2018-01-31 09:41:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:25,492 INFO L93 Difference]: Finished difference Result 1422 states and 1539 transitions. [2018-01-31 09:41:25,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-01-31 09:41:25,493 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 190 [2018-01-31 09:41:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:25,497 INFO L225 Difference]: With dead ends: 1422 [2018-01-31 09:41:25,498 INFO L226 Difference]: Without dead ends: 1421 [2018-01-31 09:41:25,500 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7273 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1993, Invalid=22187, Unknown=0, NotChecked=0, Total=24180 [2018-01-31 09:41:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2018-01-31 09:41:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 418. [2018-01-31 09:41:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-01-31 09:41:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 453 transitions. [2018-01-31 09:41:25,545 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 453 transitions. Word has length 190 [2018-01-31 09:41:25,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:25,546 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 453 transitions. [2018-01-31 09:41:25,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-31 09:41:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 453 transitions. [2018-01-31 09:41:25,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-01-31 09:41:25,548 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:25,548 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:41:25,548 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash 967372560, now seen corresponding path program 12 times [2018-01-31 09:41:25,548 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:25,548 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:25,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:25,549 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:25,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:25,567 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:26,344 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:41:26,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:26,345 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:26,349 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 09:41:26,361 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:26,364 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:26,366 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:26,369 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:26,372 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:26,375 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:26,382 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:26,385 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:26,389 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:26,392 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:26,397 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:41:26,399 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:26,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:26,417 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,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:26,426 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,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:27,211 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:41:27,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:27,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 54 [2018-01-31 09:41:27,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-31 09:41:27,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-31 09:41:27,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2652, Unknown=0, NotChecked=0, Total=2970 [2018-01-31 09:41:27,232 INFO L87 Difference]: Start difference. First operand 418 states and 453 transitions. Second operand 55 states. [2018-01-31 09:41:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:33,290 INFO L93 Difference]: Finished difference Result 1688 states and 1827 transitions. [2018-01-31 09:41:33,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-01-31 09:41:33,291 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2018-01-31 09:41:33,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:33,295 INFO L225 Difference]: With dead ends: 1688 [2018-01-31 09:41:33,295 INFO L226 Difference]: Without dead ends: 1687 [2018-01-31 09:41:33,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8643 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4052, Invalid=24340, Unknown=0, NotChecked=0, Total=28392 [2018-01-31 09:41:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2018-01-31 09:41:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 454. [2018-01-31 09:41:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-01-31 09:41:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 492 transitions. [2018-01-31 09:41:33,349 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 492 transitions. Word has length 209 [2018-01-31 09:41:33,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:33,349 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 492 transitions. [2018-01-31 09:41:33,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-31 09:41:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 492 transitions. [2018-01-31 09:41:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-31 09:41:33,351 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:33,352 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:41:33,352 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash 989034789, now seen corresponding path program 13 times [2018-01-31 09:41:33,352 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:33,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:33,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:33,353 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:33,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:33,377 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,495 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:41:35,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:35,496 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:35,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:41:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:35,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:35,543 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:35,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:35,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:35,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:36,822 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:41:36,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:36,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 27] total 77 [2018-01-31 09:41:36,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-01-31 09:41:36,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-01-31 09:41:36,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=5604, Unknown=0, NotChecked=0, Total=6006 [2018-01-31 09:41:36,842 INFO L87 Difference]: Start difference. First operand 454 states and 492 transitions. Second operand 78 states. [2018-01-31 09:41:41,227 WARN L146 SmtUtils]: Spent 293ms on a formula simplification. DAG size of input: 36 DAG size of output 29 [2018-01-31 09:41:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:48,416 INFO L93 Difference]: Finished difference Result 1978 states and 2141 transitions. [2018-01-31 09:41:48,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-01-31 09:41:48,416 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 228 [2018-01-31 09:41:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:48,422 INFO L225 Difference]: With dead ends: 1978 [2018-01-31 09:41:48,422 INFO L226 Difference]: Without dead ends: 1977 [2018-01-31 09:41:48,425 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12382 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2729, Invalid=37071, Unknown=0, NotChecked=0, Total=39800 [2018-01-31 09:41:48,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-01-31 09:41:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 490. [2018-01-31 09:41:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-01-31 09:41:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 531 transitions. [2018-01-31 09:41:48,479 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 531 transitions. Word has length 228 [2018-01-31 09:41:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:48,479 INFO L432 AbstractCegarLoop]: Abstraction has 490 states and 531 transitions. [2018-01-31 09:41:48,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-01-31 09:41:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 531 transitions. [2018-01-31 09:41:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-01-31 09:41:48,482 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:48,482 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:48,482 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:48,482 INFO L82 PathProgramCache]: Analyzing trace with hash 492564828, now seen corresponding path program 14 times [2018-01-31 09:41:48,482 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:48,483 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:48,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:48,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:41:48,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:48,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:41:49,387 WARN L146 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 14 DAG size of output 9 [2018-01-31 09:41:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 642 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-01-31 09:41:50,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:50,152 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:50,157 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:41:50,169 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:50,193 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:41:50,197 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:50,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:50,218 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:50,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:50,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:50,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 642 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-01-31 09:41:51,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:51,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-01-31 09:41:51,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-01-31 09:41:51,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-01-31 09:41:51,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=2950, Unknown=0, NotChecked=0, Total=3422 [2018-01-31 09:41:51,152 INFO L87 Difference]: Start difference. First operand 490 states and 531 transitions. Second operand 59 states. [2018-01-31 09:41:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:41:53,858 INFO L93 Difference]: Finished difference Result 2105 states and 2277 transitions. [2018-01-31 09:41:53,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-31 09:41:53,858 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 247 [2018-01-31 09:41:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:41:53,863 INFO L225 Difference]: With dead ends: 2105 [2018-01-31 09:41:53,863 INFO L226 Difference]: Without dead ends: 2104 [2018-01-31 09:41:53,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2559 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1270, Invalid=8042, Unknown=0, NotChecked=0, Total=9312 [2018-01-31 09:41:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2018-01-31 09:41:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 499. [2018-01-31 09:41:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-01-31 09:41:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 541 transitions. [2018-01-31 09:41:53,929 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 541 transitions. Word has length 247 [2018-01-31 09:41:53,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:41:53,930 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 541 transitions. [2018-01-31 09:41:53,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-01-31 09:41:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 541 transitions. [2018-01-31 09:41:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-01-31 09:41:53,932 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:41:53,932 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:41:53,932 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:41:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash -442474033, now seen corresponding path program 15 times [2018-01-31 09:41:53,933 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:41:53,933 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:41:53,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:53,934 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:41:53,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:41:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:41:53,958 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:54,851 WARN L146 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 14 DAG size of output 9 [2018-01-31 09:41:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 0 proven. 754 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-01-31 09:41:55,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:41:55,666 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:55,673 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:41:55,692 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,711 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,722 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,735 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,755 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,766 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,780 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,799 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,815 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,826 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,840 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,854 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,868 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:41:55,878 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:41:55,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:41:55,906 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:55,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:41:55,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:41:55,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:41:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 86 proven. 734 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2018-01-31 09:41:57,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:41:57,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 64 [2018-01-31 09:41:57,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-01-31 09:41:57,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-01-31 09:41:57,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=3750, Unknown=0, NotChecked=0, Total=4160 [2018-01-31 09:41:57,652 INFO L87 Difference]: Start difference. First operand 499 states and 541 transitions. Second operand 65 states. [2018-01-31 09:42:02,553 WARN L146 SmtUtils]: Spent 353ms on a formula simplification. DAG size of input: 36 DAG size of output 25 [2018-01-31 09:42:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:06,556 INFO L93 Difference]: Finished difference Result 2436 states and 2637 transitions. [2018-01-31 09:42:06,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-01-31 09:42:06,557 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 256 [2018-01-31 09:42:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:06,564 INFO L225 Difference]: With dead ends: 2436 [2018-01-31 09:42:06,564 INFO L226 Difference]: Without dead ends: 2435 [2018-01-31 09:42:06,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12802 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=4787, Invalid=32269, Unknown=0, NotChecked=0, Total=37056 [2018-01-31 09:42:06,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2018-01-31 09:42:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 535. [2018-01-31 09:42:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-01-31 09:42:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 580 transitions. [2018-01-31 09:42:06,639 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 580 transitions. Word has length 256 [2018-01-31 09:42:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:06,640 INFO L432 AbstractCegarLoop]: Abstraction has 535 states and 580 transitions. [2018-01-31 09:42:06,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-01-31 09:42:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 580 transitions. [2018-01-31 09:42:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-01-31 09:42:06,642 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:06,642 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:06,643 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:06,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1409688846, now seen corresponding path program 16 times [2018-01-31 09:42:06,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:06,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:06,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:06,644 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:42:06,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:06,668 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:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 0 proven. 875 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2018-01-31 09:42:07,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:08,000 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:42:08,006 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:42:08,056 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:42:08,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:08,078 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:08,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:42:08,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:42:08,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:42:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 0 proven. 875 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2018-01-31 09:42:09,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:09,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 64 [2018-01-31 09:42:09,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-01-31 09:42:09,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-01-31 09:42:09,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=3578, Unknown=0, NotChecked=0, Total=4160 [2018-01-31 09:42:09,210 INFO L87 Difference]: Start difference. First operand 535 states and 580 transitions. Second operand 65 states. [2018-01-31 09:42:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:12,007 INFO L93 Difference]: Finished difference Result 2575 states and 2786 transitions. [2018-01-31 09:42:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-31 09:42:12,007 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 275 [2018-01-31 09:42:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:12,015 INFO L225 Difference]: With dead ends: 2575 [2018-01-31 09:42:12,015 INFO L226 Difference]: Without dead ends: 2574 [2018-01-31 09:42:12,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3450 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1517, Invalid=10473, Unknown=0, NotChecked=0, Total=11990 [2018-01-31 09:42:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2018-01-31 09:42:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 544. [2018-01-31 09:42:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-01-31 09:42:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 590 transitions. [2018-01-31 09:42:12,091 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 590 transitions. Word has length 275 [2018-01-31 09:42:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:12,091 INFO L432 AbstractCegarLoop]: Abstraction has 544 states and 590 transitions. [2018-01-31 09:42:12,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-01-31 09:42:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 590 transitions. [2018-01-31 09:42:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-01-31 09:42:12,094 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:12,094 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:12,094 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1923145977, now seen corresponding path program 17 times [2018-01-31 09:42:12,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:12,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:12,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:12,096 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:42:12,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:12,119 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:13,130 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 14 DAG size of output 9 [2018-01-31 09:42:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1837 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2018-01-31 09:42:14,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:14,077 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:14,083 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 09:42:14,096 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,098 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,100 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,103 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,106 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,109 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,112 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,115 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,119 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,124 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,129 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,134 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,140 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,147 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,155 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,165 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:14,166 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:42:14,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1837 backedges. 1005 proven. 832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:42:17,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:17,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 62] total 97 [2018-01-31 09:42:17,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-01-31 09:42:17,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-01-31 09:42:17,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=815, Invalid=8497, Unknown=0, NotChecked=0, Total=9312 [2018-01-31 09:42:17,440 INFO L87 Difference]: Start difference. First operand 544 states and 590 transitions. Second operand 97 states. Received shutdown request... [2018-01-31 09:42:19,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-31 09:42:19,990 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 09:42:19,993 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 09:42:19,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:42:19 BasicIcfg [2018-01-31 09:42:19,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:42:19,997 INFO L168 Benchmark]: Toolchain (without parser) took 124239.79 ms. Allocated memory was 306.2 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 264.9 MB in the beginning and 696.6 MB in the end (delta: -431.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-31 09:42:19,997 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:42:19,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.61 ms. Allocated memory is still 306.2 MB. Free memory was 262.9 MB in the beginning and 255.0 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:19,998 INFO L168 Benchmark]: Boogie Preprocessor took 54.10 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 253.0 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:19,998 INFO L168 Benchmark]: RCFGBuilder took 497.88 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 236.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:19,999 INFO L168 Benchmark]: IcfgTransformer took 14010.65 ms. Allocated memory was 306.2 MB in the beginning and 1.1 GB in the end (delta: 813.2 MB). Free memory was 236.0 MB in the beginning and 172.6 MB in the end (delta: 63.4 MB). Peak memory consumption was 876.5 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:19,999 INFO L168 Benchmark]: TraceAbstraction took 109398.02 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 978.8 MB). Free memory was 172.6 MB in the beginning and 696.6 MB in the end (delta: -523.9 MB). Peak memory consumption was 454.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:20,003 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.18 ms. Allocated memory is still 306.2 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 256.61 ms. Allocated memory is still 306.2 MB. Free memory was 262.9 MB in the beginning and 255.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 54.10 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 497.88 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 236.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 14010.65 ms. Allocated memory was 306.2 MB in the beginning and 1.1 GB in the end (delta: 813.2 MB). Free memory was 236.0 MB in the beginning and 172.6 MB in the end (delta: 63.4 MB). Peak memory consumption was 876.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 109398.02 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 978.8 MB). Free memory was 172.6 MB in the beginning and 696.6 MB in the end (delta: -523.9 MB). Peak memory consumption was 454.9 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) : 2.416012 RENAME_VARIABLES(MILLISECONDS) : 0.334359 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.383598 PROJECTAWAY(MILLISECONDS) : 0.481174 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.076324 DISJOIN(MILLISECONDS) : 0.353877 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.360941 ADD_EQUALITY(MILLISECONDS) : 0.026174 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.042624 #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 (544states) and interpolant automaton (currently 40 states, 97 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 134 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 (544states) and interpolant automaton (currently 40 states, 97 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 134 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 (544states) and interpolant automaton (currently 40 states, 97 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 134 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 (544states) and interpolant automaton (currently 40 states, 97 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 134 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 (544states) and interpolant automaton (currently 40 states, 97 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 134 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 (544states) and interpolant automaton (currently 40 states, 97 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 134 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. TIMEOUT Result, 109.2s OverallTime, 32 OverallIterations, 16 TraceHistogramMax, 69.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1779 SDtfs, 14389 SDslu, 27881 SDs, 0 SdLazy, 47778 SolverSat, 3153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4875 GetRequests, 2863 SyntacticMatches, 13 SemanticMatches, 1998 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72164 ImplicationChecksByTransitivity, 65.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=31, 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.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 12013 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 35.7s InterpolantComputationTime, 6647 NumberOfCodeBlocks, 6553 NumberOfCodeBlocksAsserted, 136 NumberOfCheckSat, 6587 ConstructedInterpolants, 2 QuantifiedInterpolants, 11959783 SizeOfPredicates, 403 NumberOfNonLiveVariables, 5270 ConjunctsInSsa, 787 ConjunctsInUnsatCore, 60 InterpolantComputations, 7 PerfectInterpolantSequences, 11985/24294 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-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-42-20-021.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-42-20-021.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-42-20-021.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-42-20-021.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-42-20-021.csv Completed graceful shutdown