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/memsafety/960521-1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 10:00:45,369 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 10:00:45,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 10:00:45,392 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 10:00:45,392 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 10:00:45,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 10:00:45,394 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 10:00:45,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 10:00:45,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 10:00:45,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 10:00:45,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 10:00:45,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 10:00:45,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 10:00:45,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 10:00:45,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 10:00:45,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 10:00:45,412 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 10:00:45,413 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 10:00:45,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 10:00:45,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 10:00:45,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 10:00:45,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 10:00:45,419 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 10:00:45,420 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 10:00:45,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 10:00:45,422 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 10:00:45,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 10:00:45,423 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 10:00:45,423 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 10:00:45,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 10:00:45,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 10:00:45,425 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 10:00:45,435 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 10:00:45,436 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 10:00:45,436 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 10:00:45,437 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 10:00:45,437 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 10:00:45,437 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 10:00:45,437 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 10:00:45,438 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 10:00:45,438 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 10:00:45,438 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 10:00:45,438 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 10:00:45,438 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 10:00:45,439 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 10:00:45,439 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 10:00:45,439 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 10:00:45,439 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 10:00:45,439 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 10:00:45,440 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 10:00:45,440 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 10:00:45,440 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 10:00:45,440 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 10:00:45,440 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 10:00:45,440 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 10:00:45,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 10:00:45,441 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 10:00:45,441 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 10:00:45,441 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 10:00:45,441 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 10:00:45,442 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 10:00:45,442 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 10:00:45,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 10:00:45,442 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 10:00:45,443 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 10:00:45,443 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 10:00:45,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 10:00:45,507 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 10:00:45,511 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 10:00:45,513 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 10:00:45,514 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 10:00:45,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_true-valid-memsafety.i [2018-01-31 10:00:45,678 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 10:00:45,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 10:00:45,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 10:00:45,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 10:00:45,699 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 10:00:45,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:00:45" (1/1) ... [2018-01-31 10:00:45,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21155711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:45, skipping insertion in model container [2018-01-31 10:00:45,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:00:45" (1/1) ... [2018-01-31 10:00:45,725 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 10:00:45,781 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 10:00:45,958 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 10:00:45,982 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 10:00:45,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:45 WrapperNode [2018-01-31 10:00:45,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 10:00:45,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 10:00:45,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 10:00:45,993 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 10:00:46,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:45" (1/1) ... [2018-01-31 10:00:46,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:45" (1/1) ... [2018-01-31 10:00:46,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:45" (1/1) ... [2018-01-31 10:00:46,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:45" (1/1) ... [2018-01-31 10:00:46,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:45" (1/1) ... [2018-01-31 10:00:46,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:45" (1/1) ... [2018-01-31 10:00:46,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:45" (1/1) ... [2018-01-31 10:00:46,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 10:00:46,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 10:00:46,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 10:00:46,041 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 10:00:46,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:45" (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 10:00:46,110 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 10:00:46,111 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 10:00:46,111 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 10:00:46,111 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 10:00:46,111 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 10:00:46,111 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 10:00:46,111 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 10:00:46,112 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 10:00:46,112 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 10:00:46,112 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 10:00:46,112 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 10:00:46,112 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 10:00:46,112 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 10:00:46,113 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 10:00:46,113 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 10:00:46,591 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 10:00:46,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:00:46 BoogieIcfgContainer [2018-01-31 10:00:46,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 10:00:46,593 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 10:00:46,593 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 10:00:46,594 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 10:00:46,600 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:00:46" (1/1) ... [2018-01-31 10:00:46,611 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 10:00:46,612 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 10:00:46,613 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 10:00:46,674 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 13 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 10:00:46,717 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 10:00:46,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 10:01:07,484 INFO L314 AbstractInterpreter]: Visited 73 different actions 193 times. Merged at 33 different actions 84 times. Widened at 1 different actions 3 times. Found 11 fixpoints after 5 different actions. Largest state had 67 variables. [2018-01-31 10:01:07,487 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 10:01:07,501 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4 [2018-01-31 10:01:07,501 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 10:01:07,502 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 10:01:07,502 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_2| v_~b.base_2), at (SUMMARY for call write~int(-1, ~b.base, ~b.offset + ~i~3 * 4, 4); srcloc: L627)) ((select (select |v_#memory_int_11| v_~b.base_18) (+ v_~b.offset_16 (- 4))), at (SUMMARY for call #t~mem8 := read~int(~b.base, ~b.offset + -4, 4); srcloc: L635')) ((select |v_#memory_int_4| v_~a.base_2), at (SUMMARY for call write~int(-1, ~a.base, ~a.offset + ~i~3 * 4, 4); srcloc: L625)) ((select |v_#memory_int_8| |v_main_#t~post6.base_3|), at (SUMMARY for call write~int(0, #t~post6.base, #t~post6.offset, 4); srcloc: L634'')) [2018-01-31 10:01:07,515 INFO L547 PartitionManager]: partitioning result: [2018-01-31 10:01:07,515 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 10:01:07,516 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 10:01:07,516 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 4 [2018-01-31 10:01:07,516 INFO L564 PartitionManager]: # location blocks :3 [2018-01-31 10:01:07,516 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 10:01:07,516 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-31 10:01:07,517 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 10:01:07,517 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 10:01:07,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 10:01:07 BasicIcfg [2018-01-31 10:01:07,550 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 10:01:07,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 10:01:07,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 10:01:07,554 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 10:01:07,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 10:00:45" (1/4) ... [2018-01-31 10:01:07,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f51ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:01:07, skipping insertion in model container [2018-01-31 10:01:07,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:45" (2/4) ... [2018-01-31 10:01:07,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f51ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:01:07, skipping insertion in model container [2018-01-31 10:01:07,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:00:46" (3/4) ... [2018-01-31 10:01:07,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f51ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 10:01:07, skipping insertion in model container [2018-01-31 10:01:07,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 10:01:07" (4/4) ... [2018-01-31 10:01:07,562 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 10:01:07,572 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 10:01:07,584 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-31 10:01:07,736 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 10:01:07,736 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 10:01:07,736 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 10:01:07,736 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 10:01:07,736 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 10:01:07,737 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 10:01:07,737 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 10:01:07,738 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 10:01:07,739 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 10:01:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-31 10:01:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-31 10:01:07,759 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:07,760 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:07,760 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:07,764 INFO L82 PathProgramCache]: Analyzing trace with hash 506698167, now seen corresponding path program 1 times [2018-01-31 10:01:07,767 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:07,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:07,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:07,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:07,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:07,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:08,083 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 10:01:08,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:08,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 10:01:08,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 10:01:08,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 10:01:08,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 10:01:08,097 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 5 states. [2018-01-31 10:01:08,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:08,560 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-01-31 10:01:08,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 10:01:08,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-31 10:01:08,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:08,572 INFO L225 Difference]: With dead ends: 99 [2018-01-31 10:01:08,573 INFO L226 Difference]: Without dead ends: 60 [2018-01-31 10:01:08,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-31 10:01:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-31 10:01:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-31 10:01:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-31 10:01:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-31 10:01:08,615 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 10 [2018-01-31 10:01:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:08,616 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-31 10:01:08,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 10:01:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-31 10:01:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-31 10:01:08,617 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:08,617 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:08,617 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash 506698169, now seen corresponding path program 1 times [2018-01-31 10:01:08,618 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:08,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:08,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:08,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:08,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:08,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:08,925 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 10:01:08,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:08,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 10:01:08,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 10:01:08,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 10:01:08,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 10:01:08,941 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-01-31 10:01:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:09,205 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-01-31 10:01:09,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 10:01:09,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-01-31 10:01:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:09,209 INFO L225 Difference]: With dead ends: 60 [2018-01-31 10:01:09,209 INFO L226 Difference]: Without dead ends: 59 [2018-01-31 10:01:09,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-31 10:01:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-31 10:01:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-31 10:01:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-31 10:01:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-01-31 10:01:09,220 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 10 [2018-01-31 10:01:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:09,221 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-01-31 10:01:09,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 10:01:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-01-31 10:01:09,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-31 10:01:09,222 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:09,222 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:09,222 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1764679198, now seen corresponding path program 1 times [2018-01-31 10:01:09,222 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:09,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:09,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:09,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:09,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:09,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:09,849 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 10:01:09,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:09,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 10:01:09,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 10:01:09,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 10:01:09,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 10:01:09,850 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 8 states. [2018-01-31 10:01:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:10,046 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-01-31 10:01:10,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 10:01:10,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-01-31 10:01:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:10,048 INFO L225 Difference]: With dead ends: 62 [2018-01-31 10:01:10,048 INFO L226 Difference]: Without dead ends: 58 [2018-01-31 10:01:10,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-31 10:01:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-31 10:01:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-31 10:01:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-31 10:01:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-01-31 10:01:10,055 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 13 [2018-01-31 10:01:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:10,056 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-01-31 10:01:10,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 10:01:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-01-31 10:01:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 10:01:10,057 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:10,057 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:10,057 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1158056983, now seen corresponding path program 1 times [2018-01-31 10:01:10,057 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:10,057 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:10,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:10,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:10,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:10,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:10,222 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 10:01:10,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:10,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 10:01:10,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 10:01:10,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 10:01:10,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 10:01:10,223 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 4 states. [2018-01-31 10:01:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:10,305 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-01-31 10:01:10,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 10:01:10,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-31 10:01:10,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:10,307 INFO L225 Difference]: With dead ends: 62 [2018-01-31 10:01:10,307 INFO L226 Difference]: Without dead ends: 60 [2018-01-31 10:01:10,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 10:01:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-31 10:01:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-01-31 10:01:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-31 10:01:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-31 10:01:10,313 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-01-31 10:01:10,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:10,313 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-31 10:01:10,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 10:01:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-31 10:01:10,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 10:01:10,314 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:10,314 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:10,314 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:10,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1158056981, now seen corresponding path program 1 times [2018-01-31 10:01:10,315 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:10,315 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:10,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:10,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:10,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:10,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:10,447 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 10:01:10,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:10,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 10:01:10,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 10:01:10,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 10:01:10,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-31 10:01:10,448 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 7 states. [2018-01-31 10:01:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:10,583 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-01-31 10:01:10,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 10:01:10,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-31 10:01:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:10,584 INFO L225 Difference]: With dead ends: 56 [2018-01-31 10:01:10,584 INFO L226 Difference]: Without dead ends: 53 [2018-01-31 10:01:10,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-31 10:01:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-31 10:01:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-31 10:01:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-31 10:01:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-31 10:01:10,591 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 16 [2018-01-31 10:01:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:10,591 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-31 10:01:10,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 10:01:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-31 10:01:10,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 10:01:10,592 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:10,592 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:10,592 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1477104900, now seen corresponding path program 1 times [2018-01-31 10:01:10,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:10,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:10,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:10,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:10,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:10,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:10,798 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 10:01:10,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:10,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 10:01:10,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 10:01:10,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 10:01:10,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 10:01:10,800 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 7 states. [2018-01-31 10:01:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:10,980 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-31 10:01:10,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 10:01:10,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-31 10:01:10,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:10,981 INFO L225 Difference]: With dead ends: 90 [2018-01-31 10:01:10,981 INFO L226 Difference]: Without dead ends: 64 [2018-01-31 10:01:10,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-31 10:01:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-31 10:01:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-01-31 10:01:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-31 10:01:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-01-31 10:01:10,987 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 17 [2018-01-31 10:01:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:10,988 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-01-31 10:01:10,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 10:01:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-01-31 10:01:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 10:01:10,989 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:10,989 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:10,989 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1540027782, now seen corresponding path program 1 times [2018-01-31 10:01:10,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:10,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:10,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:10,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:10,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:11,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:11,108 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 10:01:11,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:11,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 10:01:11,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 10:01:11,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 10:01:11,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 10:01:11,109 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 8 states. [2018-01-31 10:01:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:11,373 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-01-31 10:01:11,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 10:01:11,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-31 10:01:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:11,375 INFO L225 Difference]: With dead ends: 58 [2018-01-31 10:01:11,375 INFO L226 Difference]: Without dead ends: 56 [2018-01-31 10:01:11,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-01-31 10:01:11,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-31 10:01:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-31 10:01:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-31 10:01:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-31 10:01:11,381 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 17 [2018-01-31 10:01:11,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:11,382 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-31 10:01:11,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 10:01:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-31 10:01:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 10:01:11,383 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:11,383 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:11,383 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:11,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1540027784, now seen corresponding path program 1 times [2018-01-31 10:01:11,383 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:11,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:11,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:11,384 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:11,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:11,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:11,556 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 10:01:11,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:11,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 10:01:11,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 10:01:11,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 10:01:11,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 10:01:11,557 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 8 states. [2018-01-31 10:01:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:11,691 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-01-31 10:01:11,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 10:01:11,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-31 10:01:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:11,692 INFO L225 Difference]: With dead ends: 64 [2018-01-31 10:01:11,692 INFO L226 Difference]: Without dead ends: 60 [2018-01-31 10:01:11,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-01-31 10:01:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-31 10:01:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-01-31 10:01:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-31 10:01:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-31 10:01:11,699 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 17 [2018-01-31 10:01:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:11,699 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-31 10:01:11,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 10:01:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-31 10:01:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 10:01:11,700 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:11,700 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:11,700 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:11,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1539966088, now seen corresponding path program 1 times [2018-01-31 10:01:11,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:11,701 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:11,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:11,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:11,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:11,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:11,825 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 10:01:11,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:11,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 10:01:11,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 10:01:11,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 10:01:11,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 10:01:11,826 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 8 states. [2018-01-31 10:01:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:11,903 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-01-31 10:01:11,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 10:01:11,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-31 10:01:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:11,904 INFO L225 Difference]: With dead ends: 58 [2018-01-31 10:01:11,904 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 10:01:11,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-01-31 10:01:11,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 10:01:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-01-31 10:01:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-31 10:01:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-31 10:01:11,911 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 17 [2018-01-31 10:01:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:11,911 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-31 10:01:11,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 10:01:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-31 10:01:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 10:01:11,912 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:11,913 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 10:01:11,913 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:11,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1856317538, now seen corresponding path program 1 times [2018-01-31 10:01:11,913 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:11,913 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:11,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:11,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:11,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:11,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:12,257 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 19 DAG size of output 9 [2018-01-31 10:01:12,431 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 10:01:12,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:12,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 10:01:12,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 10:01:12,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 10:01:12,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-31 10:01:12,432 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 9 states. [2018-01-31 10:01:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:12,788 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-31 10:01:12,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 10:01:12,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-31 10:01:12,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:12,789 INFO L225 Difference]: With dead ends: 51 [2018-01-31 10:01:12,790 INFO L226 Difference]: Without dead ends: 41 [2018-01-31 10:01:12,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-01-31 10:01:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-31 10:01:12,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-01-31 10:01:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-31 10:01:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-01-31 10:01:12,796 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 19 [2018-01-31 10:01:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:12,796 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-01-31 10:01:12,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 10:01:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-01-31 10:01:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 10:01:12,797 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:12,797 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] [2018-01-31 10:01:12,797 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:12,797 INFO L82 PathProgramCache]: Analyzing trace with hash -338906570, now seen corresponding path program 1 times [2018-01-31 10:01:12,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:12,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:12,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:12,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:12,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:12,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:13,058 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 10:01:13,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 10:01:13,058 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 10:01:13,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:13,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 10:01:13,148 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 8 treesize of output 7 [2018-01-31 10:01:13,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 10:01:13,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 10:01:13,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-31 10:01:13,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 15 [2018-01-31 10:01:13,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 10:01:13,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 10:01:13,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-01-31 10:01:13,714 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 10:01:13,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 10:01:13,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-01-31 10:01:13,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 10:01:13,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 10:01:13,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-31 10:01:13,742 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 15 states. [2018-01-31 10:01:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:14,422 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-01-31 10:01:14,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 10:01:14,484 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-01-31 10:01:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:14,484 INFO L225 Difference]: With dead ends: 62 [2018-01-31 10:01:14,485 INFO L226 Difference]: Without dead ends: 53 [2018-01-31 10:01:14,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-01-31 10:01:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-31 10:01:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2018-01-31 10:01:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-31 10:01:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-01-31 10:01:14,491 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 23 [2018-01-31 10:01:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:14,491 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-01-31 10:01:14,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 10:01:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-01-31 10:01:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 10:01:14,493 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:14,493 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:14,493 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:14,493 INFO L82 PathProgramCache]: Analyzing trace with hash 399271408, now seen corresponding path program 2 times [2018-01-31 10:01:14,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:14,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:14,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:14,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:14,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:14,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 10:01:14,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 10:01:14,841 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 10:01:14,846 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 10:01:14,861 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:14,865 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:14,866 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 10:01:14,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 10:01:14,874 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 8 treesize of output 7 [2018-01-31 10:01:14,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 10:01:14,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 10:01:14,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 10:01:15,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 15 [2018-01-31 10:01:15,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 10:01:15,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 10:01:15,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-31 10:01:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 10:01:15,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 10:01:15,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-01-31 10:01:15,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 10:01:15,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 10:01:15,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-01-31 10:01:15,183 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 19 states. [2018-01-31 10:01:16,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:16,017 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-31 10:01:16,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 10:01:16,017 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2018-01-31 10:01:16,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:16,017 INFO L225 Difference]: With dead ends: 67 [2018-01-31 10:01:16,018 INFO L226 Difference]: Without dead ends: 58 [2018-01-31 10:01:16,018 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=227, Invalid=895, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 10:01:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-31 10:01:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-01-31 10:01:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-31 10:01:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-01-31 10:01:16,026 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 29 [2018-01-31 10:01:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:16,027 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-01-31 10:01:16,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 10:01:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-01-31 10:01:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 10:01:16,028 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:16,028 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:16,028 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:16,029 INFO L82 PathProgramCache]: Analyzing trace with hash 759308515, now seen corresponding path program 1 times [2018-01-31 10:01:16,029 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:16,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:16,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:16,030 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 10:01:16,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:16,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 10:01:16,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 10:01:16,178 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) [2018-01-31 10:01:16,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 10:01:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:16,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 10:01:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 10:01:16,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 10:01:16,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-31 10:01:16,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 10:01:16,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 10:01:16,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-31 10:01:16,326 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 17 states. [2018-01-31 10:01:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:16,718 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-01-31 10:01:16,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 10:01:16,719 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-01-31 10:01:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:16,720 INFO L225 Difference]: With dead ends: 72 [2018-01-31 10:01:16,720 INFO L226 Difference]: Without dead ends: 64 [2018-01-31 10:01:16,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-01-31 10:01:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-31 10:01:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-01-31 10:01:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-31 10:01:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-01-31 10:01:16,736 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 38 [2018-01-31 10:01:16,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:16,737 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-01-31 10:01:16,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 10:01:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-01-31 10:01:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-31 10:01:16,738 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:16,738 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:16,738 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2055126551, now seen corresponding path program 2 times [2018-01-31 10:01:16,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:16,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:16,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:16,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:16,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:16,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 10:01:17,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 10:01:17,208 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 10:01:17,215 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 10:01:17,229 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:17,241 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 10:01:17,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 10:01:17,260 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 8 treesize of output 7 [2018-01-31 10:01:17,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 10:01:17,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 10:01:17,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-31 10:01:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-31 10:01:17,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 10:01:17,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2018-01-31 10:01:17,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 10:01:17,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 10:01:17,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-01-31 10:01:17,803 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 19 states. [2018-01-31 10:01:18,453 WARN L143 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 29 [2018-01-31 10:01:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:19,065 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-31 10:01:19,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 10:01:19,066 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-01-31 10:01:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:19,067 INFO L225 Difference]: With dead ends: 77 [2018-01-31 10:01:19,067 INFO L226 Difference]: Without dead ends: 69 [2018-01-31 10:01:19,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 10:01:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-31 10:01:19,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-01-31 10:01:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 10:01:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-01-31 10:01:19,075 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 44 [2018-01-31 10:01:19,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:19,075 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-01-31 10:01:19,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 10:01:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-01-31 10:01:19,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 10:01:19,076 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:19,076 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:19,076 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:19,077 INFO L82 PathProgramCache]: Analyzing trace with hash -982255749, now seen corresponding path program 1 times [2018-01-31 10:01:19,077 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:19,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:19,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:19,078 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 10:01:19,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:19,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 10:01:19,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 10:01:19,336 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 10:01:19,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:19,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 10:01:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 10:01:19,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 10:01:19,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-01-31 10:01:19,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 10:01:19,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 10:01:19,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-01-31 10:01:19,651 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 25 states. [2018-01-31 10:01:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:19,984 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-01-31 10:01:19,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 10:01:19,984 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-01-31 10:01:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:19,985 INFO L225 Difference]: With dead ends: 86 [2018-01-31 10:01:19,985 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 10:01:19,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=830, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 10:01:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 10:01:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-01-31 10:01:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-31 10:01:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-01-31 10:01:20,006 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 56 [2018-01-31 10:01:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:20,006 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-01-31 10:01:20,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 10:01:20,006 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-01-31 10:01:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 10:01:20,007 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:20,007 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:20,008 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:20,008 INFO L82 PathProgramCache]: Analyzing trace with hash -192208127, now seen corresponding path program 2 times [2018-01-31 10:01:20,016 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:20,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:20,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:20,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:20,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:20,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 10:01:20,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 10:01:20,513 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 10:01:20,518 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 10:01:20,530 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:20,538 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:20,543 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 10:01:20,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 10:01:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 10:01:20,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 10:01:20,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-31 10:01:20,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 10:01:20,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 10:01:20,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-31 10:01:20,758 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 29 states. [2018-01-31 10:01:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:21,056 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-01-31 10:01:21,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 10:01:21,056 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-01-31 10:01:21,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:21,057 INFO L225 Difference]: With dead ends: 92 [2018-01-31 10:01:21,057 INFO L226 Difference]: Without dead ends: 81 [2018-01-31 10:01:21,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 10:01:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-31 10:01:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-01-31 10:01:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 10:01:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-01-31 10:01:21,067 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 62 [2018-01-31 10:01:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:21,067 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-01-31 10:01:21,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 10:01:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-01-31 10:01:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-31 10:01:21,068 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:21,068 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:21,069 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1831267833, now seen corresponding path program 3 times [2018-01-31 10:01:21,069 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:21,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:21,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:21,070 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 10:01:21,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:21,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 10:01:21,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 10:01:21,282 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 10:01:21,287 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 10:01:21,302 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 10:01:21,306 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 10:01:21,307 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 10:01:21,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 10:01:21,320 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 8 treesize of output 7 [2018-01-31 10:01:21,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 10:01:21,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 10:01:21,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-31 10:01:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-01-31 10:01:21,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 10:01:21,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2018-01-31 10:01:21,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 10:01:21,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 10:01:21,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2018-01-31 10:01:21,717 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 25 states. [2018-01-31 10:01:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:23,206 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-01-31 10:01:23,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-31 10:01:23,206 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 68 [2018-01-31 10:01:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:23,207 INFO L225 Difference]: With dead ends: 104 [2018-01-31 10:01:23,207 INFO L226 Difference]: Without dead ends: 93 [2018-01-31 10:01:23,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=2340, Unknown=0, NotChecked=0, Total=2970 [2018-01-31 10:01:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-31 10:01:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2018-01-31 10:01:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 10:01:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-01-31 10:01:23,217 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 68 [2018-01-31 10:01:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:23,218 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-01-31 10:01:23,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 10:01:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-01-31 10:01:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-31 10:01:23,220 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:23,220 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:23,220 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:23,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1997240551, now seen corresponding path program 4 times [2018-01-31 10:01:23,220 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:23,220 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:23,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:23,221 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 10:01:23,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:23,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-31 10:01:23,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 10:01:23,550 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 10:01:23,559 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 10:01:23,590 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 10:01:23,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 10:01:23,607 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 8 treesize of output 7 [2018-01-31 10:01:23,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 10:01:23,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 10:01:23,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 10:01:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 140 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 10:01:24,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 10:01:24,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 46 [2018-01-31 10:01:24,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-31 10:01:24,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-31 10:01:24,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2018-01-31 10:01:24,567 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 46 states. [2018-01-31 10:01:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:27,258 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2018-01-31 10:01:27,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-31 10:01:27,258 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 80 [2018-01-31 10:01:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:27,259 INFO L225 Difference]: With dead ends: 122 [2018-01-31 10:01:27,259 INFO L226 Difference]: Without dead ends: 105 [2018-01-31 10:01:27,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1008, Invalid=6302, Unknown=0, NotChecked=0, Total=7310 [2018-01-31 10:01:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-31 10:01:27,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2018-01-31 10:01:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-31 10:01:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-01-31 10:01:27,270 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 80 [2018-01-31 10:01:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:27,270 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-01-31 10:01:27,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-31 10:01:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-01-31 10:01:27,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-31 10:01:27,272 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:27,272 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:27,272 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:27,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1418359381, now seen corresponding path program 5 times [2018-01-31 10:01:27,272 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:27,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:27,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:27,273 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 10:01:27,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:27,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-31 10:01:27,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 10:01:27,630 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 10:01:27,635 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 10:01:27,647 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:27,649 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:27,651 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:27,653 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:27,656 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:27,658 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:27,662 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:27,669 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:27,676 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:27,695 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 10:01:27,697 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 10:01:27,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 10:01:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-31 10:01:28,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 10:01:28,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-31 10:01:28,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-31 10:01:28,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-31 10:01:28,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 10:01:28,039 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 41 states. [2018-01-31 10:01:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:28,666 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-01-31 10:01:28,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-31 10:01:28,666 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 92 [2018-01-31 10:01:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:28,667 INFO L225 Difference]: With dead ends: 132 [2018-01-31 10:01:28,667 INFO L226 Difference]: Without dead ends: 109 [2018-01-31 10:01:28,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=964, Invalid=2458, Unknown=0, NotChecked=0, Total=3422 [2018-01-31 10:01:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-31 10:01:28,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-01-31 10:01:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-31 10:01:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-01-31 10:01:28,678 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 92 [2018-01-31 10:01:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:28,678 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-01-31 10:01:28,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-31 10:01:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-01-31 10:01:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-01-31 10:01:28,679 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:28,680 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:28,680 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash -714346959, now seen corresponding path program 6 times [2018-01-31 10:01:28,680 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:28,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:28,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:28,681 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 10:01:28,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:28,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-31 10:01:29,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 10:01:29,097 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 10:01:29,102 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 10:01:29,116 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 10:01:29,119 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 10:01:29,122 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 10:01:29,123 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 10:01:29,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 10:01:29,128 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 8 treesize of output 7 [2018-01-31 10:01:29,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 10:01:29,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 10:01:29,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-31 10:01:31,422 WARN L143 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 10:01:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-01-31 10:01:31,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 10:01:31,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [24] total 32 [2018-01-31 10:01:31,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-31 10:01:31,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-31 10:01:31,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2018-01-31 10:01:31,496 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 32 states. [2018-01-31 10:01:33,089 WARN L143 SmtUtils]: Spent 185ms on a formula simplification that was a NOOP. DAG size: 29 [2018-01-31 10:01:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:34,697 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-01-31 10:01:34,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-31 10:01:34,697 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 98 [2018-01-31 10:01:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:34,697 INFO L225 Difference]: With dead ends: 137 [2018-01-31 10:01:34,698 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 10:01:34,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1127, Invalid=4423, Unknown=0, NotChecked=0, Total=5550 [2018-01-31 10:01:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 10:01:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 10:01:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 10:01:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 10:01:34,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2018-01-31 10:01:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:34,700 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 10:01:34,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-31 10:01:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 10:01:34,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 10:01:34,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 10:01:34,806 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 137 DAG size of output 117 [2018-01-31 10:01:36,219 WARN L146 SmtUtils]: Spent 1284ms on a formula simplification. DAG size of input: 150 DAG size of output 45 [2018-01-31 10:01:36,900 WARN L146 SmtUtils]: Spent 652ms on a formula simplification. DAG size of input: 118 DAG size of output 52 [2018-01-31 10:01:37,034 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 95 DAG size of output 58 [2018-01-31 10:01:37,056 INFO L399 ceAbstractionStarter]: For program point L619(line 619) no Hoare annotation was computed. [2018-01-31 10:01:37,056 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,056 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,057 INFO L399 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-31 10:01:37,057 INFO L399 ceAbstractionStarter]: For program point L619'(line 619) no Hoare annotation was computed. [2018-01-31 10:01:37,057 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 641) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 10:01:37,057 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,057 INFO L395 ceAbstractionStarter]: At program point L624'''''(lines 624 625) the Hoare annotation is: (let ((.cse0 (* 4 ~n))) (or (not (= (select |#length| ~a.base) .cse0)) (= 0 ~a.base) (= 0 foo_~i~3) (<= 2 foo_~i~3) (not (= .cse0 (select |#length| ~b.base))) (not (= ~a.offset 0)) (< ~n 32768) (not (= 4 ~b.offset)) (not (= 1 (select |#valid| ~a.base))) (not (= 1 (select (store |#valid| ~a.base 0) ~b.base))) (= 1 foo_~i~3) (not (= 0 (select (select |#memory_int_part_locs_76_locs_19| ~b.base) (+ ~b.offset (- 4))))))) [2018-01-31 10:01:37,057 INFO L399 ceAbstractionStarter]: For program point L626'''(line 626) no Hoare annotation was computed. [2018-01-31 10:01:37,058 INFO L399 ceAbstractionStarter]: For program point fooErr0RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,058 INFO L399 ceAbstractionStarter]: For program point L624'''(line 624) no Hoare annotation was computed. [2018-01-31 10:01:37,058 INFO L399 ceAbstractionStarter]: For program point fooEXIT(lines 621 628) no Hoare annotation was computed. [2018-01-31 10:01:37,058 INFO L399 ceAbstractionStarter]: For program point L624''''(line 624) no Hoare annotation was computed. [2018-01-31 10:01:37,058 INFO L395 ceAbstractionStarter]: At program point L626''''(lines 626 627) the Hoare annotation is: (let ((.cse0 (* 4 ~n)) (.cse1 (select |#length| ~b.base))) (or (not (= (select |#length| ~a.base) .cse0)) (< 4 ~b.offset) (< ~b.offset 4) (exists ((v_prenex_1 Int)) (and (<= (+ v_prenex_1 1) foo_~i~3) (<= 0 (+ ~b.offset (* 4 v_prenex_1))))) (= 0 ~a.base) (not (= 1 (select |#valid| ~a.base))) (not (= 1 (select (store |#valid| ~a.base 0) ~b.base))) (< .cse1 (+ ~b.offset 131068)) (not (= .cse0 .cse1)) (not (= 0 (select (select |#memory_int_part_locs_76_locs_19| ~b.base) (+ ~b.offset (- 4))))) (not (= ~a.offset 0)))) [2018-01-31 10:01:37,058 INFO L402 ceAbstractionStarter]: At program point fooENTRY(lines 621 628) the Hoare annotation is: true [2018-01-31 10:01:37,058 INFO L399 ceAbstractionStarter]: For program point L624''''''(lines 624 625) no Hoare annotation was computed. [2018-01-31 10:01:37,058 INFO L399 ceAbstractionStarter]: For program point L627(line 627) no Hoare annotation was computed. [2018-01-31 10:01:37,058 INFO L399 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,059 INFO L399 ceAbstractionStarter]: For program point L626(lines 626 627) no Hoare annotation was computed. [2018-01-31 10:01:37,059 INFO L399 ceAbstractionStarter]: For program point L625(line 625) no Hoare annotation was computed. [2018-01-31 10:01:37,059 INFO L399 ceAbstractionStarter]: For program point L626''(line 626) no Hoare annotation was computed. [2018-01-31 10:01:37,059 INFO L399 ceAbstractionStarter]: For program point L624(line 624) no Hoare annotation was computed. [2018-01-31 10:01:37,059 INFO L399 ceAbstractionStarter]: For program point L627'(line 627) no Hoare annotation was computed. [2018-01-31 10:01:37,059 INFO L399 ceAbstractionStarter]: For program point L625'(line 625) no Hoare annotation was computed. [2018-01-31 10:01:37,059 INFO L399 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,059 INFO L399 ceAbstractionStarter]: For program point L624'(lines 624 625) no Hoare annotation was computed. [2018-01-31 10:01:37,059 INFO L399 ceAbstractionStarter]: For program point fooErr3RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,059 INFO L399 ceAbstractionStarter]: For program point L626'''''(lines 626 627) no Hoare annotation was computed. [2018-01-31 10:01:37,060 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 641) the Hoare annotation is: true [2018-01-31 10:01:37,060 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,060 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 641) the Hoare annotation is: true [2018-01-31 10:01:37,060 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,060 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,060 INFO L399 ceAbstractionStarter]: For program point mainErr6RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,060 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,060 INFO L399 ceAbstractionStarter]: For program point L637'(line 637) no Hoare annotation was computed. [2018-01-31 10:01:37,060 INFO L399 ceAbstractionStarter]: For program point L635'(line 635) no Hoare annotation was computed. [2018-01-31 10:01:37,060 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,061 INFO L399 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-31 10:01:37,061 INFO L399 ceAbstractionStarter]: For program point mainErr9RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,061 INFO L399 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,062 INFO L399 ceAbstractionStarter]: For program point L639'(line 639) no Hoare annotation was computed. [2018-01-31 10:01:37,062 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,063 INFO L399 ceAbstractionStarter]: For program point mainErr11RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,063 INFO L399 ceAbstractionStarter]: For program point mainErr8RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,063 INFO L399 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-31 10:01:37,063 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 629 641) no Hoare annotation was computed. [2018-01-31 10:01:37,063 INFO L399 ceAbstractionStarter]: For program point L633(line 633) no Hoare annotation was computed. [2018-01-31 10:01:37,063 INFO L399 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,063 INFO L399 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-31 10:01:37,063 INFO L399 ceAbstractionStarter]: For program point L634''(line 634) no Hoare annotation was computed. [2018-01-31 10:01:37,063 INFO L399 ceAbstractionStarter]: For program point L636''(line 636) no Hoare annotation was computed. [2018-01-31 10:01:37,063 INFO L399 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-31 10:01:37,064 INFO L399 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-31 10:01:37,064 INFO L395 ceAbstractionStarter]: At program point L635(line 635) the Hoare annotation is: (let ((.cse0 (store |#valid| ~a.base 0))) (let ((.cse1 (select .cse0 ~a.base)) (.cse2 (* 4 ~n))) (and (<= |main_#t~malloc4.offset| 0) (= 1 (select .cse0 ~b.base)) (= (store (store |#valid| ~b.base 0) ~a.base .cse1) |old(#valid)|) (not (= ~a.base 0)) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= (store (store |#valid| |main_#t~malloc5.base| 0) ~a.base .cse1) |old(#valid)|) (= 1 (select |#valid| ~a.base)) (<= 131072 (select |#length| |main_#t~malloc5.base|)) (<= 0 |main_#t~malloc4.offset|) (= 4 ~b.offset) (= (select |#length| ~b.base) .cse2) (<= ~a.offset 0) (= .cse2 (select |#length| |main_#t~malloc4.base|)) (= |main_#t~malloc5.offset| 0) (= .cse2 (select |#length| ~a.base)) (= 0 (select (select |#memory_int_part_locs_76_locs_19| ~b.base) (+ ~b.offset (- 4)))) (<= 0 ~a.offset) (not (= 0 |main_#t~malloc5.base|)) (not (= |main_#t~malloc4.base| 0))))) [2018-01-31 10:01:37,064 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 629 641) no Hoare annotation was computed. [2018-01-31 10:01:37,064 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 629 641) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 10:01:37,064 INFO L399 ceAbstractionStarter]: For program point mainErr7RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,064 INFO L399 ceAbstractionStarter]: For program point L639''(line 639) no Hoare annotation was computed. [2018-01-31 10:01:37,064 INFO L399 ceAbstractionStarter]: For program point mainErr10RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-31 10:01:37,064 INFO L399 ceAbstractionStarter]: For program point L636'(line 636) no Hoare annotation was computed. [2018-01-31 10:01:37,064 INFO L399 ceAbstractionStarter]: For program point mainErr12EnsuresViolation(lines 629 641) no Hoare annotation was computed. [2018-01-31 10:01:37,064 INFO L399 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-31 10:01:37,064 INFO L399 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-31 10:01:37,064 INFO L399 ceAbstractionStarter]: For program point L632'(line 632) no Hoare annotation was computed. [2018-01-31 10:01:37,064 INFO L399 ceAbstractionStarter]: For program point L634'''(line 634) no Hoare annotation was computed. [2018-01-31 10:01:37,069 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier2,QUANTIFIED] [2018-01-31 10:01:37,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier4,QUANTIFIED] [2018-01-31 10:01:37,078 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,078 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,081 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 10:01:37,081 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 10:01:37,082 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier6,QUANTIFIED] [2018-01-31 10:01:37,082 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,082 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,083 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 10:01:37,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 10:01:37,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier8,QUANTIFIED] [2018-01-31 10:01:37,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 10:01:37 BasicIcfg [2018-01-31 10:01:37,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 10:01:37,089 INFO L168 Benchmark]: Toolchain (without parser) took 51409.83 ms. Allocated memory was 307.8 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 265.5 MB in the beginning and 980.9 MB in the end (delta: -715.4 MB). Peak memory consumption was 733.2 MB. Max. memory is 5.3 GB. [2018-01-31 10:01:37,090 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 307.8 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 10:01:37,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.29 ms. Allocated memory is still 307.8 MB. Free memory was 264.5 MB in the beginning and 254.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-31 10:01:37,090 INFO L168 Benchmark]: Boogie Preprocessor took 42.19 ms. Allocated memory is still 307.8 MB. Free memory was 254.4 MB in the beginning and 252.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 10:01:37,090 INFO L168 Benchmark]: RCFGBuilder took 551.80 ms. Allocated memory is still 307.8 MB. Free memory was 252.4 MB in the beginning and 233.3 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 5.3 GB. [2018-01-31 10:01:37,091 INFO L168 Benchmark]: IcfgTransformer took 20957.91 ms. Allocated memory was 307.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 233.3 MB in the beginning and 398.8 MB in the end (delta: -165.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-31 10:01:37,093 INFO L168 Benchmark]: TraceAbstraction took 29536.80 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 262.1 MB). Free memory was 398.8 MB in the beginning and 980.9 MB in the end (delta: -582.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 10:01:37,095 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.11 ms. Allocated memory is still 307.8 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 300.29 ms. Allocated memory is still 307.8 MB. Free memory was 264.5 MB in the beginning and 254.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.19 ms. Allocated memory is still 307.8 MB. Free memory was 254.4 MB in the beginning and 252.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 551.80 ms. Allocated memory is still 307.8 MB. Free memory was 252.4 MB in the beginning and 233.3 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 20957.91 ms. Allocated memory was 307.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 233.3 MB in the beginning and 398.8 MB in the end (delta: -165.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. * TraceAbstraction took 29536.80 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 262.1 MB). Free memory was 398.8 MB in the beginning and 980.9 MB in the end (delta: -582.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 55 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 1887 LocStat_NO_SUPPORTING_DISEQUALITIES : 1767 LocStat_NO_DISJUNCTIONS : -110 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 82 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 247 TransStat_NO_SUPPORTING_DISEQUALITIES : 30 TransStat_NO_DISJUNCTIONS : 96 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.011413 RENAME_VARIABLES(MILLISECONDS) : 1.930180 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.000941 PROJECTAWAY(MILLISECONDS) : 0.343592 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.079320 DISJOIN(MILLISECONDS) : 1.292510 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.960046 ADD_EQUALITY(MILLISECONDS) : 0.050552 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.047757 #CONJOIN_DISJUNCTIVE : 332 #RENAME_VARIABLES : 702 #UNFREEZE : 0 #CONJOIN : 691 #PROJECTAWAY : 422 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 85 #RENAME_VARIABLES_DISJUNCTIVE : 666 #ADD_EQUALITY : 206 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 24 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 4 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 4 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier8,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 629]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 624]: Loop Invariant [2018-01-31 10:01:37,107 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier10,QUANTIFIED] [2018-01-31 10:01:37,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,109 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier12,QUANTIFIED] [2018-01-31 10:01:37,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((!(unknown-#length-unknown[a] == 4 * n) || 0 == a) || 0 == i) || 2 <= i) || !(4 * n == unknown-#length-unknown[b])) || !(a == 0)) || n < 32768) || !(4 == b)) || !(1 == \valid[a])) || !(1 == \valid[a := 0][b])) || 1 == i) || !(0 == freshIdentifier12[b][b + -4]) - InvariantResult [Line: 626]: Loop Invariant [2018-01-31 10:01:37,110 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 10:01:37,110 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 10:01:37,110 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier14,QUANTIFIED] [2018-01-31 10:01:37,111 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,111 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,111 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,112 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 10:01:37,112 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 10:01:37,113 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier16,QUANTIFIED] [2018-01-31 10:01:37,113 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,113 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 10:01:37,113 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((!(unknown-#length-unknown[a] == 4 * n) || 4 < b) || b < 4) || (\exists v_prenex_1 : int :: v_prenex_1 + 1 <= i && 0 <= b + 4 * v_prenex_1)) || 0 == a) || !(1 == \valid[a])) || !(1 == \valid[a := 0][b])) || unknown-#length-unknown[b] < b + 131068) || !(4 * n == unknown-#length-unknown[b])) || !(0 == freshIdentifier16[b][b + -4])) || !(a == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 66 locations, 17 error locations. SAFE Result, 29.3s OverallTime, 20 OverallIterations, 11 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 715 SDtfs, 2001 SDslu, 3821 SDs, 0 SdLazy, 4685 SolverSat, 371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1039 GetRequests, 497 SyntacticMatches, 8 SemanticMatches, 534 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6165 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 80 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 23 NumberOfFragments, 266 HoareAnnotationTreeSize, 8 FomulaSimplifications, 1997 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 5587 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 1332 NumberOfCodeBlocks, 1208 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1302 ConstructedInterpolants, 232 QuantifiedInterpolants, 650390 SizeOfPredicates, 119 NumberOfNonLiveVariables, 1349 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 30 InterpolantComputations, 12 PerfectInterpolantSequences, 759/2356 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_10-01-37-127.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_10-01-37-127.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_10-01-37-127.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_10-01-37-127.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_10-01-37-127.csv Received shutdown request...