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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:23:46,102 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:23:46,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:23:46,131 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:23:46,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:23:46,132 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:23:46,134 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:23:46,136 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:23:46,138 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:23:46,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:23:46,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:23:46,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:23:46,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:23:46,153 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:23:46,154 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:23:46,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:23:46,162 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:23:46,164 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:23:46,165 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:23:46,169 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:23:46,171 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:23:46,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:23:46,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:23:46,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:23:46,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:23:46,179 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:23:46,179 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:23:46,183 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:23:46,183 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:23:46,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:23:46,184 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:23:46,184 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:23:46,193 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:23:46,193 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:23:46,194 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:23:46,194 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:23:46,194 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:23:46,195 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:23:46,195 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:23:46,195 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:23:46,195 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:23:46,196 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:23:46,196 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:23:46,196 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:23:46,196 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:23:46,196 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:23:46,196 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:23:46,197 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:23:46,197 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:23:46,197 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:23:46,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:23:46,197 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:23:46,198 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:23:46,198 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:23:46,199 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:23:46,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:23:46,199 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:23:46,199 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:23:46,199 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:23:46,200 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:23:46,200 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:23:46,200 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:23:46,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:23:46,200 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:23:46,201 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:23:46,201 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:23:46,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:23:46,262 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:23:46,266 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:23:46,268 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:23:46,268 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:23:46,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-31 09:23:46,469 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:23:46,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:23:46,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:23:46,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:23:46,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:23:46,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:23:46" (1/1) ... [2018-01-31 09:23:46,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b550fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:23:46, skipping insertion in model container [2018-01-31 09:23:46,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:23:46" (1/1) ... [2018-01-31 09:23:46,514 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:23:46,572 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:23:46,742 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:23:46,768 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:23:46,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:23:46 WrapperNode [2018-01-31 09:23:46,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:23:46,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:23:46,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:23:46,789 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:23:46,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:23:46" (1/1) ... [2018-01-31 09:23:46,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:23:46" (1/1) ... [2018-01-31 09:23:46,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:23:46" (1/1) ... [2018-01-31 09:23:46,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:23:46" (1/1) ... [2018-01-31 09:23:46,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:23:46" (1/1) ... [2018-01-31 09:23:46,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:23:46" (1/1) ... [2018-01-31 09:23:46,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:23:46" (1/1) ... [2018-01-31 09:23:46,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:23:46,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:23:46,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:23:46,835 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:23:46,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:23:46" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:23:46,898 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:23:46,898 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:23:46,898 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-01-31 09:23:46,898 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:23:46,898 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:23:46,899 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:23:46,899 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:23:46,899 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:23:46,899 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:23:46,899 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:23:46,899 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-01-31 09:23:46,900 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:23:46,900 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:23:46,900 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:23:47,479 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:23:47,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:23:47 BoogieIcfgContainer [2018-01-31 09:23:47,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:23:47,480 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:23:47,480 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:23:47,481 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:23:47,484 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:23:47" (1/1) ... [2018-01-31 09:23:47,491 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:23:47,491 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:23:47,492 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:23:47,552 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:23:47,594 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:23:47,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:25:10,209 INFO L314 AbstractInterpreter]: Visited 100 different actions 1110 times. Merged at 66 different actions 652 times. Widened at 1 different actions 2 times. Found 84 fixpoints after 15 different actions. Largest state had 62 variables. [2018-01-31 09:25:10,212 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:25:10,230 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-31 09:25:10,231 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:25:10,231 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:25:10,231 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_3| v_cstrpbrk_~s~2.base_3) v_cstrpbrk_~s~2.offset_3), at (SUMMARY for call #t~mem3 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L548)) ((select (select |v_#memory_int_5| v_cstrpbrk_~s~2.base_11) v_cstrpbrk_~s~2.offset_9), at (SUMMARY for call #t~mem7 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L548''''''''''''''')) ((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: L566')) ((select (select |v_#memory_int_4| v_cstrpbrk_~s~2.base_6) v_cstrpbrk_~s~2.offset_5), at (SUMMARY for call #t~mem4 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L548''')) ((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: L566)) ((select (select |v_#memory_int_2| v_cstrpbrk_~sc1~2.base_6) v_cstrpbrk_~sc1~2.offset_5), at (SUMMARY for call #t~mem2 := read~int(~sc1~2.base, ~sc1~2.offset, 1); srcloc: L547)) ((select (select |v_#memory_int_1| v_cstrpbrk_~sc1~2.base_3) v_cstrpbrk_~sc1~2.offset_3), at (SUMMARY for call #t~mem1 := read~int(~sc1~2.base, ~sc1~2.offset, 1); srcloc: L545')) [2018-01-31 09:25:10,263 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:25:10,263 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:25:10,264 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:25:10,264 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-31 09:25:10,264 INFO L564 PartitionManager]: # location blocks :3 [2018-01-31 09:25:10,264 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:25:10,264 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-31 09:25:10,265 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:25:10,265 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:25:10,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:25:10 BasicIcfg [2018-01-31 09:25:10,287 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:25:10,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:25:10,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:25:10,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:25:10,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:23:46" (1/4) ... [2018-01-31 09:25:10,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422d61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:25:10, skipping insertion in model container [2018-01-31 09:25:10,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:23:46" (2/4) ... [2018-01-31 09:25:10,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422d61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:25:10, skipping insertion in model container [2018-01-31 09:25:10,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:23:47" (3/4) ... [2018-01-31 09:25:10,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422d61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:25:10, skipping insertion in model container [2018-01-31 09:25:10,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:25:10" (4/4) ... [2018-01-31 09:25:10,382 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:25:10,389 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:25:10,395 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 09:25:10,438 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:25:10,439 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:25:10,439 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:25:10,439 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:25:10,439 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:25:10,439 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:25:10,440 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:25:10,440 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:25:10,440 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:25:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-01-31 09:25:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:25:10,465 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:25:10,467 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:25:10,467 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:25:10,471 INFO L82 PathProgramCache]: Analyzing trace with hash 162455402, now seen corresponding path program 1 times [2018-01-31 09:25:10,474 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:25:10,474 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:25:10,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:10,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:10,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:10,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:25:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:25:10,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:25:10,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:25:10,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:25:10,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:25:10,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:25:10,853 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-01-31 09:25:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:25:11,167 INFO L93 Difference]: Finished difference Result 147 states and 162 transitions. [2018-01-31 09:25:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:25:11,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-31 09:25:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:25:11,180 INFO L225 Difference]: With dead ends: 147 [2018-01-31 09:25:11,180 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 09:25:11,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:25:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 09:25:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-31 09:25:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 09:25:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-01-31 09:25:11,225 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 15 [2018-01-31 09:25:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:25:11,225 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-01-31 09:25:11,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:25:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-01-31 09:25:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:25:11,226 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:25:11,226 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:25:11,226 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:25:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash 162455404, now seen corresponding path program 1 times [2018-01-31 09:25:11,227 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:25:11,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:25:11,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:11,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:11,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:11,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:25:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:25:11,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:25:11,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:25:11,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:25:11,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:25:11,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:25:11,466 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 6 states. [2018-01-31 09:25:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:25:11,650 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-01-31 09:25:11,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:25:11,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-31 09:25:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:25:11,652 INFO L225 Difference]: With dead ends: 86 [2018-01-31 09:25:11,652 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 09:25:11,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:25:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 09:25:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-31 09:25:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 09:25:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-31 09:25:11,661 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 15 [2018-01-31 09:25:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:25:11,661 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-31 09:25:11,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:25:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-31 09:25:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:25:11,662 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:25:11,662 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:25:11,663 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:25:11,663 INFO L82 PathProgramCache]: Analyzing trace with hash 741150561, now seen corresponding path program 1 times [2018-01-31 09:25:11,663 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:25:11,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:25:11,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:11,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:11,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:11,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:25:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:25:11,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:25:11,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:25:11,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:25:11,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:25:11,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:25:11,726 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 4 states. [2018-01-31 09:25:11,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:25:11,808 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-31 09:25:11,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:25:11,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-31 09:25:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:25:11,810 INFO L225 Difference]: With dead ends: 85 [2018-01-31 09:25:11,810 INFO L226 Difference]: Without dead ends: 84 [2018-01-31 09:25:11,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:25:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-31 09:25:11,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-31 09:25:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 09:25:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-31 09:25:11,818 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2018-01-31 09:25:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:25:11,818 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-31 09:25:11,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:25:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-31 09:25:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:25:11,819 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:25:11,819 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:25:11,819 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:25:11,820 INFO L82 PathProgramCache]: Analyzing trace with hash 741150563, now seen corresponding path program 1 times [2018-01-31 09:25:11,820 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:25:11,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:25:11,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:11,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:11,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:11,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:25:12,171 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 15 DAG size of output 11 [2018-01-31 09:25:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:25:12,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:25:12,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:25:12,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:25:12,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:25:12,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:25:12,173 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 5 states. [2018-01-31 09:25:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:25:12,354 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-01-31 09:25:12,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:25:12,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-31 09:25:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:25:12,356 INFO L225 Difference]: With dead ends: 84 [2018-01-31 09:25:12,357 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 09:25:12,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:25:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 09:25:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-31 09:25:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 09:25:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-31 09:25:12,364 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 16 [2018-01-31 09:25:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:25:12,364 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-31 09:25:12,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:25:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-31 09:25:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 09:25:12,365 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:25:12,366 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:25:12,366 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:25:12,366 INFO L82 PathProgramCache]: Analyzing trace with hash 419239665, now seen corresponding path program 1 times [2018-01-31 09:25:12,366 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:25:12,366 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:25:12,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:12,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:12,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:12,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:25:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:25:12,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:25:12,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:25:12,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:25:12,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:25:12,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:25:12,537 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-01-31 09:25:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:25:12,859 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-31 09:25:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:25:12,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-31 09:25:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:25:12,861 INFO L225 Difference]: With dead ends: 83 [2018-01-31 09:25:12,861 INFO L226 Difference]: Without dead ends: 69 [2018-01-31 09:25:12,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:25:12,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-31 09:25:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-31 09:25:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-31 09:25:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-01-31 09:25:12,870 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 24 [2018-01-31 09:25:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:25:12,870 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-01-31 09:25:12,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:25:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-01-31 09:25:12,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 09:25:12,871 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:25:12,872 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:25:12,872 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:25:12,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1816414242, now seen corresponding path program 1 times [2018-01-31 09:25:12,872 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:25:12,872 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:25:12,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:12,873 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:12,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:12,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:25:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:25:12,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:25:12,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:25:12,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:25:12,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:25:12,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:25:12,965 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 6 states. [2018-01-31 09:25:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:25:13,231 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-01-31 09:25:13,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:25:13,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 09:25:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:25:13,233 INFO L225 Difference]: With dead ends: 73 [2018-01-31 09:25:13,233 INFO L226 Difference]: Without dead ends: 71 [2018-01-31 09:25:13,233 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:25:13,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-31 09:25:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-01-31 09:25:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-31 09:25:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-31 09:25:13,239 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 25 [2018-01-31 09:25:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:25:13,239 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-31 09:25:13,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:25:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-31 09:25:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 09:25:13,240 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:25:13,241 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:25:13,241 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:25:13,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1816414244, now seen corresponding path program 1 times [2018-01-31 09:25:13,241 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:25:13,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:25:13,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:13,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:13,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:13,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:25:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:25:13,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:25:13,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:25:13,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:25:13,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:25:13,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:25:13,459 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-01-31 09:25:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:25:13,576 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-01-31 09:25:13,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:25:13,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-31 09:25:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:25:13,577 INFO L225 Difference]: With dead ends: 105 [2018-01-31 09:25:13,577 INFO L226 Difference]: Without dead ends: 103 [2018-01-31 09:25:13,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:25:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-31 09:25:13,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2018-01-31 09:25:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 09:25:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-01-31 09:25:13,586 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 25 [2018-01-31 09:25:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:25:13,587 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-01-31 09:25:13,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:25:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-01-31 09:25:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 09:25:13,588 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:25:13,588 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:25:13,588 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:25:13,588 INFO L82 PathProgramCache]: Analyzing trace with hash -124406480, now seen corresponding path program 1 times [2018-01-31 09:25:13,588 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:25:13,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:25:13,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:13,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:13,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:13,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:25:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:25:13,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:25:13,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:25:13,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:25:13,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:25:13,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:25:13,728 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 6 states. [2018-01-31 09:25:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:25:13,803 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-31 09:25:13,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:25:13,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-31 09:25:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:25:13,804 INFO L225 Difference]: With dead ends: 78 [2018-01-31 09:25:13,804 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 09:25:13,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:25:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 09:25:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-01-31 09:25:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 09:25:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-31 09:25:13,811 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 33 [2018-01-31 09:25:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:25:13,812 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-31 09:25:13,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:25:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-31 09:25:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 09:25:13,813 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:25:13,813 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:25:13,813 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:25:13,814 INFO L82 PathProgramCache]: Analyzing trace with hash -124406478, now seen corresponding path program 1 times [2018-01-31 09:25:13,814 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:25:13,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:25:13,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:13,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:13,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:13,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:25:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:25:13,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:25:13,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:25:13,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:25:13,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:25:13,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:25:13,967 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2018-01-31 09:25:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:25:14,109 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-01-31 09:25:14,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:25:14,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-01-31 09:25:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:25:14,110 INFO L225 Difference]: With dead ends: 103 [2018-01-31 09:25:14,110 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 09:25:14,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:25:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 09:25:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 83. [2018-01-31 09:25:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 09:25:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-31 09:25:14,118 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 33 [2018-01-31 09:25:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:25:14,118 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-31 09:25:14,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:25:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-31 09:25:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-31 09:25:14,120 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:25:14,120 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:25:14,120 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:25:14,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2033440913, now seen corresponding path program 1 times [2018-01-31 09:25:14,121 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:25:14,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:25:14,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:14,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:14,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:14,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:25:14,216 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-31 09:25:14,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:25:14,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:25:14,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:25:14,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:25:14,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:25:14,218 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 3 states. [2018-01-31 09:25:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:25:14,252 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-01-31 09:25:14,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:25:14,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-31 09:25:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:25:14,259 INFO L225 Difference]: With dead ends: 133 [2018-01-31 09:25:14,260 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 09:25:14,260 INFO L554 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-31 09:25:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 09:25:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-31 09:25:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 09:25:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-31 09:25:14,267 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 44 [2018-01-31 09:25:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:25:14,268 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-31 09:25:14,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:25:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-31 09:25:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 09:25:14,269 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:25:14,269 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:25:14,269 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:25:14,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1413679037, now seen corresponding path program 1 times [2018-01-31 09:25:14,270 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:25:14,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:25:14,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:14,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:14,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:14,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:25:14,489 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-31 09:25:14,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:25:14,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:25:14,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:25:14,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:25:14,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:25:14,490 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-01-31 09:25:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:25:14,561 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-31 09:25:14,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:25:14,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-31 09:25:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:25:14,563 INFO L225 Difference]: With dead ends: 85 [2018-01-31 09:25:14,563 INFO L226 Difference]: Without dead ends: 84 [2018-01-31 09:25:14,563 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:25:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-31 09:25:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-31 09:25:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 09:25:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-31 09:25:14,569 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 46 [2018-01-31 09:25:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:25:14,570 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-31 09:25:14,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:25:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-31 09:25:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 09:25:14,571 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:25:14,571 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:25:14,571 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:25:14,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1413679035, now seen corresponding path program 1 times [2018-01-31 09:25:14,572 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:25:14,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:25:14,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:14,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:14,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:25:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:14,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:25:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:25:14,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:25:14,914 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:25:14,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:25:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:25:14,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:25:15,051 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-31 09:25:15,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-31 09:25:15,089 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_1 term size 6 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-31 09:25:15,092 INFO L168 Benchmark]: Toolchain (without parser) took 88622.36 ms. Allocated memory was 303.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 262.4 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 461.2 MB. Max. memory is 5.3 GB. [2018-01-31 09:25:15,093 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 303.6 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:25:15,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.10 ms. Allocated memory is still 303.6 MB. Free memory was 262.4 MB in the beginning and 252.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:25:15,094 INFO L168 Benchmark]: Boogie Preprocessor took 45.64 ms. Allocated memory is still 303.6 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:25:15,098 INFO L168 Benchmark]: RCFGBuilder took 644.67 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 227.5 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:25:15,098 INFO L168 Benchmark]: IcfgTransformer took 82807.21 ms. Allocated memory was 303.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 227.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 461.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:25:15,099 INFO L168 Benchmark]: TraceAbstraction took 4803.67 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 95.9 MB). Free memory was 1.6 GB in the beginning and 1.8 GB in the end (delta: -130.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:25:15,100 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.17 ms. Allocated memory is still 303.6 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 308.10 ms. Allocated memory is still 303.6 MB. Free memory was 262.4 MB in the beginning and 252.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.64 ms. Allocated memory is still 303.6 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 644.67 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 227.5 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 82807.21 ms. Allocated memory was 303.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 227.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 461.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4803.67 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 95.9 MB). Free memory was 1.6 GB in the beginning and 1.8 GB in the end (delta: -130.6 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 82 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2368 LocStat_NO_SUPPORTING_DISEQUALITIES : 1423 LocStat_NO_DISJUNCTIONS : -164 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 109 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 173 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 116 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.298452 RENAME_VARIABLES(MILLISECONDS) : 0.258729 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.109964 PROJECTAWAY(MILLISECONDS) : 0.071223 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.060358 DISJOIN(MILLISECONDS) : 0.408784 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.279355 ADD_EQUALITY(MILLISECONDS) : 0.010386 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017561 #CONJOIN_DISJUNCTIVE : 1674 #RENAME_VARIABLES : 3703 #UNFREEZE : 0 #CONJOIN : 2286 #PROJECTAWAY : 2052 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 387 #RENAME_VARIABLES_DISJUNCTIVE : 3557 #ADD_EQUALITY : 175 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 14 * 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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-25-15-111.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-25-15-111.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-25-15-111.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-25-15-111.csv Received shutdown request...