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/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:28:50,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:28:50,106 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:28:50,123 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:28:50,123 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:28:50,124 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:28:50,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:28:50,126 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:28:50,129 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:28:50,129 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:28:50,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:28:50,131 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:28:50,132 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:28:50,133 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:28:50,134 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:28:50,138 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:28:50,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:28:50,148 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:28:50,153 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:28:50,154 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:28:50,156 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:28:50,156 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:28:50,157 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:28:50,158 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:28:50,158 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:28:50,160 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:28:50,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:28:50,161 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:28:50,161 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:28:50,161 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:28:50,162 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:28:50,162 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:28:50,172 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:28:50,173 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:28:50,173 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:28:50,174 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:28:50,174 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:28:50,174 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:28:50,174 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:28:50,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:28:50,175 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:28:50,175 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:28:50,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:28:50,176 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:28:50,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:28:50,176 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:28:50,176 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:28:50,176 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:28:50,177 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:28:50,177 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:28:50,177 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:28:50,177 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:28:50,177 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:28:50,178 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:28:50,178 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:28:50,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:28:50,178 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:28:50,178 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:28:50,179 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:28:50,179 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:28:50,179 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:28:50,179 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:28:50,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:28:50,179 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:28:50,180 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:28:50,181 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:28:50,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:28:50,231 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:28:50,235 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:28:50,237 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:28:50,237 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:28:50,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-31 09:28:50,415 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:28:50,424 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:28:50,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:28:50,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:28:50,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:28:50,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:28:50" (1/1) ... [2018-01-31 09:28:50,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3833cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:28:50, skipping insertion in model container [2018-01-31 09:28:50,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:28:50" (1/1) ... [2018-01-31 09:28:50,459 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:28:50,518 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:28:50,695 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:28:50,721 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:28:50,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:28:50 WrapperNode [2018-01-31 09:28:50,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:28:50,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:28:50,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:28:50,733 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:28:50,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:28:50" (1/1) ... [2018-01-31 09:28:50,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:28:50" (1/1) ... [2018-01-31 09:28:50,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:28:50" (1/1) ... [2018-01-31 09:28:50,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:28:50" (1/1) ... [2018-01-31 09:28:50,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:28:50" (1/1) ... [2018-01-31 09:28:50,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:28:50" (1/1) ... [2018-01-31 09:28:50,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:28:50" (1/1) ... [2018-01-31 09:28:50,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:28:50,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:28:50,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:28:50,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:28:50,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:28:50" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:28:50,861 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:28:50,861 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:28:50,861 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-31 09:28:50,862 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:28:50,862 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:28:50,862 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:28:50,864 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:28:50,865 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:28:50,865 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:28:50,865 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:28:50,865 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-31 09:28:50,865 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:28:50,865 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:28:50,866 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:28:51,467 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:28:51,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:28:51 BoogieIcfgContainer [2018-01-31 09:28:51,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:28:51,469 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:28:51,469 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:28:51,471 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:28:51,475 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:28:51" (1/1) ... [2018-01-31 09:28:51,485 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:28:51,486 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:28:51,486 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:28:51,534 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:28:51,568 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:28:51,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:29:44,829 INFO L314 AbstractInterpreter]: Visited 89 different actions 500 times. Merged at 60 different actions 225 times. Never widened. Found 20 fixpoints after 5 different actions. Largest state had 57 variables. [2018-01-31 09:29:44,831 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:29:44,842 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-31 09:29:44,843 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:29:44,843 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:29:44,844 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_2| |v_cstrcmp_#t~post0.base_3|) |v_cstrcmp_#t~post0.offset_3|), at (SUMMARY for call #t~mem2 := read~int(#t~post0.base, #t~post0.offset, 1); srcloc: L543''')) ((select (select |v_#memory_int_5| |v_cstrcmp_#t~pre5.base_2|) |v_cstrcmp_#t~pre5.offset_2|), at (SUMMARY for call #t~mem7 := read~int(#t~pre5.base, #t~pre5.offset, 1); srcloc: L546'')) ((select |v_#memory_int_9| v_main_~nondetString1~3.base_2), at (SUMMARY for call write~int(0, ~nondetString1~3.base, ~nondetString1~3.offset + (~length1~3 - 1) * 1, 1); srcloc: L559)) ((select (select |v_#memory_int_3| |v_cstrcmp_#t~post3.base_3|) |v_cstrcmp_#t~post3.offset_3|), at (SUMMARY for call #t~mem4 := read~int(#t~post3.base, #t~post3.offset, 1); srcloc: L544'')) ((select (select |v_#memory_int_1| v_cstrcmp_~s1.base_2) v_cstrcmp_~s1.offset_2), at (SUMMARY for call #t~mem1 := read~int(~s1.base, ~s1.offset, 1); srcloc: L543)) ((select (select |v_#memory_int_4| v_cstrcmp_~s1.base_7) v_cstrcmp_~s1.offset_6), at (SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 1); srcloc: L543''''''''''''')) ((select |v_#memory_int_11| v_main_~nondetString2~3.base_2), at (SUMMARY for call write~int(0, ~nondetString2~3.base, ~nondetString2~3.offset + (~length2~3 - 1) * 1, 1); srcloc: L559')) [2018-01-31 09:29:44,886 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:29:44,886 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:29:44,886 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:29:44,886 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-31 09:29:44,886 INFO L564 PartitionManager]: # location blocks :3 [2018-01-31 09:29:44,886 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:29:44,887 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-31 09:29:44,887 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:29:44,887 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:29:44,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:29:44 BasicIcfg [2018-01-31 09:29:44,905 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:29:44,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:29:44,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:29:44,912 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:29:44,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:28:50" (1/4) ... [2018-01-31 09:29:44,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492718df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:29:44, skipping insertion in model container [2018-01-31 09:29:44,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:28:50" (2/4) ... [2018-01-31 09:29:44,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492718df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:29:44, skipping insertion in model container [2018-01-31 09:29:44,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:28:51" (3/4) ... [2018-01-31 09:29:44,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492718df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:29:44, skipping insertion in model container [2018-01-31 09:29:44,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:29:44" (4/4) ... [2018-01-31 09:29:44,916 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:29:44,926 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:29:45,035 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 09:29:45,083 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:29:45,084 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:29:45,084 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:29:45,084 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:29:45,084 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:29:45,084 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:29:45,084 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:29:45,085 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:29:45,085 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:29:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-31 09:29:45,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:29:45,104 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:45,105 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:29:45,106 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:45,111 INFO L82 PathProgramCache]: Analyzing trace with hash 624907710, now seen corresponding path program 1 times [2018-01-31 09:29:45,113 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:45,113 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:45,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:45,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:45,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:45,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:45,336 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:45,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:29:45,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:29:45,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:29:45,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:29:45,347 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 4 states. [2018-01-31 09:29:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:45,714 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-01-31 09:29:45,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:29:45,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-31 09:29:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:45,729 INFO L225 Difference]: With dead ends: 108 [2018-01-31 09:29:45,730 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 09:29:45,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:29:45,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 09:29:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-31 09:29:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 09:29:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-31 09:29:45,781 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 15 [2018-01-31 09:29:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:45,782 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-31 09:29:45,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:29:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-31 09:29:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:29:45,783 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:45,783 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:29:45,783 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:45,783 INFO L82 PathProgramCache]: Analyzing trace with hash 624907712, now seen corresponding path program 1 times [2018-01-31 09:29:45,783 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:45,783 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:45,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:45,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:45,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:45,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:45,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:45,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:29:45,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:29:45,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:29:45,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:29:45,977 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 6 states. [2018-01-31 09:29:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:46,149 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-31 09:29:46,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:29:46,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-31 09:29:46,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:46,151 INFO L225 Difference]: With dead ends: 78 [2018-01-31 09:29:46,152 INFO L226 Difference]: Without dead ends: 77 [2018-01-31 09:29:46,152 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:29:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-31 09:29:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-31 09:29:46,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 09:29:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-31 09:29:46,167 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 15 [2018-01-31 09:29:46,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:46,167 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-31 09:29:46,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:29:46,168 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-31 09:29:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:29:46,168 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:46,168 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:29:46,168 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:46,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2102697119, now seen corresponding path program 1 times [2018-01-31 09:29:46,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:46,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:46,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:46,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:46,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:46,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:46,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:46,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:29:46,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:29:46,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:29:46,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:29:46,220 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 4 states. [2018-01-31 09:29:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:46,335 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-01-31 09:29:46,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:29:46,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-31 09:29:46,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:46,337 INFO L225 Difference]: With dead ends: 77 [2018-01-31 09:29:46,338 INFO L226 Difference]: Without dead ends: 76 [2018-01-31 09:29:46,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:29:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-31 09:29:46,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-31 09:29:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 09:29:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-31 09:29:46,345 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 16 [2018-01-31 09:29:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:46,345 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-31 09:29:46,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:29:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-31 09:29:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:29:46,346 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:46,346 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:29:46,346 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2102697117, now seen corresponding path program 1 times [2018-01-31 09:29:46,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:46,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:46,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:46,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:46,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:46,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:46,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:46,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:29:46,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:29:46,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:29:46,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:29:46,541 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 5 states. [2018-01-31 09:29:46,838 WARN L143 SmtUtils]: Spent 136ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 09:29:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:46,874 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-01-31 09:29:46,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:29:46,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-31 09:29:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:46,876 INFO L225 Difference]: With dead ends: 76 [2018-01-31 09:29:46,876 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 09:29:46,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:29:46,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 09:29:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-31 09:29:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 09:29:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-31 09:29:46,883 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 16 [2018-01-31 09:29:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:46,883 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-31 09:29:46,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:29:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-31 09:29:46,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:29:46,884 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:46,885 INFO L351 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-31 09:29:46,885 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:46,885 INFO L82 PathProgramCache]: Analyzing trace with hash 435034608, now seen corresponding path program 1 times [2018-01-31 09:29:46,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:46,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:46,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:46,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:46,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:46,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:47,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:47,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:29:47,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:29:47,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:29:47,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:29:47,174 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-01-31 09:29:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:47,304 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-01-31 09:29:47,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:29:47,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-31 09:29:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:47,308 INFO L225 Difference]: With dead ends: 81 [2018-01-31 09:29:47,308 INFO L226 Difference]: Without dead ends: 79 [2018-01-31 09:29:47,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:29:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-31 09:29:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-01-31 09:29:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 09:29:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-31 09:29:47,317 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 21 [2018-01-31 09:29:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:47,317 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-31 09:29:47,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:29:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-31 09:29:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:29:47,318 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:47,318 INFO L351 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-31 09:29:47,318 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:47,318 INFO L82 PathProgramCache]: Analyzing trace with hash 435034610, now seen corresponding path program 1 times [2018-01-31 09:29:47,319 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:47,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:47,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:47,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:47,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:47,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:47,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:47,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:29:47,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:29:47,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:29:47,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:29:47,485 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 8 states. [2018-01-31 09:29:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:47,755 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-01-31 09:29:47,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:29:47,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-31 09:29:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:47,760 INFO L225 Difference]: With dead ends: 104 [2018-01-31 09:29:47,760 INFO L226 Difference]: Without dead ends: 102 [2018-01-31 09:29:47,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:29:47,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-31 09:29:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2018-01-31 09:29:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 09:29:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-01-31 09:29:47,768 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 21 [2018-01-31 09:29:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:47,768 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-01-31 09:29:47,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:29:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-01-31 09:29:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 09:29:47,769 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:47,769 INFO L351 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, 1, 1] [2018-01-31 09:29:47,769 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:47,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2094903939, now seen corresponding path program 1 times [2018-01-31 09:29:47,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:47,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:47,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:47,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:47,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:47,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:47,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:47,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:29:47,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:29:47,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:29:47,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:29:47,832 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 6 states. [2018-01-31 09:29:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:48,028 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2018-01-31 09:29:48,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:29:48,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-31 09:29:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:48,030 INFO L225 Difference]: With dead ends: 84 [2018-01-31 09:29:48,030 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 09:29:48,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:29:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 09:29:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-31 09:29:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 09:29:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-31 09:29:48,038 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 24 [2018-01-31 09:29:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:48,038 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-31 09:29:48,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:29:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-31 09:29:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 09:29:48,039 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:48,039 INFO L351 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, 1, 1] [2018-01-31 09:29:48,039 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2094903937, now seen corresponding path program 1 times [2018-01-31 09:29:48,040 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:48,040 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:48,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:48,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:48,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:48,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:48,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:48,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:29:48,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:29:48,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:29:48,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:29:48,190 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 9 states. [2018-01-31 09:29:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:48,361 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-01-31 09:29:48,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:29:48,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-31 09:29:48,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:48,363 INFO L225 Difference]: With dead ends: 86 [2018-01-31 09:29:48,363 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 09:29:48,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:29:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 09:29:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-01-31 09:29:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 09:29:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-01-31 09:29:48,370 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 24 [2018-01-31 09:29:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:48,370 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-01-31 09:29:48,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:29:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-01-31 09:29:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 09:29:48,371 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:48,372 INFO L351 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, 1, 1, 1] [2018-01-31 09:29:48,372 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:48,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2072569026, now seen corresponding path program 1 times [2018-01-31 09:29:48,372 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:48,372 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:48,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:48,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:48,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:48,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:48,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:48,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:29:48,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:29:48,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:29:48,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:29:48,496 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 6 states. [2018-01-31 09:29:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:48,718 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-01-31 09:29:48,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:29:48,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 09:29:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:48,719 INFO L225 Difference]: With dead ends: 83 [2018-01-31 09:29:48,719 INFO L226 Difference]: Without dead ends: 65 [2018-01-31 09:29:48,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:29:48,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-31 09:29:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-31 09:29:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-31 09:29:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-31 09:29:48,726 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 25 [2018-01-31 09:29:48,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:48,726 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-31 09:29:48,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:29:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-31 09:29:48,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:29:48,727 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:48,727 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:29:48,727 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:48,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1979237878, now seen corresponding path program 1 times [2018-01-31 09:29:48,728 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:48,728 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:48,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:48,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:48,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:48,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:48,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:48,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:29:48,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:29:48,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:29:48,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:29:48,832 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 8 states. [2018-01-31 09:29:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:48,917 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-01-31 09:29:48,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:29:48,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-31 09:29:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:48,931 INFO L225 Difference]: With dead ends: 80 [2018-01-31 09:29:48,931 INFO L226 Difference]: Without dead ends: 79 [2018-01-31 09:29:48,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:29:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-31 09:29:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2018-01-31 09:29:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 09:29:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-01-31 09:29:48,937 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 31 [2018-01-31 09:29:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:48,938 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-01-31 09:29:48,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:29:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-01-31 09:29:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:29:48,948 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:48,948 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:29:48,948 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:48,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1979237876, now seen corresponding path program 1 times [2018-01-31 09:29:48,948 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:48,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:48,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:48,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:48,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:48,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:49,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:49,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:29:49,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:29:49,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:29:49,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:29:49,111 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 6 states. [2018-01-31 09:29:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:49,161 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-01-31 09:29:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:29:49,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-31 09:29:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:49,162 INFO L225 Difference]: With dead ends: 71 [2018-01-31 09:29:49,162 INFO L226 Difference]: Without dead ends: 69 [2018-01-31 09:29:49,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:29:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-31 09:29:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-31 09:29:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-31 09:29:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-01-31 09:29:49,165 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 31 [2018-01-31 09:29:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:49,166 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-01-31 09:29:49,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:29:49,166 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-01-31 09:29:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:29:49,167 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:49,167 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:29:49,167 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash 200225437, now seen corresponding path program 1 times [2018-01-31 09:29:49,168 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:49,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:49,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:49,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:49,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:49,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:49,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:49,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:29:49,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:29:49,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:29:49,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:29:49,246 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 7 states. [2018-01-31 09:29:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:49,355 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-31 09:29:49,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:29:49,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-31 09:29:49,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:49,356 INFO L225 Difference]: With dead ends: 69 [2018-01-31 09:29:49,356 INFO L226 Difference]: Without dead ends: 68 [2018-01-31 09:29:49,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:29:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-31 09:29:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-31 09:29:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-31 09:29:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-01-31 09:29:49,363 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 32 [2018-01-31 09:29:49,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:49,363 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-01-31 09:29:49,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:29:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-01-31 09:29:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:29:49,364 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:49,364 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:29:49,364 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:49,364 INFO L82 PathProgramCache]: Analyzing trace with hash 200225439, now seen corresponding path program 1 times [2018-01-31 09:29:49,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:49,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:49,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:49,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:49,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:49,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:49,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:29:49,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 09:29:49,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:29:49,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:29:49,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:29:49,719 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 10 states. [2018-01-31 09:29:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:49,934 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-01-31 09:29:49,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:29:49,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-31 09:29:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:49,983 INFO L225 Difference]: With dead ends: 80 [2018-01-31 09:29:49,983 INFO L226 Difference]: Without dead ends: 72 [2018-01-31 09:29:49,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:29:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-31 09:29:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-01-31 09:29:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 09:29:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-31 09:29:49,988 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 32 [2018-01-31 09:29:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:49,988 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-31 09:29:49,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:29:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-31 09:29:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 09:29:49,989 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:49,990 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:29:49,990 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:49,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1780045537, now seen corresponding path program 1 times [2018-01-31 09:29:49,990 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:49,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:49,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:49,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:49,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:50,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:50,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:50,219 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:29:50,219 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:29:50,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:50,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:29:50,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 13 [2018-01-31 09:29:50,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:29:50,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:29:50,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-31 09:29:50,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-31 09:29:50,642 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 11 treesize of output 10 [2018-01-31 09:29:50,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:29:50,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:29:50,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:29:50,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-31 09:29:51,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-31 09:29:51,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 09:29:51,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:29:51,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:29:51,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:29:51,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-31 09:29:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:51,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:29:51,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-01-31 09:29:51,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 09:29:51,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 09:29:51,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=297, Unknown=3, NotChecked=0, Total=342 [2018-01-31 09:29:51,304 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 19 states. [2018-01-31 09:29:52,393 WARN L146 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 61 DAG size of output 44 [2018-01-31 09:29:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:29:52,774 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-01-31 09:29:52,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:29:52,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-01-31 09:29:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:29:52,775 INFO L225 Difference]: With dead ends: 89 [2018-01-31 09:29:52,775 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 09:29:52,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=121, Invalid=632, Unknown=3, NotChecked=0, Total=756 [2018-01-31 09:29:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 09:29:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2018-01-31 09:29:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 09:29:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-31 09:29:52,779 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 36 [2018-01-31 09:29:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:29:52,779 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-31 09:29:52,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 09:29:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-31 09:29:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 09:29:52,780 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:29:52,780 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:29:52,780 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:29:52,781 INFO L82 PathProgramCache]: Analyzing trace with hash -624282064, now seen corresponding path program 1 times [2018-01-31 09:29:52,781 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:29:52,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:29:52,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:52,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:52,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:29:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:52,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:29:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:53,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:29:53,408 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:29:53,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:29:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:29:53,450 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:29:53,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 13 [2018-01-31 09:29:53,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:29:53,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 09:29:53,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:17 [2018-01-31 09:29:53,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 13 [2018-01-31 09:29:53,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:29:53,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2018-01-31 09:29:53,565 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 27 treesize of output 26 [2018-01-31 09:29:53,565 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 09:29:53,628 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 26 treesize of output 25 [2018-01-31 09:29:53,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 09:29:53,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 23 treesize of output 21 [2018-01-31 09:29:53,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 09:29:53,650 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:29:53,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-31 09:29:53,712 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:38, output treesize:31 [2018-01-31 09:29:54,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-31 09:29:54,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 09:29:54,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:29:54,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:29:54,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-31 09:29:54,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:63 [2018-01-31 09:29:55,649 WARN L143 SmtUtils]: Spent 1248ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-31 09:29:57,604 WARN L143 SmtUtils]: Spent 1904ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-31 09:29:57,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-31 09:29:57,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 09:29:57,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:29:57,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:29:57,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-31 09:29:57,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-01-31 09:29:57,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 09:29:57,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:29:57,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:29:57,673 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:62, output treesize:24 [2018-01-31 09:29:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:29:57,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:29:57,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2018-01-31 09:29:57,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 09:29:57,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 09:29:57,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=738, Unknown=3, NotChecked=0, Total=812 [2018-01-31 09:29:57,755 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 29 states. [2018-01-31 09:29:59,194 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 86 DAG size of output 64 [2018-01-31 09:30:00,911 WARN L146 SmtUtils]: Spent 1457ms on a formula simplification. DAG size of input: 74 DAG size of output 66 [2018-01-31 09:30:03,837 WARN L146 SmtUtils]: Spent 2867ms on a formula simplification. DAG size of input: 65 DAG size of output 60 [2018-01-31 09:30:05,971 WARN L146 SmtUtils]: Spent 2098ms on a formula simplification. DAG size of input: 70 DAG size of output 65 [2018-01-31 09:30:06,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:30:06,618 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-01-31 09:30:06,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 09:30:06,618 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2018-01-31 09:30:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:30:06,619 INFO L225 Difference]: With dead ends: 87 [2018-01-31 09:30:06,619 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 09:30:06,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=305, Invalid=2042, Unknown=5, NotChecked=0, Total=2352 [2018-01-31 09:30:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 09:30:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-01-31 09:30:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 09:30:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-31 09:30:06,626 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 39 [2018-01-31 09:30:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:30:06,626 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-31 09:30:06,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 09:30:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-31 09:30:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 09:30:06,627 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:30:06,627 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:30:06,627 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:30:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1741415461, now seen corresponding path program 1 times [2018-01-31 09:30:06,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:30:06,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:30:06,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:30:06,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:30:06,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:30:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:30:06,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:30:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:30:06,762 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:30:06,762 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:30:06,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:30:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:30:06,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:30:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:30:06,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:30:06,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2018-01-31 09:30:06,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:30:06,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:30:06,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:30:06,827 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 12 states. [2018-01-31 09:30:06,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:30:06,992 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-31 09:30:06,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:30:06,993 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-01-31 09:30:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:30:06,993 INFO L225 Difference]: With dead ends: 77 [2018-01-31 09:30:06,993 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 09:30:06,993 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:30:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 09:30:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-01-31 09:30:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-31 09:30:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-01-31 09:30:06,999 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 46 [2018-01-31 09:30:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:30:06,999 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-01-31 09:30:07,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:30:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-01-31 09:30:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 09:30:07,000 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:30:07,001 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:30:07,001 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:30:07,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1417665104, now seen corresponding path program 1 times [2018-01-31 09:30:07,001 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:30:07,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:30:07,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:30:07,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:30:07,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:30:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:30:07,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:30:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:30:07,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:30:07,591 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:30:07,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:30:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:30:07,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:30:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:30:07,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:30:07,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 14 [2018-01-31 09:30:07,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:30:07,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:30:07,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:30:07,761 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 15 states. [2018-01-31 09:30:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:30:08,045 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-01-31 09:30:08,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:30:08,046 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-01-31 09:30:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:30:08,046 INFO L225 Difference]: With dead ends: 70 [2018-01-31 09:30:08,046 INFO L226 Difference]: Without dead ends: 62 [2018-01-31 09:30:08,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-01-31 09:30:08,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-31 09:30:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-31 09:30:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-31 09:30:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-01-31 09:30:08,051 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 47 [2018-01-31 09:30:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:30:08,051 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-01-31 09:30:08,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:30:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-01-31 09:30:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 09:30:08,052 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:30:08,052 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:30:08,052 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:30:08,052 INFO L82 PathProgramCache]: Analyzing trace with hash 633126418, now seen corresponding path program 2 times [2018-01-31 09:30:08,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:30:08,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:30:08,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:30:08,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:30:08,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:30:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:30:08,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:30:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:30:08,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:30:08,681 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:30:08,686 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:30:08,697 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:30:08,705 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:30:08,708 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:30:08,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:30:08,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 13 [2018-01-31 09:30:08,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:30:08,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:30:08,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-31 09:30:08,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-31 09:30:08,789 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 11 treesize of output 10 [2018-01-31 09:30:08,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:30:08,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:30:08,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:30:08,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-31 09:30:10,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-31 09:30:10,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:30:10,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-01-31 09:30:10,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:30:10,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:30:10,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:30:10,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:43 [2018-01-31 09:30:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:30:10,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:30:10,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-01-31 09:30:10,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 09:30:10,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 09:30:10,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=726, Unknown=7, NotChecked=0, Total=812 [2018-01-31 09:30:10,381 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 29 states. [2018-01-31 09:30:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:30:12,013 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-01-31 09:30:12,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 09:30:12,013 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-01-31 09:30:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:30:12,014 INFO L225 Difference]: With dead ends: 68 [2018-01-31 09:30:12,014 INFO L226 Difference]: Without dead ends: 67 [2018-01-31 09:30:12,015 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=299, Invalid=1856, Unknown=7, NotChecked=0, Total=2162 [2018-01-31 09:30:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-31 09:30:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2018-01-31 09:30:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-31 09:30:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-01-31 09:30:12,021 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 51 [2018-01-31 09:30:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:30:12,022 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-01-31 09:30:12,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 09:30:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-01-31 09:30:12,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 09:30:12,023 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:30:12,023 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:30:12,023 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:30:12,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2026916513, now seen corresponding path program 2 times [2018-01-31 09:30:12,023 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:30:12,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:30:12,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:30:12,026 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:30:12,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:30:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:30:12,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:30:12,623 WARN L146 SmtUtils]: Spent 305ms on a formula simplification. DAG size of input: 18 DAG size of output 13 [2018-01-31 09:30:12,979 WARN L146 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 20 DAG size of output 18 [2018-01-31 09:30:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:30:13,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:30:13,304 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:30:13,310 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:30:13,323 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:30:13,331 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:30:13,334 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:30:13,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:30:13,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:30:13,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:30:13,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:30:13,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:30:13,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-31 09:30:13,400 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-01-31 09:30:13,402 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_1 term size 6 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-31 09:30:13,405 INFO L168 Benchmark]: Toolchain (without parser) took 82989.35 ms. Allocated memory was 304.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 260.8 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 360.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:30:13,406 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 304.1 MB. Free memory is still 268.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:30:13,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.64 ms. Allocated memory is still 304.1 MB. Free memory was 260.8 MB in the beginning and 250.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:30:13,406 INFO L168 Benchmark]: Boogie Preprocessor took 52.63 ms. Allocated memory is still 304.1 MB. Free memory was 250.8 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:30:13,407 INFO L168 Benchmark]: RCFGBuilder took 682.17 ms. Allocated memory is still 304.1 MB. Free memory was 248.7 MB in the beginning and 227.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:30:13,407 INFO L168 Benchmark]: IcfgTransformer took 53436.28 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 227.8 MB in the beginning and 1.2 GB in the end (delta: -992.1 MB). Peak memory consumption was 872.8 MB. Max. memory is 5.3 GB. [2018-01-31 09:30:13,407 INFO L168 Benchmark]: TraceAbstraction took 28495.33 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 89.1 MB). Free memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: -634.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:30:13,409 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.22 ms. Allocated memory is still 304.1 MB. Free memory is still 268.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 306.64 ms. Allocated memory is still 304.1 MB. Free memory was 260.8 MB in the beginning and 250.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.63 ms. Allocated memory is still 304.1 MB. Free memory was 250.8 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 682.17 ms. Allocated memory is still 304.1 MB. Free memory was 248.7 MB in the beginning and 227.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 53436.28 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 227.8 MB in the beginning and 1.2 GB in the end (delta: -992.1 MB). Peak memory consumption was 872.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 28495.33 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 89.1 MB). Free memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: -634.9 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 74 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2098 LocStat_NO_SUPPORTING_DISEQUALITIES : 1175 LocStat_NO_DISJUNCTIONS : -148 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 98 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 159 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 104 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.401814 RENAME_VARIABLES(MILLISECONDS) : 0.008768 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.517783 PROJECTAWAY(MILLISECONDS) : 1.094312 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.057143 DISJOIN(MILLISECONDS) : 0.325071 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.018531 ADD_EQUALITY(MILLISECONDS) : 0.007143 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007991 #CONJOIN_DISJUNCTIVE : 792 #RENAME_VARIABLES : 1708 #UNFREEZE : 0 #CONJOIN : 1108 #PROJECTAWAY : 992 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 318 #RENAME_VARIABLES_DISJUNCTIVE : 1646 #ADD_EQUALITY : 161 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 2 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_1 term size 6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_1 term size 6: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-30-13-419.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-30-13-419.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-30-13-419.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-30-13-419.csv Received shutdown request...