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-5f7ec6e [2018-01-31 09:35:22,783 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:35:22,785 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:35:22,805 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:35:22,805 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:35:22,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:35:22,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:35:22,809 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:35:22,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:35:22,813 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:35:22,814 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:35:22,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:35:22,815 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:35:22,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:35:22,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:35:22,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:35:22,823 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:35:22,825 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:35:22,826 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:35:22,827 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:35:22,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:35:22,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:35:22,830 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:35:22,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:35:22,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:35:22,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:35:22,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:35:22,834 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:35:22,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:35:22,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:35:22,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:35:22,836 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:35:22,846 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:35:22,847 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:35:22,847 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:35:22,848 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:35:22,848 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:35:22,848 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:35:22,848 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:35:22,849 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:35:22,849 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:35:22,849 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:35:22,849 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:35:22,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:35:22,850 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:35:22,850 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:35:22,850 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:35:22,850 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:35:22,850 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:35:22,851 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:35:22,851 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:35:22,851 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:35:22,851 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:35:22,851 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:35:22,852 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:35:22,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:35:22,852 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:35:22,852 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:35:22,852 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:35:22,852 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:35:22,853 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:35:22,853 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:35:22,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:35:22,853 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:35:22,854 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:35:22,854 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:35:22,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:35:22,923 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:35:22,930 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:35:22,931 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:35:22,932 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:35:22,932 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-31 09:35:23,130 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:35:23,137 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:35:23,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:35:23,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:35:23,150 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:35:23,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:35:23" (1/1) ... [2018-01-31 09:35:23,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f37c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:35:23, skipping insertion in model container [2018-01-31 09:35:23,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:35:23" (1/1) ... [2018-01-31 09:35:23,175 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:35:23,234 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:35:23,395 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:35:23,426 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:35:23,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:35:23 WrapperNode [2018-01-31 09:35:23,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:35:23,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:35:23,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:35:23,439 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:35:23,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:35:23" (1/1) ... [2018-01-31 09:35:23,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:35:23" (1/1) ... [2018-01-31 09:35:23,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:35:23" (1/1) ... [2018-01-31 09:35:23,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:35:23" (1/1) ... [2018-01-31 09:35:23,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:35:23" (1/1) ... [2018-01-31 09:35:23,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:35:23" (1/1) ... [2018-01-31 09:35:23,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:35:23" (1/1) ... [2018-01-31 09:35:23,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:35:23,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:35:23,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:35:23,482 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:35:23,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:35:23" (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:35:23,552 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:35:23,552 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:35:23,552 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-01-31 09:35:23,552 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:35:23,553 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:35:23,553 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:35:23,553 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:35:23,555 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:35:23,556 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:35:23,556 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:35:23,556 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-01-31 09:35:23,556 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:35:23,556 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:35:23,556 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:35:24,154 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:35:24,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:35:24 BoogieIcfgContainer [2018-01-31 09:35:24,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:35:24,155 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:35:24,155 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:35:24,156 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:35:24,159 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:35:24" (1/1) ... [2018-01-31 09:35:24,170 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:35:24,171 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:35:24,171 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:35:24,220 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:35:24,267 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:35:24,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:36:55,570 INFO L314 AbstractInterpreter]: Visited 96 different actions 942 times. Merged at 65 different actions 556 times. Never widened. Found 68 fixpoints after 9 different actions. Largest state had 60 variables. [2018-01-31 09:36:55,572 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:36:55,583 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-31 09:36:55,583 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:36:55,583 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:36:55,584 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-31 09:36:55,615 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:36:55,615 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:36:55,615 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:36:55,615 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-31 09:36:55,615 INFO L564 PartitionManager]: # location blocks :3 [2018-01-31 09:36:55,615 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:36:55,616 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-31 09:36:55,616 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:36:55,616 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:36:55,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:36:55 BasicIcfg [2018-01-31 09:36:55,638 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:36:55,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:36:55,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:36:55,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:36:55,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:35:23" (1/4) ... [2018-01-31 09:36:55,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711d8bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:36:55, skipping insertion in model container [2018-01-31 09:36:55,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:35:23" (2/4) ... [2018-01-31 09:36:55,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711d8bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:36:55, skipping insertion in model container [2018-01-31 09:36:55,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:35:24" (3/4) ... [2018-01-31 09:36:55,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711d8bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:36:55, skipping insertion in model container [2018-01-31 09:36:55,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:36:55" (4/4) ... [2018-01-31 09:36:55,647 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:36:55,736 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:36:55,744 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 09:36:55,790 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:36:55,790 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:36:55,791 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:36:55,791 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:36:55,791 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:36:55,791 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:36:55,791 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:36:55,791 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:36:55,792 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:36:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-01-31 09:36:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:36:55,814 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:36:55,815 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:36:55,817 INFO L371 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:36:55,821 INFO L82 PathProgramCache]: Analyzing trace with hash 721071450, now seen corresponding path program 1 times [2018-01-31 09:36:55,823 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:36:55,824 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:36:55,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:55,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:36:55,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:36:55,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:36:56,060 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:36:56,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:36:56,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:36:56,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:36:56,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:36:56,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:36:56,076 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2018-01-31 09:36:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:36:56,458 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-01-31 09:36:56,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:36:56,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-31 09:36:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:36:56,473 INFO L225 Difference]: With dead ends: 109 [2018-01-31 09:36:56,473 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 09:36:56,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:36:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 09:36:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-31 09:36:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 09:36:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-31 09:36:56,515 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 15 [2018-01-31 09:36:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:36:56,516 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-31 09:36:56,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:36:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-31 09:36:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:36:56,517 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:36:56,517 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:36:56,517 INFO L371 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:36:56,517 INFO L82 PathProgramCache]: Analyzing trace with hash 721071452, now seen corresponding path program 1 times [2018-01-31 09:36:56,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:36:56,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:36:56,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:56,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:36:56,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:36:56,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:36:56,704 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:36:56,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:36:56,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:36:56,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:36:56,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:36:56,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:36:56,707 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-01-31 09:36:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:36:56,863 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-31 09:36:56,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:36:56,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-31 09:36:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:36:56,864 INFO L225 Difference]: With dead ends: 83 [2018-01-31 09:36:56,865 INFO L226 Difference]: Without dead ends: 82 [2018-01-31 09:36:56,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:36:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-31 09:36:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-31 09:36:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-31 09:36:56,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-01-31 09:36:56,873 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 15 [2018-01-31 09:36:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:36:56,874 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-01-31 09:36:56,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:36:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-01-31 09:36:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:36:56,875 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:36:56,875 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:36:56,875 INFO L371 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:36:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash 878378849, now seen corresponding path program 1 times [2018-01-31 09:36:56,875 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:36:56,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:36:56,876 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:56,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:36:56,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:36:56,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:36:56,938 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:36:56,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:36:56,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:36:56,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:36:56,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:36:56,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:36:56,939 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 4 states. [2018-01-31 09:36:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:36:57,058 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-01-31 09:36:57,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:36:57,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-31 09:36:57,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:36:57,060 INFO L225 Difference]: With dead ends: 82 [2018-01-31 09:36:57,060 INFO L226 Difference]: Without dead ends: 81 [2018-01-31 09:36:57,061 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:36:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-31 09:36:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-31 09:36:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-31 09:36:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-31 09:36:57,067 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 16 [2018-01-31 09:36:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:36:57,068 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-31 09:36:57,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:36:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-31 09:36:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:36:57,069 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:36:57,069 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:36:57,069 INFO L371 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:36:57,069 INFO L82 PathProgramCache]: Analyzing trace with hash 878378851, now seen corresponding path program 1 times [2018-01-31 09:36:57,069 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:36:57,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:36:57,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:57,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:36:57,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:36:57,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:36:57,327 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 15 DAG size of output 11 [2018-01-31 09:36:57,328 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:36:57,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:36:57,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:36:57,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:36:57,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:36:57,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:36:57,329 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-01-31 09:36:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:36:57,563 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-01-31 09:36:57,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:36:57,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-31 09:36:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:36:57,565 INFO L225 Difference]: With dead ends: 81 [2018-01-31 09:36:57,565 INFO L226 Difference]: Without dead ends: 80 [2018-01-31 09:36:57,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:36:57,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-31 09:36:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-31 09:36:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-31 09:36:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-01-31 09:36:57,572 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 16 [2018-01-31 09:36:57,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:36:57,572 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-01-31 09:36:57,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:36:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-01-31 09:36:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 09:36:57,573 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:36:57,574 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] [2018-01-31 09:36:57,574 INFO L371 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:36:57,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1680232304, now seen corresponding path program 1 times [2018-01-31 09:36:57,574 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:36:57,574 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:36:57,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:57,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:36:57,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:36:57,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:36:57,646 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:36:57,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:36:57,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:36:57,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:36:57,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:36:57,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:36:57,647 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 6 states. [2018-01-31 09:36:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:36:57,838 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-31 09:36:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:36:57,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-31 09:36:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:36:57,840 INFO L225 Difference]: With dead ends: 87 [2018-01-31 09:36:57,840 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 09:36:57,840 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:36:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 09:36:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-01-31 09:36:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 09:36:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-01-31 09:36:57,848 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 23 [2018-01-31 09:36:57,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:36:57,848 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-01-31 09:36:57,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:36:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-01-31 09:36:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 09:36:57,849 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:36:57,849 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] [2018-01-31 09:36:57,849 INFO L371 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:36:57,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1680232306, now seen corresponding path program 1 times [2018-01-31 09:36:57,850 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:36:57,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:36:57,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:57,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:36:57,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:36:57,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:36:58,013 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:36:58,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:36:58,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:36:58,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:36:58,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:36:58,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:36:58,015 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 9 states. [2018-01-31 09:36:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:36:58,314 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-01-31 09:36:58,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:36:58,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-31 09:36:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:36:58,317 INFO L225 Difference]: With dead ends: 125 [2018-01-31 09:36:58,317 INFO L226 Difference]: Without dead ends: 123 [2018-01-31 09:36:58,318 INFO L554 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-31 09:36:58,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-31 09:36:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2018-01-31 09:36:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-31 09:36:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-01-31 09:36:58,327 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 23 [2018-01-31 09:36:58,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:36:58,328 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-01-31 09:36:58,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:36:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-01-31 09:36:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 09:36:58,329 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:36:58,329 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:36:58,329 INFO L371 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:36:58,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1909331498, now seen corresponding path program 1 times [2018-01-31 09:36:58,329 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:36:58,329 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:36:58,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:58,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:36:58,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:36:58,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:36:58,508 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:36:58,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:36:58,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:36:58,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:36:58,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:36:58,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:36:58,509 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 6 states. [2018-01-31 09:36:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:36:58,755 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2018-01-31 09:36:58,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:36:58,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 09:36:58,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:36:58,756 INFO L225 Difference]: With dead ends: 102 [2018-01-31 09:36:58,757 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 09:36:58,757 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:36:58,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 09:36:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-31 09:36:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 09:36:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2018-01-31 09:36:58,762 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 25 [2018-01-31 09:36:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:36:58,763 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2018-01-31 09:36:58,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:36:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2018-01-31 09:36:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 09:36:58,764 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:36:58,764 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] [2018-01-31 09:36:58,764 INFO L371 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:36:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2042842077, now seen corresponding path program 1 times [2018-01-31 09:36:58,764 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:36:58,764 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:36:58,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:58,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:36:58,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:36:58,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:36:58,899 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:36:58,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:36:58,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:36:58,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:36:58,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:36:58,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:36:58,900 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 6 states. [2018-01-31 09:36:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:36:58,989 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2018-01-31 09:36:58,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:36:58,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-31 09:36:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:36:58,991 INFO L225 Difference]: With dead ends: 114 [2018-01-31 09:36:58,991 INFO L226 Difference]: Without dead ends: 111 [2018-01-31 09:36:58,991 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:36:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-31 09:36:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2018-01-31 09:36:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-31 09:36:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2018-01-31 09:36:59,001 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 26 [2018-01-31 09:36:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:36:59,001 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2018-01-31 09:36:59,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:36:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2018-01-31 09:36:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 09:36:59,002 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:36:59,002 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] [2018-01-31 09:36:59,003 INFO L371 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:36:59,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2042842075, now seen corresponding path program 1 times [2018-01-31 09:36:59,003 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:36:59,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:36:59,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:59,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:36:59,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:36:59,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:36:59,138 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:36:59,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:36:59,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:36:59,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:36:59,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:36:59,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:36:59,139 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand 9 states. [2018-01-31 09:36:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:36:59,269 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2018-01-31 09:36:59,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:36:59,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-31 09:36:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:36:59,270 INFO L225 Difference]: With dead ends: 133 [2018-01-31 09:36:59,270 INFO L226 Difference]: Without dead ends: 126 [2018-01-31 09:36:59,271 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:36:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-31 09:36:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2018-01-31 09:36:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-31 09:36:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2018-01-31 09:36:59,279 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 26 [2018-01-31 09:36:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:36:59,279 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2018-01-31 09:36:59,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:36:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2018-01-31 09:36:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 09:36:59,281 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:36:59,281 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] [2018-01-31 09:36:59,281 INFO L371 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:36:59,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1621804739, now seen corresponding path program 1 times [2018-01-31 09:36:59,282 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:36:59,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:36:59,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:59,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:36:59,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:36:59,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:36:59,340 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:36:59,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:36:59,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:36:59,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:36:59,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:36:59,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:36:59,342 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand 3 states. [2018-01-31 09:36:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:36:59,358 INFO L93 Difference]: Finished difference Result 184 states and 214 transitions. [2018-01-31 09:36:59,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:36:59,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-01-31 09:36:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:36:59,362 INFO L225 Difference]: With dead ends: 184 [2018-01-31 09:36:59,362 INFO L226 Difference]: Without dead ends: 103 [2018-01-31 09:36:59,363 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:36:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-31 09:36:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-01-31 09:36:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-31 09:36:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2018-01-31 09:36:59,374 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 42 [2018-01-31 09:36:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:36:59,374 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2018-01-31 09:36:59,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:36:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2018-01-31 09:36:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-31 09:36:59,375 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:36:59,375 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:36:59,375 INFO L371 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:36:59,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1427331863, now seen corresponding path program 1 times [2018-01-31 09:36:59,376 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:36:59,376 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:36:59,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:59,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:36:59,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:36:59,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:36:59,542 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:36:59,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:36:59,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:36:59,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:36:59,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:36:59,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:36:59,544 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 7 states. [2018-01-31 09:36:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:36:59,631 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2018-01-31 09:36:59,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:36:59,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-01-31 09:36:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:36:59,633 INFO L225 Difference]: With dead ends: 102 [2018-01-31 09:36:59,633 INFO L226 Difference]: Without dead ends: 101 [2018-01-31 09:36:59,633 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:36:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-31 09:36:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-01-31 09:36:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-31 09:36:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-01-31 09:36:59,638 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 44 [2018-01-31 09:36:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:36:59,638 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-01-31 09:36:59,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:36:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-01-31 09:36:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-31 09:36:59,640 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:36:59,640 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:36:59,640 INFO L371 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr9RequiresViolation, subseqErr3RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:36:59,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1427331865, now seen corresponding path program 1 times [2018-01-31 09:36:59,641 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:36:59,641 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:36:59,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:59,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:36:59,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:36:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:36:59,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:37:00,048 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:37:00,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:37:00,049 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:37:00,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:37:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:37:00,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:37:00,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-31 09:37:00,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:37:00,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:37:00,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-31 09:37:00,418 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-31 09:37:00,436 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-31 09:37:00,449 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:37:00,452 INFO L168 Benchmark]: Toolchain (without parser) took 97321.44 ms. Allocated memory was 304.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 262.8 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 457.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:37:00,453 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 268.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:37:00,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.58 ms. Allocated memory is still 304.1 MB. Free memory was 262.8 MB in the beginning and 252.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:37:00,453 INFO L168 Benchmark]: Boogie Preprocessor took 42.47 ms. Allocated memory is still 304.1 MB. Free memory was 252.8 MB in the beginning and 250.9 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:37:00,454 INFO L168 Benchmark]: RCFGBuilder took 673.00 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 227.9 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:37:00,456 INFO L168 Benchmark]: IcfgTransformer took 91483.59 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 227.9 MB in the beginning and 574.0 MB in the end (delta: -346.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-31 09:37:00,457 INFO L168 Benchmark]: TraceAbstraction took 4812.25 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 99.1 MB). Free memory was 534.7 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-31 09:37:00,459 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 268.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 295.58 ms. Allocated memory is still 304.1 MB. Free memory was 262.8 MB in the beginning and 252.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.47 ms. Allocated memory is still 304.1 MB. Free memory was 252.8 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 673.00 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 227.9 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * IcfgTransformer took 91483.59 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 227.9 MB in the beginning and 574.0 MB in the end (delta: -346.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. * TraceAbstraction took 4812.25 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 99.1 MB). Free memory was 534.7 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) : 4.022553 RENAME_VARIABLES(MILLISECONDS) : 0.341248 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.948546 PROJECTAWAY(MILLISECONDS) : 0.041903 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.094972 DISJOIN(MILLISECONDS) : 0.661041 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.375165 ADD_EQUALITY(MILLISECONDS) : 0.010704 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008841 #CONJOIN_DISJUNCTIVE : 1361 #RENAME_VARIABLES : 3096 #UNFREEZE : 0 #CONJOIN : 2003 #PROJECTAWAY : 1831 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 299 #RENAME_VARIABLES_DISJUNCTIVE : 2980 #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-31_09-37-00-475.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-31_09-37-00-475.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-31_09-37-00-475.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-31_09-37-00-475.csv Received shutdown request...