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/cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 01:00:18,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:00:18,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:00:18,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:00:18,380 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:00:18,381 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:00:18,383 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:00:18,384 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:00:18,386 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:00:18,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:00:18,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:00:18,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:00:18,388 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:00:18,389 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:00:18,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:00:18,393 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:00:18,395 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:00:18,397 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:00:18,398 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:00:18,399 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:00:18,402 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:00:18,402 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:00:18,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:00:18,403 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:00:18,404 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:00:18,405 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:00:18,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:00:18,406 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:00:18,406 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:00:18,407 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:00:18,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:00:18,408 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:00:18,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:00:18,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:00:18,418 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:00:18,418 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:00:18,419 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:00:18,419 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:00:18,419 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:00:18,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:00:18,420 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:00:18,420 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 01:00:18,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:00:18,420 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:00:18,421 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:00:18,421 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 01:00:18,421 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 01:00:18,421 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 01:00:18,421 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:00:18,421 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:00:18,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:00:18,422 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:00:18,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:00:18,422 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:00:18,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:00:18,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:00:18,423 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:00:18,423 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:00:18,423 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:00:18,423 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:00:18,424 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:00:18,424 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:00:18,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:00:18,424 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:00:18,425 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:00:18,425 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:00:18,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:00:18,469 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:00:18,472 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:00:18,473 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:00:18,473 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:00:18,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-30 01:00:18,626 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:00:18,631 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 01:00:18,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:00:18,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:00:18,638 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:00:18,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:00:18" (1/1) ... [2018-01-30 01:00:18,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67990aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:00:18, skipping insertion in model container [2018-01-30 01:00:18,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:00:18" (1/1) ... [2018-01-30 01:00:18,654 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:00:18,691 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:00:18,800 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:00:18,815 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:00:18,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:00:18 WrapperNode [2018-01-30 01:00:18,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:00:18,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:00:18,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:00:18,822 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:00:18,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:00:18" (1/1) ... [2018-01-30 01:00:18,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:00:18" (1/1) ... [2018-01-30 01:00:18,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:00:18" (1/1) ... [2018-01-30 01:00:18,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:00:18" (1/1) ... [2018-01-30 01:00:18,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:00:18" (1/1) ... [2018-01-30 01:00:18,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:00:18" (1/1) ... [2018-01-30 01:00:18,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:00:18" (1/1) ... [2018-01-30 01:00:18,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:00:18,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:00:18,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:00:18,856 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:00:18,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:00:18" (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:00:18,902 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:00:18,902 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:00:18,902 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-30 01:00:18,902 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:00:18,902 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 01:00:18,902 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 01:00:18,903 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 01:00:18,903 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 01:00:18,903 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 01:00:18,903 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:00:18,903 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-30 01:00:18,903 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:00:18,903 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:00:18,903 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:00:19,158 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:00:19,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:00:19 BoogieIcfgContainer [2018-01-30 01:00:19,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:00:19,159 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 01:00:19,159 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 01:00:19,160 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 01:00:19,163 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:00:19" (1/1) ... [2018-01-30 01:00:19,169 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 01:00:19,170 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 01:00:19,170 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 01:00:19,219 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 01:00:19,252 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 01:00:19,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 01:01:28,781 INFO L311 AbstractInterpreter]: Visited 101 different actions 1278 times. Merged at 67 different actions 776 times. Widened at 1 different actions 4 times. Found 107 fixpoints after 12 different actions. Largest state had 61 variables. [2018-01-30 01:01:28,783 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 01:01:28,793 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-30 01:01:28,794 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 01:01:28,794 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 01:01:28,794 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_2| v_cstrcspn_~sc1~2.base_6) v_cstrcspn_~sc1~2.offset_5), at (SUMMARY for call #t~mem2 := read~int(~sc1~2.base, ~sc1~2.offset, 1); srcloc: L547)) ((select (select |v_#memory_int_5| v_cstrcspn_~s~2.base_11) v_cstrcspn_~s~2.offset_9), at (SUMMARY for call #t~mem7 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L548''''''''''''''')) ((select |v_#memory_int_11| v_main_~nondetString2~4.base_2), at (SUMMARY for call write~int(0, ~nondetString2~4.base, ~nondetString2~4.offset + (~length2~4 - 1) * 1, 1); srcloc: L566')) ((select |v_#memory_int_9| v_main_~nondetString1~4.base_2), at (SUMMARY for call write~int(0, ~nondetString1~4.base, ~nondetString1~4.offset + (~length1~4 - 1) * 1, 1); srcloc: L566)) ((select (select |v_#memory_int_1| v_cstrcspn_~sc1~2.base_3) v_cstrcspn_~sc1~2.offset_3), at (SUMMARY for call #t~mem1 := read~int(~sc1~2.base, ~sc1~2.offset, 1); srcloc: L545')) ((select (select |v_#memory_int_4| v_cstrcspn_~s~2.base_6) v_cstrcspn_~s~2.offset_5), at (SUMMARY for call #t~mem4 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L548''')) ((select (select |v_#memory_int_3| v_cstrcspn_~s~2.base_3) v_cstrcspn_~s~2.offset_3), at (SUMMARY for call #t~mem3 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L548)) [2018-01-30 01:01:28,821 INFO L547 PartitionManager]: partitioning result: [2018-01-30 01:01:28,821 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 01:01:28,821 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 01:01:28,821 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-30 01:01:28,822 INFO L563 PartitionManager]: # location blocks :3 [2018-01-30 01:01:28,822 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 01:01:28,822 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 01:01:28,822 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 01:01:28,822 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 01:01:28,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:01:28 BasicIcfg [2018-01-30 01:01:28,840 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 01:01:28,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:01:28,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:01:28,896 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:01:28,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:00:18" (1/4) ... [2018-01-30 01:01:28,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e4a1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:01:28, skipping insertion in model container [2018-01-30 01:01:28,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:00:18" (2/4) ... [2018-01-30 01:01:28,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e4a1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:01:28, skipping insertion in model container [2018-01-30 01:01:28,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:00:19" (3/4) ... [2018-01-30 01:01:28,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e4a1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:01:28, skipping insertion in model container [2018-01-30 01:01:28,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:01:28" (4/4) ... [2018-01-30 01:01:28,898 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 01:01:28,905 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:01:28,910 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-30 01:01:28,939 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:01:28,939 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:01:28,939 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:01:28,939 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:01:28,939 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:01:28,940 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:01:28,940 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:01:28,940 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:01:28,940 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:01:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-30 01:01:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:01:28,959 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:01:28,960 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:01:28,960 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:01:28,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1050940434, now seen corresponding path program 1 times [2018-01-30 01:01:28,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:01:28,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:01:29,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:29,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:29,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:29,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:01:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:01:29,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:01:29,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:01:29,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:01:29,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:01:29,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:01:29,192 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2018-01-30 01:01:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:01:29,315 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2018-01-30 01:01:29,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:01:29,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-30 01:01:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:01:29,329 INFO L225 Difference]: With dead ends: 149 [2018-01-30 01:01:29,329 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 01:01:29,333 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:01:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 01:01:29,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-30 01:01:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-30 01:01:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-30 01:01:29,375 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 15 [2018-01-30 01:01:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:01:29,376 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-30 01:01:29,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:01:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-30 01:01:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:01:29,377 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:01:29,377 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:01:29,377 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:01:29,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1050940432, now seen corresponding path program 1 times [2018-01-30 01:01:29,378 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:01:29,378 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:01:29,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:29,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:29,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:29,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:01:29,542 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:01:29,542 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:01:29,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:01:29,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:01:29,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:01:29,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:01:29,545 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-01-30 01:01:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:01:29,611 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-30 01:01:29,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:01:29,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-30 01:01:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:01:29,613 INFO L225 Difference]: With dead ends: 87 [2018-01-30 01:01:29,614 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 01:01:29,614 INFO L553 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-30 01:01:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 01:01:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-30 01:01:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 01:01:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-01-30 01:01:29,623 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 15 [2018-01-30 01:01:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:01:29,623 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-01-30 01:01:29,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:01:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-01-30 01:01:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:01:29,624 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:01:29,625 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:01:29,625 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:01:29,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1780585313, now seen corresponding path program 1 times [2018-01-30 01:01:29,625 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:01:29,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:01:29,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:29,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:29,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:29,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:01:29,687 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:01:29,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:01:29,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:01:29,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:01:29,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:01:29,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:01:29,688 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 4 states. [2018-01-30 01:01:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:01:29,730 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-01-30 01:01:29,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:01:29,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 01:01:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:01:29,732 INFO L225 Difference]: With dead ends: 86 [2018-01-30 01:01:29,732 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 01:01:29,732 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:01:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 01:01:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-30 01:01:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 01:01:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-30 01:01:29,738 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2018-01-30 01:01:29,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:01:29,739 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-30 01:01:29,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:01:29,739 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-30 01:01:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:01:29,740 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:01:29,740 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:01:29,740 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:01:29,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1780585315, now seen corresponding path program 1 times [2018-01-30 01:01:29,740 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:01:29,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:01:29,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:29,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:29,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:29,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:01:29,825 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:01:29,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:01:29,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:01:29,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:01:29,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:01:29,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:01:29,826 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 5 states. [2018-01-30 01:01:29,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:01:29,860 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-30 01:01:29,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:01:29,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 01:01:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:01:29,861 INFO L225 Difference]: With dead ends: 85 [2018-01-30 01:01:29,861 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 01:01:29,861 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:01:29,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 01:01:29,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-30 01:01:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 01:01:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-30 01:01:29,867 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2018-01-30 01:01:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:01:29,867 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-30 01:01:29,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:01:29,867 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-30 01:01:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:01:29,868 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:01:29,868 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:01:29,868 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:01:29,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1247887850, now seen corresponding path program 1 times [2018-01-30 01:01:29,868 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:01:29,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:01:29,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:29,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:29,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:29,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:01:29,940 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:01:29,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:01:29,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:01:29,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:01:29,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:01:29,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:01:29,941 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 6 states. [2018-01-30 01:01:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:01:30,048 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-01-30 01:01:30,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:01:30,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 01:01:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:01:30,050 INFO L225 Difference]: With dead ends: 88 [2018-01-30 01:01:30,050 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 01:01:30,051 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:01:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 01:01:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-01-30 01:01:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 01:01:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2018-01-30 01:01:30,057 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 25 [2018-01-30 01:01:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:01:30,058 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2018-01-30 01:01:30,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:01:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2018-01-30 01:01:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:01:30,059 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:01:30,059 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:01:30,059 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:01:30,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1247887852, now seen corresponding path program 1 times [2018-01-30 01:01:30,059 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:01:30,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:01:30,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:30,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:30,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:30,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:01:30,185 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:01:30,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:01:30,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:01:30,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:01:30,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:01:30,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:01:30,186 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 9 states. [2018-01-30 01:01:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:01:30,358 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2018-01-30 01:01:30,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 01:01:30,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-30 01:01:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:01:30,361 INFO L225 Difference]: With dead ends: 126 [2018-01-30 01:01:30,361 INFO L226 Difference]: Without dead ends: 124 [2018-01-30 01:01:30,362 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:01:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-30 01:01:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-01-30 01:01:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 01:01:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-01-30 01:01:30,368 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 25 [2018-01-30 01:01:30,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:01:30,369 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-01-30 01:01:30,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:01:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-01-30 01:01:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:01:30,369 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:01:30,369 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:01:30,369 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:01:30,370 INFO L82 PathProgramCache]: Analyzing trace with hash -456998170, now seen corresponding path program 1 times [2018-01-30 01:01:30,370 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:01:30,370 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:01:30,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:30,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:30,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:30,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:01:30,500 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:01:30,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:01:30,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:01:30,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:01:30,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:01:30,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:01:30,501 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 6 states. [2018-01-30 01:01:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:01:30,671 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-01-30 01:01:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:01:30,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 01:01:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:01:30,672 INFO L225 Difference]: With dead ends: 89 [2018-01-30 01:01:30,672 INFO L226 Difference]: Without dead ends: 74 [2018-01-30 01:01:30,672 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:01:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-30 01:01:30,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-30 01:01:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-30 01:01:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-01-30 01:01:30,679 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 25 [2018-01-30 01:01:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:01:30,679 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-01-30 01:01:30,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:01:30,680 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-01-30 01:01:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 01:01:30,680 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:01:30,681 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:01:30,681 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:01:30,681 INFO L82 PathProgramCache]: Analyzing trace with hash 392251896, now seen corresponding path program 1 times [2018-01-30 01:01:30,681 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:01:30,681 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:01:30,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:30,682 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:30,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:30,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:01:30,731 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:01:30,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:01:30,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:01:30,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:01:30,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:01:30,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:01:30,732 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 6 states. [2018-01-30 01:01:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:01:30,814 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-30 01:01:30,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:01:30,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-30 01:01:30,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:01:30,816 INFO L225 Difference]: With dead ends: 78 [2018-01-30 01:01:30,816 INFO L226 Difference]: Without dead ends: 75 [2018-01-30 01:01:30,816 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:01:30,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-30 01:01:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-01-30 01:01:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-30 01:01:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-30 01:01:30,824 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 33 [2018-01-30 01:01:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:01:30,824 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-30 01:01:30,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:01:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-30 01:01:30,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 01:01:30,825 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:01:30,826 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:01:30,826 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:01:30,826 INFO L82 PathProgramCache]: Analyzing trace with hash 392251898, now seen corresponding path program 1 times [2018-01-30 01:01:30,826 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:01:30,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:01:30,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:30,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:30,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:30,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:01:30,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-30 01:01:30,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:01:30,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:01:30,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:01:30,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:01:30,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:01:30,940 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2018-01-30 01:01:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:01:31,039 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-01-30 01:01:31,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:01:31,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-01-30 01:01:31,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:01:31,040 INFO L225 Difference]: With dead ends: 103 [2018-01-30 01:01:31,040 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 01:01:31,041 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:01:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 01:01:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 83. [2018-01-30 01:01:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 01:01:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-30 01:01:31,047 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 33 [2018-01-30 01:01:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:01:31,047 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-30 01:01:31,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:01:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-30 01:01:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-30 01:01:31,048 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:01:31,048 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:01:31,048 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:01:31,049 INFO L82 PathProgramCache]: Analyzing trace with hash -378168851, now seen corresponding path program 1 times [2018-01-30 01:01:31,049 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:01:31,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:01:31,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:31,049 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:31,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:31,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:01:31,094 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:01:31,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:01:31,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:01:31,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:01:31,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:01:31,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:01:31,095 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 3 states. [2018-01-30 01:01:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:01:31,111 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-01-30 01:01:31,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:01:31,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-30 01:01:31,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:01:31,113 INFO L225 Difference]: With dead ends: 133 [2018-01-30 01:01:31,113 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 01:01:31,114 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:01:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 01:01:31,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-30 01:01:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 01:01:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-30 01:01:31,120 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 44 [2018-01-30 01:01:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:01:31,121 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-30 01:01:31,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:01:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-30 01:01:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 01:01:31,122 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:01:31,122 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, 1, 1] [2018-01-30 01:01:31,122 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:01:31,123 INFO L82 PathProgramCache]: Analyzing trace with hash 164873217, now seen corresponding path program 1 times [2018-01-30 01:01:31,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:01:31,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:01:31,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:31,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:31,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:31,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:01:31,195 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:01:31,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:01:31,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:01:31,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:01:31,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:01:31,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:01:31,196 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-01-30 01:01:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:01:31,297 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-30 01:01:31,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:01:31,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-30 01:01:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:01:31,299 INFO L225 Difference]: With dead ends: 85 [2018-01-30 01:01:31,299 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 01:01:31,300 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:01:31,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 01:01:31,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-30 01:01:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 01:01:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-30 01:01:31,306 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 46 [2018-01-30 01:01:31,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:01:31,306 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-30 01:01:31,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:01:31,307 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-30 01:01:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 01:01:31,307 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:01:31,308 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, 1, 1] [2018-01-30 01:01:31,308 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:01:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash 164873219, now seen corresponding path program 1 times [2018-01-30 01:01:31,308 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:01:31,308 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:01:31,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:31,309 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:31,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:01:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:31,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:01:31,536 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:01:31,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:01:31,537 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:01:31,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:01:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:01:31,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:01:31,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-01-30 01:01:31,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-30 01:01:31,690 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:01:31,693 INFO L168 Benchmark]: Toolchain (without parser) took 73066.48 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 267.3 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 495.5 MB. Max. memory is 5.3 GB. [2018-01-30 01:01:31,694 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:01:31,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.04 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-30 01:01:31,695 INFO L168 Benchmark]: Boogie Preprocessor took 33.31 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 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:01:31,695 INFO L168 Benchmark]: RCFGBuilder took 303.53 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 231.2 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. [2018-01-30 01:01:31,695 INFO L168 Benchmark]: IcfgTransformer took 69681.15 ms. Allocated memory was 307.2 MB in the beginning and 2.2 GB in the end (delta: 1.8 GB). Free memory was 231.2 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 803.1 MB. Max. memory is 5.3 GB. [2018-01-30 01:01:31,696 INFO L168 Benchmark]: TraceAbstraction took 2851.32 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 104.3 MB). Free memory was 1.3 GB in the beginning and 1.7 GB in the end (delta: -447.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:01:31,698 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.12 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 190.04 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.31 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 303.53 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 231.2 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. * IcfgTransformer took 69681.15 ms. Allocated memory was 307.2 MB in the beginning and 2.2 GB in the end (delta: 1.8 GB). Free memory was 231.2 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 803.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2851.32 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 104.3 MB). Free memory was 1.3 GB in the beginning and 1.7 GB in the end (delta: -447.9 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 83 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2474 LocStat_NO_SUPPORTING_DISEQUALITIES : 1424 LocStat_NO_DISJUNCTIONS : -166 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 110 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 170 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 117 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.402897 RENAME_VARIABLES(MILLISECONDS) : 0.252450 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.183876 PROJECTAWAY(MILLISECONDS) : 0.029779 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.064020 DISJOIN(MILLISECONDS) : 0.395289 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.273824 ADD_EQUALITY(MILLISECONDS) : 0.018511 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016053 #CONJOIN_DISJUNCTIVE : 1908 #RENAME_VARIABLES : 4155 #UNFREEZE : 0 #CONJOIN : 2490 #PROJECTAWAY : 2226 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 393 #RENAME_VARIABLES_DISJUNCTIVE : 3999 #ADD_EQUALITY : 172 #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/cstrcspn-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-01-31-708.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcspn-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-01-31-708.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcspn-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-01-31-708.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcspn-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-01-31-708.csv Received shutdown request...