java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 02:37:10,959 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 02:37:10,960 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 02:37:10,978 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 02:37:10,978 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 02:37:10,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 02:37:10,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 02:37:10,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 02:37:10,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 02:37:10,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 02:37:10,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 02:37:10,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 02:37:10,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 02:37:10,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 02:37:10,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 02:37:10,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 02:37:10,996 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 02:37:10,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 02:37:11,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 02:37:11,001 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 02:37:11,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 02:37:11,004 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 02:37:11,004 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 02:37:11,006 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 02:37:11,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 02:37:11,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 02:37:11,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 02:37:11,009 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 02:37:11,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 02:37:11,009 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 02:37:11,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 02:37:11,011 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-30 02:37:11,022 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 02:37:11,022 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 02:37:11,023 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 02:37:11,023 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 02:37:11,023 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 02:37:11,024 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 02:37:11,024 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 02:37:11,025 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 02:37:11,025 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 02:37:11,025 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 02:37:11,025 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 02:37:11,025 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 02:37:11,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 02:37:11,026 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 02:37:11,026 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 02:37:11,026 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 02:37:11,026 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 02:37:11,026 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 02:37:11,027 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 02:37:11,027 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 02:37:11,027 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 02:37:11,027 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 02:37:11,027 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 02:37:11,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:37:11,028 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 02:37:11,028 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 02:37:11,028 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 02:37:11,029 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 02:37:11,029 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 02:37:11,029 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 02:37:11,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 02:37:11,029 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 02:37:11,030 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 02:37:11,031 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 02:37:11,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 02:37:11,083 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 02:37:11,087 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 02:37:11,089 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 02:37:11,090 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 02:37:11,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-01-30 02:37:11,253 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 02:37:11,260 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 02:37:11,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 02:37:11,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 02:37:11,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 02:37:11,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:37:11" (1/1) ... [2018-01-30 02:37:11,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b80f5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:37:11, skipping insertion in model container [2018-01-30 02:37:11,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:37:11" (1/1) ... [2018-01-30 02:37:11,288 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:37:11,307 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:37:11,468 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:37:11,498 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:37:11,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:37:11 WrapperNode [2018-01-30 02:37:11,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 02:37:11,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 02:37:11,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 02:37:11,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 02:37:11,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:37:11" (1/1) ... [2018-01-30 02:37:11,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:37:11" (1/1) ... [2018-01-30 02:37:11,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:37:11" (1/1) ... [2018-01-30 02:37:11,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:37:11" (1/1) ... [2018-01-30 02:37:11,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:37:11" (1/1) ... [2018-01-30 02:37:11,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:37:11" (1/1) ... [2018-01-30 02:37:11,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:37:11" (1/1) ... [2018-01-30 02:37:11,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 02:37:11,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 02:37:11,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 02:37:11,570 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 02:37:11,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:37:11" (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-30 02:37:11,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 02:37:11,628 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 02:37:11,628 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-30 02:37:11,628 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 02:37:11,628 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 02:37:11,628 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 02:37:11,629 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 02:37:11,629 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 02:37:11,629 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 02:37:11,629 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-30 02:37:11,629 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 02:37:11,629 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 02:37:11,630 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 02:37:11,871 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 02:37:11,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:37:11 BoogieIcfgContainer [2018-01-30 02:37:11,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 02:37:11,872 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 02:37:11,872 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 02:37:11,873 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 02:37:11,876 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:37:11" (1/1) ... [2018-01-30 02:37:11,884 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 02:37:11,884 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 02:37:11,885 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 02:37:11,926 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 6 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 02:37:11,950 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 02:37:12,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 02:37:27,752 INFO L311 AbstractInterpreter]: Visited 73 different actions 514 times. Merged at 47 different actions 282 times. Widened at 1 different actions 1 times. Found 29 fixpoints after 9 different actions. Largest state had 39 variables. [2018-01-30 02:37:27,755 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 02:37:27,765 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-01-30 02:37:27,766 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 02:37:27,766 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 02:37:27,767 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v_foo_~b.base_2) (+ v_foo_~b.offset_2 v_foo_~i~1_6)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~1 * 1, 1); srcloc: L16')) [2018-01-30 02:37:27,770 INFO L547 PartitionManager]: partitioning result: [2018-01-30 02:37:27,771 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 02:37:27,771 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 02:37:27,771 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-30 02:37:27,771 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 02:37:27,771 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 02:37:27,771 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-30 02:37:27,771 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 02:37:27,772 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 02:37:27,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 02:37:27 BasicIcfg [2018-01-30 02:37:27,792 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 02:37:27,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 02:37:27,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 02:37:27,797 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 02:37:27,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:37:11" (1/4) ... [2018-01-30 02:37:27,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703b1f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:37:27, skipping insertion in model container [2018-01-30 02:37:27,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:37:11" (2/4) ... [2018-01-30 02:37:27,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703b1f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:37:27, skipping insertion in model container [2018-01-30 02:37:27,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:37:11" (3/4) ... [2018-01-30 02:37:27,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703b1f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:37:27, skipping insertion in model container [2018-01-30 02:37:27,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 02:37:27" (4/4) ... [2018-01-30 02:37:27,801 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 02:37:27,807 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 02:37:27,814 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-30 02:37:27,921 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 02:37:27,921 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 02:37:27,922 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 02:37:27,922 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 02:37:27,922 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 02:37:27,922 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 02:37:27,922 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 02:37:27,923 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 02:37:27,923 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 02:37:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-30 02:37:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-30 02:37:27,941 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:27,942 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:27,942 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:27,945 INFO L82 PathProgramCache]: Analyzing trace with hash -289603045, now seen corresponding path program 1 times [2018-01-30 02:37:27,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:27,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:27,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:27,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:27,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:28,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:28,165 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-30 02:37:28,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:37:28,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 02:37:28,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:37:28,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:37:28,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:37:28,185 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2018-01-30 02:37:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:28,346 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2018-01-30 02:37:28,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:37:28,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-30 02:37:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:28,365 INFO L225 Difference]: With dead ends: 138 [2018-01-30 02:37:28,365 INFO L226 Difference]: Without dead ends: 82 [2018-01-30 02:37:28,370 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:37:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-30 02:37:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-01-30 02:37:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-30 02:37:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-01-30 02:37:28,422 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 12 [2018-01-30 02:37:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:28,423 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-01-30 02:37:28,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:37:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-01-30 02:37:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 02:37:28,424 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:28,425 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:28,425 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:28,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1129209722, now seen corresponding path program 1 times [2018-01-30 02:37:28,425 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:28,425 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:28,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:28,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:28,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:28,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:28,521 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-30 02:37:28,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:37:28,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 02:37:28,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:37:28,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:37:28,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:37:28,524 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 6 states. [2018-01-30 02:37:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:28,621 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2018-01-30 02:37:28,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:37:28,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-30 02:37:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:28,623 INFO L225 Difference]: With dead ends: 130 [2018-01-30 02:37:28,623 INFO L226 Difference]: Without dead ends: 78 [2018-01-30 02:37:28,625 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:37:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-30 02:37:28,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2018-01-30 02:37:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-30 02:37:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-01-30 02:37:28,634 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 21 [2018-01-30 02:37:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:28,635 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-01-30 02:37:28,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:37:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-01-30 02:37:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 02:37:28,636 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:28,636 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:28,636 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash 645763495, now seen corresponding path program 1 times [2018-01-30 02:37:28,637 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:28,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:28,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:28,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:28,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:28,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:28,760 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-30 02:37:28,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:37:28,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 02:37:28,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:37:28,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:37:28,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:37:28,761 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 6 states. [2018-01-30 02:37:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:29,026 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-01-30 02:37:29,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 02:37:29,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-30 02:37:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:29,027 INFO L225 Difference]: With dead ends: 71 [2018-01-30 02:37:29,028 INFO L226 Difference]: Without dead ends: 70 [2018-01-30 02:37:29,028 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:37:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-30 02:37:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-30 02:37:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-30 02:37:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-01-30 02:37:29,034 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 22 [2018-01-30 02:37:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:29,034 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-01-30 02:37:29,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:37:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-01-30 02:37:29,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 02:37:29,035 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:29,035 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:29,035 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:29,036 INFO L82 PathProgramCache]: Analyzing trace with hash 645763497, now seen corresponding path program 1 times [2018-01-30 02:37:29,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:29,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:29,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:29,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:29,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:29,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:29,443 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-30 02:37:29,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:37:29,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:37:29,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:37:29,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:37:29,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:37:29,444 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 7 states. [2018-01-30 02:37:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:29,835 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-01-30 02:37:29,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 02:37:29,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-30 02:37:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:29,837 INFO L225 Difference]: With dead ends: 76 [2018-01-30 02:37:29,837 INFO L226 Difference]: Without dead ends: 75 [2018-01-30 02:37:29,837 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:37:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-30 02:37:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-01-30 02:37:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-30 02:37:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-01-30 02:37:29,843 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 22 [2018-01-30 02:37:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:29,844 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-01-30 02:37:29,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 02:37:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-01-30 02:37:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 02:37:29,845 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:29,845 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:29,845 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:29,845 INFO L82 PathProgramCache]: Analyzing trace with hash 823290080, now seen corresponding path program 1 times [2018-01-30 02:37:29,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:29,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:29,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:29,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:29,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:29,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:37:29,936 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:37:29,936 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-30 02:37:29,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:29,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:37:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:37:30,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:37:30,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-30 02:37:30,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 02:37:30,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 02:37:30,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:37:30,028 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 8 states. [2018-01-30 02:37:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:30,213 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-01-30 02:37:30,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:37:30,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-30 02:37:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:30,215 INFO L225 Difference]: With dead ends: 110 [2018-01-30 02:37:30,215 INFO L226 Difference]: Without dead ends: 89 [2018-01-30 02:37:30,216 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-30 02:37:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-30 02:37:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2018-01-30 02:37:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-30 02:37:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-01-30 02:37:30,236 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 23 [2018-01-30 02:37:30,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:30,236 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-01-30 02:37:30,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 02:37:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-01-30 02:37:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 02:37:30,238 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:30,238 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:30,238 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:30,238 INFO L82 PathProgramCache]: Analyzing trace with hash 349066383, now seen corresponding path program 1 times [2018-01-30 02:37:30,239 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:30,239 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:30,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:30,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:30,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:30,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:30,351 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-30 02:37:30,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:37:30,352 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-30 02:37:30,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:30,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:37:30,413 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-30 02:37:30,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:37:30,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-30 02:37:30,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 02:37:30,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 02:37:30,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:37:30,436 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 5 states. [2018-01-30 02:37:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:30,535 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-01-30 02:37:30,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 02:37:30,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-30 02:37:30,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:30,541 INFO L225 Difference]: With dead ends: 97 [2018-01-30 02:37:30,541 INFO L226 Difference]: Without dead ends: 96 [2018-01-30 02:37:30,542 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:37:30,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-30 02:37:30,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-01-30 02:37:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-30 02:37:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-01-30 02:37:30,566 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 30 [2018-01-30 02:37:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:30,566 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-01-30 02:37:30,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 02:37:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-01-30 02:37:30,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 02:37:30,571 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:30,571 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:30,571 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:30,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2063843532, now seen corresponding path program 1 times [2018-01-30 02:37:30,572 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:30,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:30,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:30,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:30,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:30,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:37:31,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:37:31,001 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:37:31,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:31,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:37:31,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:37:31,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:37:31,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:37:31,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:37:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:37:31,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:37:31,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-01-30 02:37:31,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 02:37:31,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 02:37:31,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-30 02:37:31,223 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 15 states. [2018-01-30 02:37:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:31,637 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-01-30 02:37:31,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 02:37:31,637 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2018-01-30 02:37:31,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:31,638 INFO L225 Difference]: With dead ends: 96 [2018-01-30 02:37:31,638 INFO L226 Difference]: Without dead ends: 95 [2018-01-30 02:37:31,638 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-01-30 02:37:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-30 02:37:31,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-01-30 02:37:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-30 02:37:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-01-30 02:37:31,649 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 31 [2018-01-30 02:37:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:31,650 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-01-30 02:37:31,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 02:37:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-01-30 02:37:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-30 02:37:31,651 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:31,651 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:31,651 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:31,651 INFO L82 PathProgramCache]: Analyzing trace with hash -713537766, now seen corresponding path program 2 times [2018-01-30 02:37:31,651 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:31,651 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:31,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:31,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:31,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:31,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:37:31,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:37:31,779 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-30 02:37:31,789 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:37:31,797 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:37:31,803 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:37:31,804 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:37:31,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:37:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:37:31,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:37:31,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2018-01-30 02:37:31,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 02:37:31,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 02:37:31,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-01-30 02:37:31,987 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 15 states. [2018-01-30 02:37:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:32,230 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-01-30 02:37:32,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 02:37:32,230 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-01-30 02:37:32,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:32,231 INFO L225 Difference]: With dead ends: 108 [2018-01-30 02:37:32,232 INFO L226 Difference]: Without dead ends: 107 [2018-01-30 02:37:32,232 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2018-01-30 02:37:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-30 02:37:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2018-01-30 02:37:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-30 02:37:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-01-30 02:37:32,242 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 39 [2018-01-30 02:37:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:32,242 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-01-30 02:37:32,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 02:37:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-01-30 02:37:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-30 02:37:32,244 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:32,245 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:32,245 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash -644833783, now seen corresponding path program 2 times [2018-01-30 02:37:32,245 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:32,245 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:32,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:32,246 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:37:32,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:32,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:37:32,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:37:32,457 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-30 02:37:32,462 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:37:32,469 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:37:32,473 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:37:32,474 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:37:32,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:37:32,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:37:32,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:37:32,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:37:32,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:37:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:37:32,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:37:32,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-01-30 02:37:32,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 02:37:32,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 02:37:32,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-30 02:37:32,598 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 14 states. [2018-01-30 02:37:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:32,892 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-01-30 02:37:32,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 02:37:32,892 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-01-30 02:37:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:32,893 INFO L225 Difference]: With dead ends: 107 [2018-01-30 02:37:32,894 INFO L226 Difference]: Without dead ends: 106 [2018-01-30 02:37:32,894 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2018-01-30 02:37:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-30 02:37:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2018-01-30 02:37:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-30 02:37:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-01-30 02:37:32,904 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 40 [2018-01-30 02:37:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:32,905 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-01-30 02:37:32,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-30 02:37:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-01-30 02:37:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-30 02:37:32,907 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:32,907 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:32,907 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:32,907 INFO L82 PathProgramCache]: Analyzing trace with hash 853161830, now seen corresponding path program 1 times [2018-01-30 02:37:32,907 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:32,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:32,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:32,909 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:37:32,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:32,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:37:32,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:37:32,962 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-30 02:37:32,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:32,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:37:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:37:33,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:37:33,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-30 02:37:33,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 02:37:33,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 02:37:33,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:37:33,012 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 9 states. [2018-01-30 02:37:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:33,172 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-01-30 02:37:33,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:37:33,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-30 02:37:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:33,173 INFO L225 Difference]: With dead ends: 143 [2018-01-30 02:37:33,173 INFO L226 Difference]: Without dead ends: 123 [2018-01-30 02:37:33,174 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:37:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-30 02:37:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-01-30 02:37:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-30 02:37:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-01-30 02:37:33,185 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 41 [2018-01-30 02:37:33,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:33,185 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-01-30 02:37:33,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 02:37:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-01-30 02:37:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-30 02:37:33,187 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:33,187 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:33,187 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:33,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1541333292, now seen corresponding path program 3 times [2018-01-30 02:37:33,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:33,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:33,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:33,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:33,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:33,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 02:37:33,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:37:33,478 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-30 02:37:33,486 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 02:37:33,495 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:37:33,510 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:37:33,511 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:37:33,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:37:33,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:37:33,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:37:33,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:37:33,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:37:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 02:37:33,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:37:33,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-30 02:37:33,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 02:37:33,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 02:37:33,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-01-30 02:37:33,678 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 18 states. [2018-01-30 02:37:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:33,995 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-01-30 02:37:33,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 02:37:33,996 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-01-30 02:37:33,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:33,997 INFO L225 Difference]: With dead ends: 107 [2018-01-30 02:37:33,997 INFO L226 Difference]: Without dead ends: 106 [2018-01-30 02:37:33,997 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2018-01-30 02:37:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-30 02:37:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2018-01-30 02:37:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 02:37:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-01-30 02:37:34,004 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 49 [2018-01-30 02:37:34,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:34,004 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-01-30 02:37:34,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 02:37:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-01-30 02:37:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-30 02:37:34,005 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:34,005 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:34,005 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2112266945, now seen corresponding path program 2 times [2018-01-30 02:37:34,006 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:34,006 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:34,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:34,006 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:37:34,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:34,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:37:34,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:37:34,130 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-30 02:37:34,138 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:37:34,143 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:37:34,144 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:37:34,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:37:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-30 02:37:34,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:37:34,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-01-30 02:37:34,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 02:37:34,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 02:37:34,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=100, Unknown=1, NotChecked=0, Total=132 [2018-01-30 02:37:34,244 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 12 states. [2018-01-30 02:37:34,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:34,725 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2018-01-30 02:37:34,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 02:37:34,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-01-30 02:37:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:34,726 INFO L225 Difference]: With dead ends: 131 [2018-01-30 02:37:34,727 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 02:37:34,727 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=363, Unknown=1, NotChecked=0, Total=506 [2018-01-30 02:37:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 02:37:34,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2018-01-30 02:37:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 02:37:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-01-30 02:37:34,734 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 52 [2018-01-30 02:37:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:34,735 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-01-30 02:37:34,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 02:37:34,735 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-01-30 02:37:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-30 02:37:34,736 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:34,736 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:34,736 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:34,736 INFO L82 PathProgramCache]: Analyzing trace with hash 296475714, now seen corresponding path program 1 times [2018-01-30 02:37:34,736 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:34,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:34,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:34,737 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:37:34,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:34,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-01-30 02:37:34,833 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:37:34,833 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-30 02:37:34,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:34,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:37:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 02:37:35,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:37:35,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-01-30 02:37:35,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 02:37:35,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 02:37:35,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-30 02:37:35,029 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 15 states. [2018-01-30 02:37:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:35,265 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2018-01-30 02:37:35,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 02:37:35,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-01-30 02:37:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:35,266 INFO L225 Difference]: With dead ends: 130 [2018-01-30 02:37:35,266 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 02:37:35,267 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-01-30 02:37:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 02:37:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2018-01-30 02:37:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-30 02:37:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2018-01-30 02:37:35,274 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 65 [2018-01-30 02:37:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:35,274 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2018-01-30 02:37:35,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 02:37:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-01-30 02:37:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-30 02:37:35,275 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:37:35,276 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:37:35,276 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:37:35,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1585457444, now seen corresponding path program 2 times [2018-01-30 02:37:35,276 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:37:35,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:37:35,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:35,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:37:35,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:37:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:37:35,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:37:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-30 02:37:35,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:37:35,394 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-30 02:37:35,409 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:37:35,415 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:37:35,423 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:37:35,424 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:37:35,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:37:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 02:37:35,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:37:35,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 19 [2018-01-30 02:37:35,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 02:37:35,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 02:37:35,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-30 02:37:35,547 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 19 states. [2018-01-30 02:37:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:37:35,799 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2018-01-30 02:37:35,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 02:37:35,800 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 83 [2018-01-30 02:37:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:37:35,800 INFO L225 Difference]: With dead ends: 147 [2018-01-30 02:37:35,800 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 02:37:35,802 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 02:37:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 02:37:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 02:37:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 02:37:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 02:37:35,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-01-30 02:37:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:37:35,803 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 02:37:35,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 02:37:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 02:37:35,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 02:37:35,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 02:37:35,920 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:37:35,975 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:37:36,015 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:37:36,048 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:37:36,079 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:37:36,110 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:37:36,141 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:37:36,171 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:37:36,539 WARN L146 SmtUtils]: Spent 322ms on a formula simplification. DAG size of input: 36 DAG size of output 28 [2018-01-30 02:37:36,722 WARN L146 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 50 DAG size of output 30 [2018-01-30 02:37:36,885 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 57 DAG size of output 39 [2018-01-30 02:37:36,993 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 40 DAG size of output 28 [2018-01-30 02:37:36,995 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 35) no Hoare annotation was computed. [2018-01-30 02:37:36,995 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-30 02:37:36,996 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 02:37:36,996 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-30 02:37:36,996 INFO L399 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-30 02:37:36,996 INFO L399 ceAbstractionStarter]: For program point L15''''(line 15) no Hoare annotation was computed. [2018-01-30 02:37:36,996 INFO L399 ceAbstractionStarter]: For program point L15'''''(line 15) no Hoare annotation was computed. [2018-01-30 02:37:36,996 INFO L399 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-30 02:37:36,996 INFO L395 ceAbstractionStarter]: At program point L15''''''(lines 15 17) the Hoare annotation is: (let ((.cse1 (= foo_~size 32)) (.cse0 (select |#length| foo_~b.base)) (.cse2 (= 1 (select |#valid| foo_~b.base)))) (or (not (= (select |#valid| |foo_#in~b.base|) 1)) (not (= 32 |foo_#in~size|)) (and (= .cse0 32) (<= foo_~b.offset 0) .cse1 .cse2 (<= 0 foo_~b.offset) (= foo_~i~1 0)) (< 0 |foo_#in~b.offset|) (and .cse1 (= 32 .cse0) .cse2 (<= 1 (+ foo_~i~1 foo_~b.offset)) (= foo_~b.offset 0)) (< |foo_#in~b.offset| 0) (not (= 32 (select |#length| |foo_#in~b.base|))))) [2018-01-30 02:37:36,996 INFO L402 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-30 02:37:36,996 INFO L399 ceAbstractionStarter]: For program point L15'''''''(lines 15 17) no Hoare annotation was computed. [2018-01-30 02:37:36,996 INFO L399 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2018-01-30 02:37:36,996 INFO L399 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-30 02:37:36,996 INFO L399 ceAbstractionStarter]: For program point L15'''(lines 15 17) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point L16'''(line 16) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point L15'(lines 15 17) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 35) the Hoare annotation is: true [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 35) the Hoare annotation is: true [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-30 02:37:36,997 INFO L399 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 35) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point L25'''(lines 25 28) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-30 02:37:36,998 INFO L399 ceAbstractionStarter]: For program point L27''''(line 27) no Hoare annotation was computed. [2018-01-30 02:37:36,999 INFO L395 ceAbstractionStarter]: At program point L25''''''(lines 25 28) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (= 1 (select |#valid| main_~c~3.base)) .cse0 .cse1 .cse2 .cse3 (<= 1 main_~i~3) (= main_~c~3.offset 0) (= 32 (select |#length| main_~c~3.base))) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-30 02:37:36,999 INFO L395 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~3.base))) (.cse1 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse2 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse3 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse4 (= 0 |main_~#mask~3.offset|)) (.cse5 (= main_~c~3.offset 0)) (.cse6 (= 32 (select |#length| main_~c~3.base)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 main_~i~3) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 main_~i~3) .cse5 .cse6 (<= main_~i~3 31)))) [2018-01-30 02:37:36,999 INFO L399 ceAbstractionStarter]: For program point L25'(lines 25 28) no Hoare annotation was computed. [2018-01-30 02:37:36,999 INFO L399 ceAbstractionStarter]: For program point L27'''(line 27) no Hoare annotation was computed. [2018-01-30 02:37:36,999 INFO L399 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-30 02:37:36,999 INFO L399 ceAbstractionStarter]: For program point L29'''(line 29) no Hoare annotation was computed. [2018-01-30 02:37:36,999 INFO L399 ceAbstractionStarter]: For program point L29''''''(lines 29 33) no Hoare annotation was computed. [2018-01-30 02:37:36,999 INFO L399 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-30 02:37:36,999 INFO L399 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-30 02:37:36,999 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-01-30 02:37:36,999 INFO L399 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-30 02:37:36,999 INFO L399 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-30 02:37:36,999 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-01-30 02:37:36,999 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 02:37:37,000 INFO L399 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-30 02:37:37,000 INFO L399 ceAbstractionStarter]: For program point L29''''(line 29) no Hoare annotation was computed. [2018-01-30 02:37:37,000 INFO L399 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-30 02:37:37,000 INFO L399 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-30 02:37:37,000 INFO L399 ceAbstractionStarter]: For program point L25'''''''(lines 25 28) no Hoare annotation was computed. [2018-01-30 02:37:37,000 INFO L395 ceAbstractionStarter]: At program point L29'''''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~3.base))) (.cse1 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse2 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse3 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse4 (= 0 |main_~#mask~3.offset|)) (.cse5 (= main_~c~3.offset 0)) (.cse6 (= 32 (select |#length| main_~c~3.base)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 main_~i~3) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 main_~i~3) .cse5 .cse6))) [2018-01-30 02:37:37,000 INFO L399 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-30 02:37:37,000 INFO L399 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-30 02:37:37,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,006 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,006 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,008 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:37:37 BasicIcfg [2018-01-30 02:37:37,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 02:37:37,021 INFO L168 Benchmark]: Toolchain (without parser) took 25766.96 ms. Allocated memory was 297.3 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 258.0 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 419.1 MB. Max. memory is 5.3 GB. [2018-01-30 02:37:37,021 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 297.3 MB. Free memory is still 262.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:37:37,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.24 ms. Allocated memory is still 297.3 MB. Free memory was 256.0 MB in the beginning and 248.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:37:37,022 INFO L168 Benchmark]: Boogie Preprocessor took 50.23 ms. Allocated memory is still 297.3 MB. Free memory was 248.0 MB in the beginning and 246.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:37:37,022 INFO L168 Benchmark]: RCFGBuilder took 301.84 ms. Allocated memory is still 297.3 MB. Free memory was 246.0 MB in the beginning and 229.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:37:37,023 INFO L168 Benchmark]: IcfgTransformer took 15920.09 ms. Allocated memory was 297.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 229.1 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 66.9 MB. Max. memory is 5.3 GB. [2018-01-30 02:37:37,023 INFO L168 Benchmark]: TraceAbstraction took 9227.13 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 294.6 MB). Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 28.6 MB). Peak memory consumption was 323.3 MB. Max. memory is 5.3 GB. [2018-01-30 02:37:37,025 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.20 ms. Allocated memory is still 297.3 MB. Free memory is still 262.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 258.24 ms. Allocated memory is still 297.3 MB. Free memory was 256.0 MB in the beginning and 248.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.23 ms. Allocated memory is still 297.3 MB. Free memory was 248.0 MB in the beginning and 246.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 301.84 ms. Allocated memory is still 297.3 MB. Free memory was 246.0 MB in the beginning and 229.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 15920.09 ms. Allocated memory was 297.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 229.1 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 66.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9227.13 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 294.6 MB). Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 28.6 MB). Peak memory consumption was 323.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 62 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 1094 LocStat_NO_SUPPORTING_DISEQUALITIES : 479 LocStat_NO_DISJUNCTIONS : -124 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 82 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 104 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 83 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.122520 RENAME_VARIABLES(MILLISECONDS) : 0.164871 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.095894 PROJECTAWAY(MILLISECONDS) : 0.295354 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.086048 DISJOIN(MILLISECONDS) : 0.235574 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.183000 ADD_EQUALITY(MILLISECONDS) : 0.024670 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.032210 #CONJOIN_DISJUNCTIVE : 814 #RENAME_VARIABLES : 1822 #UNFREEZE : 0 #CONJOIN : 1150 #PROJECTAWAY : 1079 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 262 #RENAME_VARIABLES_DISJUNCTIVE : 1802 #ADD_EQUALITY : 104 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 - 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: 16]: array index is always in bounds For all program executions holds that array index is always in bounds 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: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2018-01-30 02:37:37,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) && 1 <= i) && c == 0) && 32 == unknown-#length-unknown[c]) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - InvariantResult [Line: 15]: Loop Invariant [2018-01-30 02:37:37,035 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,035 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,035 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,036 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,036 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,036 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(\valid[b] == 1) || !(32 == \old(size))) || (((((unknown-#length-unknown[b] == 32 && b <= 0) && size == 32) && 1 == \valid[b]) && 0 <= b) && i == 0)) || 0 < b) || ((((size == 32 && 32 == unknown-#length-unknown[b]) && 1 == \valid[b]) && 1 <= i + b) && b == 0)) || b < 0) || !(32 == unknown-#length-unknown[b]) - InvariantResult [Line: 29]: Loop Invariant [2018-01-30 02:37:37,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:37:37,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == i) && c == 0) && 32 == unknown-#length-unknown[c]) || (((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) && 1 <= i) && c == 0) && 32 == unknown-#length-unknown[c]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 6 error locations. SAFE Result, 9.0s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 808 SDtfs, 1210 SDslu, 3933 SDs, 0 SdLazy, 1802 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 400 SyntacticMatches, 10 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=10, 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, 14 MinimizatonAttempts, 139 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 25 PreInvPairs, 49 NumberOfFragments, 288 HoareAnnotationTreeSize, 25 FomulaSimplifications, 3342 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1269 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 983 NumberOfCodeBlocks, 932 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 959 ConstructedInterpolants, 2 QuantifiedInterpolants, 218191 SizeOfPredicates, 58 NumberOfNonLiveVariables, 746 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 336/692 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/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_02-37-37-045.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_02-37-37-045.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_02-37-37-045.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_02-37-37-045.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_02-37-37-045.csv Received shutdown request...