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/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 01:20:53,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:20:53,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:20:53,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:20:53,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:20:53,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:20:53,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:20:53,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:20:53,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:20:53,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:20:53,384 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:20:53,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:20:53,386 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:20:53,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:20:53,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:20:53,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:20:53,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:20:53,394 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:20:53,396 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:20:53,397 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:20:53,399 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:20:53,399 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:20:53,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:20:53,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:20:53,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:20:53,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:20:53,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:20:53,404 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:20:53,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:20:53,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:20:53,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:20:53,405 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 01:20:53,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:20:53,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:20:53,415 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:20:53,415 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:20:53,415 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:20:53,415 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:20:53,415 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:20:53,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:20:53,416 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:20:53,416 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 01:20:53,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:20:53,416 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:20:53,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:20:53,417 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 01:20:53,417 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 01:20:53,417 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 01:20:53,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:20:53,417 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:20:53,417 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:20:53,417 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:20:53,418 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:20:53,418 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:20:53,418 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:20:53,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:20:53,418 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:20:53,419 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:20:53,419 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:20:53,419 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:20:53,419 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:20:53,419 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:20:53,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:20:53,419 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:20:53,420 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:20:53,420 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:20:53,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:20:53,463 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:20:53,466 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:20:53,467 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:20:53,468 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:20:53,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-01-30 01:20:53,623 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:20:53,628 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 01:20:53,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:20:53,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:20:53,634 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:20:53,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:20:53" (1/1) ... [2018-01-30 01:20:53,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa64720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:53, skipping insertion in model container [2018-01-30 01:20:53,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:20:53" (1/1) ... [2018-01-30 01:20:53,652 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:20:53,690 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:20:53,811 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:20:53,831 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:20:53,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:53 WrapperNode [2018-01-30 01:20:53,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:20:53,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:20:53,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:20:53,841 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:20:53,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:53" (1/1) ... [2018-01-30 01:20:53,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:53" (1/1) ... [2018-01-30 01:20:53,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:53" (1/1) ... [2018-01-30 01:20:53,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:53" (1/1) ... [2018-01-30 01:20:53,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:53" (1/1) ... [2018-01-30 01:20:53,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:53" (1/1) ... [2018-01-30 01:20:53,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:53" (1/1) ... [2018-01-30 01:20:53,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:20:53,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:20:53,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:20:53,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:20:53,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:53" (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 01:20:53,925 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:20:53,925 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:20:53,925 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-01-30 01:20:53,925 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:20:53,925 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 01:20:53,925 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 01:20:53,926 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 01:20:53,926 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 01:20:53,926 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 01:20:53,926 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:20:53,926 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-01-30 01:20:53,926 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:20:53,926 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:20:53,926 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:20:54,182 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:20:54,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:20:54 BoogieIcfgContainer [2018-01-30 01:20:54,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:20:54,183 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 01:20:54,184 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 01:20:54,184 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 01:20:54,188 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:20:54" (1/1) ... [2018-01-30 01:20:54,197 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 01:20:54,198 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 01:20:54,198 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 01:20:54,254 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 01:20:54,284 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 01:20:54,357 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 01:22:22,331 INFO L311 AbstractInterpreter]: Visited 96 different actions 954 times. Merged at 65 different actions 568 times. Never widened. Found 68 fixpoints after 7 different actions. Largest state had 60 variables. [2018-01-30 01:22:22,333 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 01:22:22,345 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-30 01:22:22,346 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 01:22:22,346 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 01:22:22,346 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_11| v_main_~nondetString2~5.base_2), at (SUMMARY for call write~int(0, ~nondetString2~5.base, ~nondetString2~5.offset + (~length2~5 - 1) * 1, 1); srcloc: L564')) ((select (select |v_#memory_int_4| v_subseq_~pt~2.base_5) v_subseq_~pt~2.offset_4), at (SUMMARY for call #t~mem4 := read~int(~pt~2.base, ~pt~2.offset, 1); srcloc: L545')) ((select (select |v_#memory_int_2| v_subseq_~pt~2.base_2) v_subseq_~pt~2.offset_2), at (SUMMARY for call #t~mem1 := read~int(~pt~2.base, ~pt~2.offset, 1); srcloc: L544''')) ((select |v_#memory_int_9| v_main_~nondetString1~5.base_2), at (SUMMARY for call write~int(0, ~nondetString1~5.base, ~nondetString1~5.offset + (~length1~5 - 1) * 1, 1); srcloc: L564)) ((select (select |v_#memory_int_1| v_subseq_~ps~2.base_2) v_subseq_~ps~2.offset_2), at (SUMMARY for call #t~mem0 := read~int(~ps~2.base, ~ps~2.offset, 1); srcloc: L544)) ((select (select |v_#memory_int_5| v_subseq_~pt~2.base_10) v_subseq_~pt~2.offset_8), at (SUMMARY for call #t~mem7 := read~int(~pt~2.base, ~pt~2.offset, 1); srcloc: L544''''''''''''''')) ((select (select |v_#memory_int_3| v_subseq_~ps~2.base_5) v_subseq_~ps~2.offset_4), at (SUMMARY for call #t~mem3 := read~int(~ps~2.base, ~ps~2.offset, 1); srcloc: L545)) [2018-01-30 01:22:22,375 INFO L547 PartitionManager]: partitioning result: [2018-01-30 01:22:22,375 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 01:22:22,375 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 01:22:22,375 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-30 01:22:22,376 INFO L563 PartitionManager]: # location blocks :3 [2018-01-30 01:22:22,376 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 01:22:22,376 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 01:22:22,376 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 01:22:22,377 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 01:22:22,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:22:22 BasicIcfg [2018-01-30 01:22:22,397 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 01:22:22,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:22:22,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:22:22,457 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:22:22,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:20:53" (1/4) ... [2018-01-30 01:22:22,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1aa4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:22:22, skipping insertion in model container [2018-01-30 01:22:22,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:53" (2/4) ... [2018-01-30 01:22:22,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1aa4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:22:22, skipping insertion in model container [2018-01-30 01:22:22,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:20:54" (3/4) ... [2018-01-30 01:22:22,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1aa4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:22:22, skipping insertion in model container [2018-01-30 01:22:22,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:22:22" (4/4) ... [2018-01-30 01:22:22,460 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 01:22:22,467 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:22:22,472 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-30 01:22:22,501 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:22:22,501 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:22:22,501 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:22:22,501 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:22:22,501 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:22:22,502 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:22:22,502 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:22:22,502 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:22:22,502 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:22:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-01-30 01:22:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:22:22,521 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:22,522 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:22:22,522 INFO L371 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:22:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash 721071450, now seen corresponding path program 1 times [2018-01-30 01:22:22,529 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:22,530 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:22,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:22,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:22,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:22,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:22,740 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 01:22:22,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:22,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:22:22,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:22:22,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:22:22,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:22:22,758 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2018-01-30 01:22:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:22,876 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-01-30 01:22:22,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:22:22,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-30 01:22:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:22,890 INFO L225 Difference]: With dead ends: 109 [2018-01-30 01:22:22,891 INFO L226 Difference]: Without dead ends: 83 [2018-01-30 01:22:22,894 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 01:22:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-30 01:22:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-30 01:22:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 01:22:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-30 01:22:22,938 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 15 [2018-01-30 01:22:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:22,938 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-30 01:22:22,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:22:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-30 01:22:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:22:22,939 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:22,940 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:22:22,940 INFO L371 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:22:22,940 INFO L82 PathProgramCache]: Analyzing trace with hash 721071452, now seen corresponding path program 1 times [2018-01-30 01:22:22,940 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:22,940 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:22,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:22,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:22,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:22,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:23,080 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 01:22:23,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:23,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:22:23,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:22:23,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:22:23,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:22:23,083 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-01-30 01:22:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:23,162 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-30 01:22:23,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:22:23,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-30 01:22:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:23,164 INFO L225 Difference]: With dead ends: 83 [2018-01-30 01:22:23,164 INFO L226 Difference]: Without dead ends: 82 [2018-01-30 01:22:23,165 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 01:22:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-30 01:22:23,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-30 01:22:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-30 01:22:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-01-30 01:22:23,174 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 15 [2018-01-30 01:22:23,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:23,175 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-01-30 01:22:23,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:22:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-01-30 01:22:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:22:23,176 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:23,176 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:22:23,176 INFO L371 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:22:23,176 INFO L82 PathProgramCache]: Analyzing trace with hash 878378849, now seen corresponding path program 1 times [2018-01-30 01:22:23,176 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:23,177 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:23,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:23,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:23,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:23,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 01:22:23,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:23,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:22:23,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:22:23,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:22:23,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:22:23,216 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 4 states. [2018-01-30 01:22:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:23,268 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-01-30 01:22:23,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:22:23,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 01:22:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:23,270 INFO L225 Difference]: With dead ends: 82 [2018-01-30 01:22:23,270 INFO L226 Difference]: Without dead ends: 81 [2018-01-30 01:22:23,270 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 01:22:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-30 01:22:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-30 01:22:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-30 01:22:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-30 01:22:23,278 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 16 [2018-01-30 01:22:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:23,278 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-30 01:22:23,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:22:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-30 01:22:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:22:23,279 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:23,279 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:22:23,279 INFO L371 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:22:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash 878378851, now seen corresponding path program 1 times [2018-01-30 01:22:23,280 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:23,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:23,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:23,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:23,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:23,419 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 01:22:23,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:23,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:22:23,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:22:23,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:22:23,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:22:23,420 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-01-30 01:22:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:23,515 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-01-30 01:22:23,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:22:23,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 01:22:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:23,517 INFO L225 Difference]: With dead ends: 81 [2018-01-30 01:22:23,517 INFO L226 Difference]: Without dead ends: 80 [2018-01-30 01:22:23,517 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:22:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-30 01:22:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-30 01:22:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-30 01:22:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-01-30 01:22:23,524 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 16 [2018-01-30 01:22:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:23,524 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-01-30 01:22:23,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:22:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-01-30 01:22:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 01:22:23,526 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:23,526 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 01:22:23,526 INFO L371 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:22:23,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1680232304, now seen corresponding path program 1 times [2018-01-30 01:22:23,526 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:23,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:23,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:23,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:23,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:23,590 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 01:22:23,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:23,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:22:23,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:22:23,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:22:23,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:22:23,591 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 6 states. [2018-01-30 01:22:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:23,893 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-30 01:22:23,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:22:23,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-30 01:22:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:23,895 INFO L225 Difference]: With dead ends: 87 [2018-01-30 01:22:23,895 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 01:22:23,895 INFO L553 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-30 01:22:23,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 01:22:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-01-30 01:22:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 01:22:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-01-30 01:22:23,903 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 23 [2018-01-30 01:22:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:23,903 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-01-30 01:22:23,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:22:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-01-30 01:22:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 01:22:23,904 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:23,905 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 01:22:23,905 INFO L371 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:22:23,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1680232306, now seen corresponding path program 1 times [2018-01-30 01:22:23,905 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:23,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:23,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:23,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:23,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:24,057 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 01:22:24,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:24,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:22:24,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:22:24,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:22:24,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:22:24,058 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 9 states. [2018-01-30 01:22:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:24,274 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-01-30 01:22:24,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 01:22:24,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-30 01:22:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:24,277 INFO L225 Difference]: With dead ends: 125 [2018-01-30 01:22:24,278 INFO L226 Difference]: Without dead ends: 123 [2018-01-30 01:22:24,278 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-30 01:22:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-30 01:22:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2018-01-30 01:22:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-30 01:22:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-01-30 01:22:24,287 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 23 [2018-01-30 01:22:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:24,288 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-01-30 01:22:24,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:22:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-01-30 01:22:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:22:24,289 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:24,289 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 01:22:24,289 INFO L371 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:22:24,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1909331498, now seen corresponding path program 1 times [2018-01-30 01:22:24,290 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:24,290 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:24,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:24,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:24,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:24,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:24,423 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 01:22:24,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:24,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:22:24,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:22:24,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:22:24,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:22:24,424 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 6 states. [2018-01-30 01:22:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:24,568 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2018-01-30 01:22:24,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:22:24,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 01:22:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:24,569 INFO L225 Difference]: With dead ends: 102 [2018-01-30 01:22:24,569 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 01:22:24,570 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:22:24,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 01:22:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-30 01:22:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 01:22:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2018-01-30 01:22:24,576 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 25 [2018-01-30 01:22:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:24,576 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2018-01-30 01:22:24,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:22:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2018-01-30 01:22:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-30 01:22:24,578 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:24,578 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] [2018-01-30 01:22:24,578 INFO L371 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:22:24,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2042842077, now seen corresponding path program 1 times [2018-01-30 01:22:24,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:24,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:24,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:24,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:24,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:24,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:24,649 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 01:22:24,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:24,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:22:24,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:22:24,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:22:24,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:22:24,650 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 6 states. [2018-01-30 01:22:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:24,761 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2018-01-30 01:22:24,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:22:24,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-30 01:22:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:24,763 INFO L225 Difference]: With dead ends: 114 [2018-01-30 01:22:24,763 INFO L226 Difference]: Without dead ends: 111 [2018-01-30 01:22:24,764 INFO L553 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-30 01:22:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-30 01:22:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2018-01-30 01:22:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-30 01:22:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2018-01-30 01:22:24,775 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 26 [2018-01-30 01:22:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:24,775 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2018-01-30 01:22:24,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:22:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2018-01-30 01:22:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-30 01:22:24,776 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:24,776 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] [2018-01-30 01:22:24,777 INFO L371 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:22:24,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2042842075, now seen corresponding path program 1 times [2018-01-30 01:22:24,777 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:24,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:24,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:24,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:24,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:24,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:24,873 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 01:22:24,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:24,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:22:24,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:22:24,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:22:24,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:22:24,874 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand 9 states. [2018-01-30 01:22:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:24,972 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2018-01-30 01:22:24,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:22:24,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-30 01:22:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:24,973 INFO L225 Difference]: With dead ends: 133 [2018-01-30 01:22:24,974 INFO L226 Difference]: Without dead ends: 126 [2018-01-30 01:22:24,974 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-30 01:22:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-30 01:22:24,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2018-01-30 01:22:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-30 01:22:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2018-01-30 01:22:24,982 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 26 [2018-01-30 01:22:24,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:24,982 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2018-01-30 01:22:24,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:22:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2018-01-30 01:22:24,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 01:22:24,984 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:24,984 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, 1] [2018-01-30 01:22:24,984 INFO L371 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:22:24,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1621804739, now seen corresponding path program 1 times [2018-01-30 01:22:24,984 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:24,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:24,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:24,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:24,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:24,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:25,027 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 01:22:25,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:25,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:22:25,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:22:25,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:22:25,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:22:25,028 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand 3 states. [2018-01-30 01:22:25,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:25,041 INFO L93 Difference]: Finished difference Result 184 states and 214 transitions. [2018-01-30 01:22:25,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:22:25,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-01-30 01:22:25,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:25,042 INFO L225 Difference]: With dead ends: 184 [2018-01-30 01:22:25,043 INFO L226 Difference]: Without dead ends: 103 [2018-01-30 01:22:25,043 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 01:22:25,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-30 01:22:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-01-30 01:22:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-30 01:22:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2018-01-30 01:22:25,051 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 42 [2018-01-30 01:22:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:25,051 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2018-01-30 01:22:25,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:22:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2018-01-30 01:22:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-30 01:22:25,053 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:25,053 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, 1, 1, 1] [2018-01-30 01:22:25,053 INFO L371 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:22:25,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1427331863, now seen corresponding path program 1 times [2018-01-30 01:22:25,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:25,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:25,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:25,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:25,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:25,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:25,124 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 01:22:25,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:25,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:22:25,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:22:25,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:22:25,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:22:25,126 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 7 states. [2018-01-30 01:22:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:25,205 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2018-01-30 01:22:25,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:22:25,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-01-30 01:22:25,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:25,206 INFO L225 Difference]: With dead ends: 102 [2018-01-30 01:22:25,206 INFO L226 Difference]: Without dead ends: 101 [2018-01-30 01:22:25,207 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-30 01:22:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-30 01:22:25,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-01-30 01:22:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-30 01:22:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-01-30 01:22:25,211 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 44 [2018-01-30 01:22:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:25,211 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-01-30 01:22:25,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:22:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-01-30 01:22:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-30 01:22:25,212 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:25,213 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, 1, 1, 1] [2018-01-30 01:22:25,213 INFO L371 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:22:25,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1427331865, now seen corresponding path program 1 times [2018-01-30 01:22:25,213 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:25,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:25,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:25,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:25,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:25,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:25,677 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 01:22:25,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:22:25,677 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 01:22:25,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:25,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:22:25,770 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 01:22:25,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:22:25,794 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 01:22:25,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-30 01:22:25,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2018-01-30 01:22:25,844 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 28 treesize of output 30 [2018-01-30 01:22:25,848 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 01:22:25,852 INFO L168 Benchmark]: Toolchain (without parser) took 92228.96 ms. Allocated memory was 302.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 262.5 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 460.1 MB. Max. memory is 5.3 GB. [2018-01-30 01:22:25,853 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:22:25,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.90 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:22:25,854 INFO L168 Benchmark]: Boogie Preprocessor took 34.25 ms. Allocated memory is still 302.5 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:22:25,854 INFO L168 Benchmark]: RCFGBuilder took 308.31 ms. Allocated memory is still 302.5 MB. Free memory was 249.5 MB in the beginning and 227.9 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 5.3 GB. [2018-01-30 01:22:25,855 INFO L168 Benchmark]: IcfgTransformer took 88214.01 ms. Allocated memory was 302.5 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 227.9 MB in the beginning and 610.4 MB in the end (delta: -382.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-30 01:22:25,855 INFO L168 Benchmark]: TraceAbstraction took 3453.35 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 125.3 MB). Free memory was 610.4 MB in the beginning and 1.8 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:22:25,857 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.14 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.90 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.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 34.25 ms. Allocated memory is still 302.5 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 308.31 ms. Allocated memory is still 302.5 MB. Free memory was 249.5 MB in the beginning and 227.9 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 5.3 GB. * IcfgTransformer took 88214.01 ms. Allocated memory was 302.5 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 227.9 MB in the beginning and 610.4 MB in the end (delta: -382.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. * TraceAbstraction took 3453.35 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 125.3 MB). Free memory was 610.4 MB in the beginning and 1.8 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 79 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2414 LocStat_NO_SUPPORTING_DISEQUALITIES : 1294 LocStat_NO_DISJUNCTIONS : -158 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 105 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 169 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 113 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.412798 RENAME_VARIABLES(MILLISECONDS) : 0.226574 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.132463 PROJECTAWAY(MILLISECONDS) : 0.028003 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.065626 DISJOIN(MILLISECONDS) : 0.368237 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.246603 ADD_EQUALITY(MILLISECONDS) : 0.009888 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008989 #CONJOIN_DISJUNCTIVE : 1403 #RENAME_VARIABLES : 3270 #UNFREEZE : 0 #CONJOIN : 2165 #PROJECTAWAY : 1993 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 345 #RENAME_VARIABLES_DISJUNCTIVE : 3154 #ADD_EQUALITY : 171 #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/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_01-22-25-868.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_01-22-25-868.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_01-22-25-868.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_01-22-25-868.csv Received shutdown request...