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/cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:58:25,214 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:58:25,216 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:58:25,231 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:58:25,231 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:58:25,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:58:25,233 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:58:25,235 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:58:25,236 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:58:25,237 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:58:25,238 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:58:25,238 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:58:25,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:58:25,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:58:25,241 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:58:25,243 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:58:25,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:58:25,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:58:25,249 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:58:25,250 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:58:25,252 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:58:25,252 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:58:25,253 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:58:25,254 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:58:25,255 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:58:25,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:58:25,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:58:25,257 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:58:25,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:58:25,257 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:58:25,258 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:58:25,258 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:58:25,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:58:25,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:58:25,269 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:58:25,269 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:58:25,269 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:58:25,269 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:58:25,269 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:58:25,270 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:58:25,270 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:58:25,270 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:58:25,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:58:25,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:58:25,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:58:25,271 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:58:25,271 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:58:25,272 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:58:25,272 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:58:25,272 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:58:25,272 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:58:25,272 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:58:25,273 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:58:25,273 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:58:25,273 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:58:25,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:58:25,273 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:58:25,273 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:58:25,274 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:58:25,274 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:58:25,274 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:58:25,274 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:58:25,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:58:25,275 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:58:25,275 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:58:25,276 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:58:25,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:58:25,322 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:58:25,326 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:58:25,328 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:58:25,328 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:58:25,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-30 00:58:25,536 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:58:25,541 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 00:58:25,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:58:25,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:58:25,547 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:58:25,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:58:25" (1/1) ... [2018-01-30 00:58:25,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67990aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:58:25, skipping insertion in model container [2018-01-30 00:58:25,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:58:25" (1/1) ... [2018-01-30 00:58:25,567 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:58:25,606 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:58:25,724 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:58:25,745 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:58:25,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:58:25 WrapperNode [2018-01-30 00:58:25,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:58:25,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:58:25,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:58:25,752 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:58:25,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:58:25" (1/1) ... [2018-01-30 00:58:25,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:58:25" (1/1) ... [2018-01-30 00:58:25,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:58:25" (1/1) ... [2018-01-30 00:58:25,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:58:25" (1/1) ... [2018-01-30 00:58:25,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:58:25" (1/1) ... [2018-01-30 00:58:25,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:58:25" (1/1) ... [2018-01-30 00:58:25,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:58:25" (1/1) ... [2018-01-30 00:58:25,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:58:25,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:58:25,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:58:25,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:58:25,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:58:25" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:58:25,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:58:25,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:58:25,829 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-30 00:58:25,829 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:58:25,829 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:58:25,829 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:58:25,829 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:58:25,829 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:58:25,830 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:58:25,830 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:58:25,830 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-30 00:58:25,830 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:58:25,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:58:25,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:58:26,061 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:58:26,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:58:26 BoogieIcfgContainer [2018-01-30 00:58:26,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:58:26,062 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 00:58:26,062 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 00:58:26,063 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 00:58:26,066 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:58:26" (1/1) ... [2018-01-30 00:58:26,073 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 00:58:26,073 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 00:58:26,074 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 00:58:26,119 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 00:58:26,151 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 00:58:26,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 00:59:32,212 INFO L311 AbstractInterpreter]: Visited 96 different actions 874 times. Merged at 65 different actions 517 times. Never widened. Found 41 fixpoints after 6 different actions. Largest state had 59 variables. [2018-01-30 00:59:32,214 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 00:59:32,223 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-30 00:59:32,224 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 00:59:32,224 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 00:59:32,224 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_3| v_cstrcmp_~s2.base_2) v_cstrcmp_~s2.offset_2), at (SUMMARY for call #t~mem2 := read~int(~s2.base, ~s2.offset, 1); srcloc: L543'''')) ((select (select |v_#memory_int_2| v_cstrcmp_~s1.base_5) v_cstrcmp_~s1.offset_4), at (SUMMARY for call #t~mem1 := read~int(~s1.base, ~s1.offset, 1); srcloc: L543''')) ((select |v_#memory_int_11| v_main_~nondetString2~4.base_2), at (SUMMARY for call write~int(0, ~nondetString2~4.base, ~nondetString2~4.offset + (~length2~4 - 1) * 1, 1); srcloc: L562')) ((select (select |v_#memory_int_5| v_cstrcmp_~s2.base_7) v_cstrcmp_~s2.offset_6), at (SUMMARY for call #t~mem7 := read~int(~s2.base, ~s2.offset, 1); srcloc: L548)) ((select (select |v_#memory_int_4| v_cstrcmp_~s1.base_10) v_cstrcmp_~s1.offset_8), at (SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 1); srcloc: L543'''''''''''''''''')) ((select |v_#memory_int_9| v_main_~nondetString1~4.base_2), at (SUMMARY for call write~int(0, ~nondetString1~4.base, ~nondetString1~4.offset + (~length1~4 - 1) * 1, 1); srcloc: L562)) ((select (select |v_#memory_int_1| v_cstrcmp_~s1.base_2) v_cstrcmp_~s1.offset_2), at (SUMMARY for call #t~mem0 := read~int(~s1.base, ~s1.offset, 1); srcloc: L543)) [2018-01-30 00:59:32,252 INFO L547 PartitionManager]: partitioning result: [2018-01-30 00:59:32,253 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 00:59:32,253 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 00:59:32,253 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-30 00:59:32,253 INFO L563 PartitionManager]: # location blocks :3 [2018-01-30 00:59:32,253 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 00:59:32,253 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 00:59:32,253 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 00:59:32,343 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 00:59:32,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 12:59:32 BasicIcfg [2018-01-30 00:59:32,360 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 00:59:32,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:59:32,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:59:32,363 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:59:32,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:58:25" (1/4) ... [2018-01-30 00:59:32,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e28730b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:59:32, skipping insertion in model container [2018-01-30 00:59:32,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:58:25" (2/4) ... [2018-01-30 00:59:32,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e28730b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:59:32, skipping insertion in model container [2018-01-30 00:59:32,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:58:26" (3/4) ... [2018-01-30 00:59:32,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e28730b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:59:32, skipping insertion in model container [2018-01-30 00:59:32,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 12:59:32" (4/4) ... [2018-01-30 00:59:32,366 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 00:59:32,373 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:59:32,378 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-30 00:59:32,407 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:59:32,407 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:59:32,407 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:59:32,407 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:59:32,407 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:59:32,408 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:59:32,408 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:59:32,408 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:59:32,408 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:59:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2018-01-30 00:59:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 00:59:32,424 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:32,425 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:59:32,425 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:32,429 INFO L82 PathProgramCache]: Analyzing trace with hash 721071450, now seen corresponding path program 1 times [2018-01-30 00:59:32,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:32,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:32,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:32,475 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:32,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:32,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:59:32,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:59:32,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:59:32,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:59:32,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:59:32,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:59:32,637 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2018-01-30 00:59:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:32,736 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-01-30 00:59:32,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:59:32,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-30 00:59:32,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:32,747 INFO L225 Difference]: With dead ends: 117 [2018-01-30 00:59:32,748 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 00:59:32,751 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:59:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 00:59:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-30 00:59:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 00:59:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-30 00:59:32,784 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 15 [2018-01-30 00:59:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:32,785 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-30 00:59:32,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:59:32,785 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-30 00:59:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 00:59:32,786 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:32,786 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:59:32,786 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:32,786 INFO L82 PathProgramCache]: Analyzing trace with hash 721071452, now seen corresponding path program 1 times [2018-01-30 00:59:32,786 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:32,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:32,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:32,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:32,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:32,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:59:32,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:59:32,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:59:32,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:59:32,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:59:32,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:59:32,923 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 6 states. [2018-01-30 00:59:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:32,986 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-30 00:59:32,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:59:32,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-30 00:59:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:32,988 INFO L225 Difference]: With dead ends: 84 [2018-01-30 00:59:32,988 INFO L226 Difference]: Without dead ends: 83 [2018-01-30 00:59:32,989 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:59:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-30 00:59:32,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-30 00:59:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 00:59:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-01-30 00:59:32,997 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 15 [2018-01-30 00:59:32,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:32,998 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-01-30 00:59:32,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:59:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-01-30 00:59:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 00:59:32,999 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:32,999 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:59:32,999 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:32,999 INFO L82 PathProgramCache]: Analyzing trace with hash 878378849, now seen corresponding path program 1 times [2018-01-30 00:59:32,999 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:33,000 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:33,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:33,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:33,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:33,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:59:33,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:59:33,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:59:33,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:59:33,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:59:33,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:59:33,039 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 4 states. [2018-01-30 00:59:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:33,123 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-01-30 00:59:33,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:59:33,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 00:59:33,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:33,125 INFO L225 Difference]: With dead ends: 83 [2018-01-30 00:59:33,125 INFO L226 Difference]: Without dead ends: 82 [2018-01-30 00:59:33,126 INFO L553 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-30 00:59:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-30 00:59:33,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-30 00:59:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-30 00:59:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-01-30 00:59:33,133 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 16 [2018-01-30 00:59:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:33,133 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-01-30 00:59:33,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:59:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-01-30 00:59:33,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 00:59:33,134 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:33,134 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:59:33,135 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:33,135 INFO L82 PathProgramCache]: Analyzing trace with hash 878378851, now seen corresponding path program 1 times [2018-01-30 00:59:33,135 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:33,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:33,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:33,136 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:33,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:33,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:59:33,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:59:33,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:59:33,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:59:33,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:59:33,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:59:33,217 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 5 states. [2018-01-30 00:59:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:33,258 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-01-30 00:59:33,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:59:33,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 00:59:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:33,259 INFO L225 Difference]: With dead ends: 82 [2018-01-30 00:59:33,259 INFO L226 Difference]: Without dead ends: 81 [2018-01-30 00:59:33,259 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:59:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-30 00:59:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-30 00:59:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-30 00:59:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-30 00:59:33,267 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 16 [2018-01-30 00:59:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:33,267 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-30 00:59:33,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:59:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-30 00:59:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 00:59:33,268 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:33,268 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:59:33,268 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:33,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1680232304, now seen corresponding path program 1 times [2018-01-30 00:59:33,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:33,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:33,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:33,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:33,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:33,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:59:33,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:59:33,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:59:33,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:59:33,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:59:33,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:59:33,318 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 5 states. [2018-01-30 00:59:33,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:33,402 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-01-30 00:59:33,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:59:33,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-30 00:59:33,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:33,403 INFO L225 Difference]: With dead ends: 85 [2018-01-30 00:59:33,403 INFO L226 Difference]: Without dead ends: 82 [2018-01-30 00:59:33,404 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:59:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-30 00:59:33,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-01-30 00:59:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-30 00:59:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-30 00:59:33,410 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 23 [2018-01-30 00:59:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:33,410 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-30 00:59:33,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:59:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-30 00:59:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 00:59:33,411 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:33,411 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:59:33,412 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1680232306, now seen corresponding path program 1 times [2018-01-30 00:59:33,412 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:33,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:33,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:33,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:33,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:33,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:59:33,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:59:33,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:59:33,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:59:33,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:59:33,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:59:33,540 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2018-01-30 00:59:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:33,671 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-01-30 00:59:33,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:59:33,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-30 00:59:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:33,674 INFO L225 Difference]: With dead ends: 117 [2018-01-30 00:59:33,675 INFO L226 Difference]: Without dead ends: 114 [2018-01-30 00:59:33,675 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:59:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-30 00:59:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2018-01-30 00:59:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-30 00:59:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-01-30 00:59:33,683 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 23 [2018-01-30 00:59:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:33,683 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-01-30 00:59:33,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:59:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-01-30 00:59:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:59:33,685 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:33,685 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:59:33,685 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1909331500, now seen corresponding path program 1 times [2018-01-30 00:59:33,685 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:33,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:33,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:33,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:33,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:33,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:59:33,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:59:33,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:59:33,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:59:33,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:59:33,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:59:33,817 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 6 states. [2018-01-30 00:59:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:34,002 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-01-30 00:59:34,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:59:34,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 00:59:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:34,003 INFO L225 Difference]: With dead ends: 92 [2018-01-30 00:59:34,003 INFO L226 Difference]: Without dead ends: 74 [2018-01-30 00:59:34,003 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-30 00:59:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-30 00:59:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-30 00:59:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-30 00:59:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-01-30 00:59:34,009 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 25 [2018-01-30 00:59:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:34,009 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-01-30 00:59:34,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:59:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-01-30 00:59:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:59:34,010 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:34,010 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:59:34,011 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1096403464, now seen corresponding path program 1 times [2018-01-30 00:59:34,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:34,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:34,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:34,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:34,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:34,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:59:34,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:59:34,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:59:34,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:59:34,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:59:34,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:59:34,084 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 5 states. [2018-01-30 00:59:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:34,134 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-30 00:59:34,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:59:34,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-30 00:59:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:34,135 INFO L225 Difference]: With dead ends: 97 [2018-01-30 00:59:34,135 INFO L226 Difference]: Without dead ends: 95 [2018-01-30 00:59:34,136 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:59:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-30 00:59:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-01-30 00:59:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 00:59:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-30 00:59:34,141 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 27 [2018-01-30 00:59:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:34,141 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-30 00:59:34,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:59:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-30 00:59:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:59:34,142 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:34,142 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:59:34,143 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:34,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1096403466, now seen corresponding path program 1 times [2018-01-30 00:59:34,143 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:34,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:34,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:34,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:34,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:34,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:59:34,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:59:34,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:59:34,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:59:34,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:59:34,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:59:34,239 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 8 states. [2018-01-30 00:59:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:34,341 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-30 00:59:34,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:59:34,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-01-30 00:59:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:34,342 INFO L225 Difference]: With dead ends: 97 [2018-01-30 00:59:34,342 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 00:59:34,342 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:59:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 00:59:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-01-30 00:59:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-30 00:59:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-01-30 00:59:34,347 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 27 [2018-01-30 00:59:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:34,347 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-01-30 00:59:34,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:59:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-01-30 00:59:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:59:34,348 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:34,348 INFO L350 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, 1, 1] [2018-01-30 00:59:34,349 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash -304279865, now seen corresponding path program 1 times [2018-01-30 00:59:34,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:34,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:34,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:34,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:34,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:34,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:59:34,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:59:34,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:59:34,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:59:34,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:59:34,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:59:34,374 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 3 states. [2018-01-30 00:59:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:34,397 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2018-01-30 00:59:34,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:59:34,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-01-30 00:59:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:34,398 INFO L225 Difference]: With dead ends: 122 [2018-01-30 00:59:34,398 INFO L226 Difference]: Without dead ends: 78 [2018-01-30 00:59:34,399 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:59:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-30 00:59:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-30 00:59:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-30 00:59:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-30 00:59:34,405 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 38 [2018-01-30 00:59:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:34,405 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-30 00:59:34,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:59:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-30 00:59:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-30 00:59:34,406 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:34,406 INFO L350 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, 1, 1, 1, 1, 1] [2018-01-30 00:59:34,407 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:34,407 INFO L82 PathProgramCache]: Analyzing trace with hash -326843980, now seen corresponding path program 1 times [2018-01-30 00:59:34,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:34,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:34,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:34,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:34,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:34,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:59:34,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:59:34,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:59:34,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:59:34,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:59:34,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:59:34,478 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 6 states. [2018-01-30 00:59:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:34,530 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-30 00:59:34,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:59:34,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-30 00:59:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:34,531 INFO L225 Difference]: With dead ends: 78 [2018-01-30 00:59:34,531 INFO L226 Difference]: Without dead ends: 77 [2018-01-30 00:59:34,532 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-30 00:59:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-30 00:59:34,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-30 00:59:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 00:59:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-30 00:59:34,536 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 41 [2018-01-30 00:59:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:34,537 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-30 00:59:34,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:59:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-30 00:59:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-30 00:59:34,537 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:34,537 INFO L350 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, 1, 1, 1, 1, 1] [2018-01-30 00:59:34,538 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash -326843978, now seen corresponding path program 1 times [2018-01-30 00:59:34,538 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:34,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:34,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:34,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:34,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:34,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:34,779 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-30 00:59:34,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:59:34,780 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:59:34,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:34,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:59:34,878 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-30 00:59:34,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:59:34,892 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-30 00:59:34,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-30 00:59:34,922 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-30 00:59:34,925 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-30 00:59:34,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:59:34,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:59:34,933 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-30 00:59:34,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-30 00:59:35,044 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 18 treesize of output 14 [2018-01-30 00:59:35,055 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-30 00:59:35,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:59:35,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:59:35,101 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-30 00:59:35,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-30 00:59:35,226 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-30 00:59:35,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:59:35,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-30 00:59:35,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:59:35,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:59:35,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=365, Unknown=3, NotChecked=0, Total=420 [2018-01-30 00:59:35,248 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 21 states. [2018-01-30 00:59:36,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:36,104 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2018-01-30 00:59:36,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 00:59:36,105 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-01-30 00:59:36,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:36,106 INFO L225 Difference]: With dead ends: 125 [2018-01-30 00:59:36,106 INFO L226 Difference]: Without dead ends: 122 [2018-01-30 00:59:36,107 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=831, Unknown=3, NotChecked=0, Total=992 [2018-01-30 00:59:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-30 00:59:36,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2018-01-30 00:59:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-30 00:59:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2018-01-30 00:59:36,114 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 41 [2018-01-30 00:59:36,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:36,115 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2018-01-30 00:59:36,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:59:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2018-01-30 00:59:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:59:36,116 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:36,116 INFO L350 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] [2018-01-30 00:59:36,116 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:36,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1259505076, now seen corresponding path program 1 times [2018-01-30 00:59:36,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:36,117 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:36,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:36,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:36,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:36,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:36,155 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-30 00:59:36,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:59:36,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:59:36,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:59:36,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:59:36,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:59:36,156 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 4 states. [2018-01-30 00:59:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:59:36,209 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-30 00:59:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:59:36,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-01-30 00:59:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:59:36,210 INFO L225 Difference]: With dead ends: 106 [2018-01-30 00:59:36,210 INFO L226 Difference]: Without dead ends: 104 [2018-01-30 00:59:36,211 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-30 00:59:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-30 00:59:36,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2018-01-30 00:59:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-30 00:59:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2018-01-30 00:59:36,217 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 45 [2018-01-30 00:59:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:59:36,218 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2018-01-30 00:59:36,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:59:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-01-30 00:59:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:59:36,219 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:59:36,219 INFO L350 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] [2018-01-30 00:59:36,219 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 00:59:36,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1259505074, now seen corresponding path program 1 times [2018-01-30 00:59:36,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:59:36,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:59:36,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:36,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:36,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:59:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:36,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:59:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:59:36,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:59:36,643 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:59:36,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:59:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:59:36,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:59:36,686 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 14 treesize of output 12 [2018-01-30 00:59:36,688 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 12 treesize of output 15 [2018-01-30 00:59:36,693 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:396) 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-30 00:59:36,696 INFO L168 Benchmark]: Toolchain (without parser) took 71159.69 ms. Allocated memory was 307.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 267.8 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 982.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:59:36,697 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:59:36,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.61 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:59:36,697 INFO L168 Benchmark]: Boogie Preprocessor took 31.20 ms. Allocated memory is still 307.8 MB. Free memory was 256.8 MB in the beginning and 254.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:59:36,697 INFO L168 Benchmark]: RCFGBuilder took 278.69 ms. Allocated memory is still 307.8 MB. Free memory was 254.8 MB in the beginning and 233.1 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:59:36,698 INFO L168 Benchmark]: IcfgTransformer took 66297.53 ms. Allocated memory was 307.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 233.1 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-30 00:59:36,703 INFO L168 Benchmark]: TraceAbstraction took 4334.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.3 GB in the end (delta: 939.5 MB). Peak memory consumption was 939.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:59:36,705 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.61 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.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 31.20 ms. Allocated memory is still 307.8 MB. Free memory was 256.8 MB in the beginning and 254.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 278.69 ms. Allocated memory is still 307.8 MB. Free memory was 254.8 MB in the beginning and 233.1 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 5.3 GB. * IcfgTransformer took 66297.53 ms. Allocated memory was 307.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 233.1 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. * TraceAbstraction took 4334.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.3 GB in the end (delta: 939.5 MB). Peak memory consumption was 939.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 80 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2480 LocStat_NO_SUPPORTING_DISEQUALITIES : 1289 LocStat_NO_DISJUNCTIONS : -160 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 105 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 167 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 113 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.965321 RENAME_VARIABLES(MILLISECONDS) : 0.256778 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.927444 PROJECTAWAY(MILLISECONDS) : 0.071688 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.056779 DISJOIN(MILLISECONDS) : 0.470551 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.279532 ADD_EQUALITY(MILLISECONDS) : 0.008309 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013610 #CONJOIN_DISJUNCTIVE : 1270 #RENAME_VARIABLES : 2851 #UNFREEZE : 0 #CONJOIN : 1822 #PROJECTAWAY : 1652 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 314 #RENAME_VARIABLES_DISJUNCTIVE : 2733 #ADD_EQUALITY : 169 #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/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_00-59-36-716.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_00-59-36-716.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_00-59-36-716.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_00-59-36-716.csv Received shutdown request...