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/add_last-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:54:37,722 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:54:37,724 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:54:37,738 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:54:37,738 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:54:37,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:54:37,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:54:37,741 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:54:37,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:54:37,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:54:37,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:54:37,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:54:37,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:54:37,745 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:54:37,746 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:54:37,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:54:37,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:54:37,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:54:37,754 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:54:37,755 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:54:37,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:54:37,758 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:54:37,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:54:37,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:54:37,760 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:54:37,761 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:54:37,761 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:54:37,762 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:54:37,762 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:54:37,762 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:54:37,763 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:54:37,763 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:54:37,773 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:54:37,773 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:54:37,774 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:54:37,774 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:54:37,774 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:54:37,775 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:54:37,775 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:54:37,775 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:54:37,776 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:54:37,776 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:54:37,776 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:54:37,776 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:54:37,776 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:54:37,777 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:54:37,777 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:54:37,777 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:54:37,777 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:54:37,777 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:54:37,777 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:54:37,778 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:54:37,778 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:54:37,778 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:54:37,778 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:54:37,778 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:54:37,779 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:54:37,779 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:54:37,779 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:54:37,779 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:54:37,779 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:54:37,780 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:54:37,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:54:37,780 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:54:37,781 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:54:37,781 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:54:37,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:54:37,829 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:54:37,833 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:54:37,835 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:54:37,835 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:54:37,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i [2018-01-30 00:54:38,035 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:54:38,041 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 00:54:38,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:54:38,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:54:38,047 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:54:38,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:54:38" (1/1) ... [2018-01-30 00:54:38,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518073ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:54:38, skipping insertion in model container [2018-01-30 00:54:38,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:54:38" (1/1) ... [2018-01-30 00:54:38,064 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:54:38,101 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:54:38,215 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:54:38,231 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:54:38,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:54:38 WrapperNode [2018-01-30 00:54:38,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:54:38,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:54:38,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:54:38,238 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:54:38,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:54:38" (1/1) ... [2018-01-30 00:54:38,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:54:38" (1/1) ... [2018-01-30 00:54:38,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:54:38" (1/1) ... [2018-01-30 00:54:38,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:54:38" (1/1) ... [2018-01-30 00:54:38,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:54:38" (1/1) ... [2018-01-30 00:54:38,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:54:38" (1/1) ... [2018-01-30 00:54:38,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:54:38" (1/1) ... [2018-01-30 00:54:38,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:54:38,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:54:38,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:54:38,270 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:54:38,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:54:38" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:54:38,313 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:54:38,313 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:54:38,313 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:54:38,313 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:54:38,313 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:54:38,314 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:54:38,314 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:54:38,314 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:54:38,314 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:54:38,314 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:54:38,314 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:54:38,315 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:54:38,515 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:54:38,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:54:38 BoogieIcfgContainer [2018-01-30 00:54:38,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:54:38,516 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 00:54:38,516 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 00:54:38,517 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 00:54:38,519 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:54:38" (1/1) ... [2018-01-30 00:54:38,526 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 00:54:38,526 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 00:54:38,527 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 00:54:38,562 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 6 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 00:54:38,588 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 00:54:38,636 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 00:55:19,047 INFO L311 AbstractInterpreter]: Visited 56 different actions 257 times. Merged at 31 different actions 148 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 8 different actions. Largest state had 45 variables. [2018-01-30 00:55:19,049 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 00:55:19,058 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 5 [2018-01-30 00:55:19,059 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 00:55:19,059 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 00:55:19,059 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_5| v_main_~a~2.base_5) v_main_~a~2.offset_4), at (SUMMARY for call #t~mem4 := read~int(~a~2.base, ~a~2.offset, 4); srcloc: L548)) ((select (select |v_#memory_int_4| v_main_~arr~2.base_5) (+ (* 4 v_main_~length~2_6) v_main_~arr~2.offset_5 (- 4))), at (SUMMARY for call #t~mem3 := read~int(~arr~2.base, ~arr~2.offset + ~length~2 * 4 - 4, 4); srcloc: L547')) ((select (select |v_#memory_int_3| v_main_~a~2.base_2) v_main_~a~2.offset_2), at (SUMMARY for call #t~mem2 := read~int(~a~2.base, ~a~2.offset, 4); srcloc: L547)) ((select (select |v_#memory_int_6| v_main_~arr~2.base_8) (+ (* 4 v_main_~length~2_8) v_main_~arr~2.offset_7 (- 4))), at (SUMMARY for call #t~mem5 := read~int(~arr~2.base, ~arr~2.offset + ~length~2 * 4 - 4, 4); srcloc: L548')) ((select |v_#memory_int_8| v_main_~a~2.base_8), at (SUMMARY for call write~int(#t~mem4 + #t~mem5, ~a~2.base, ~a~2.offset, 4); srcloc: L548'')) [2018-01-30 00:55:19,174 INFO L547 PartitionManager]: partitioning result: [2018-01-30 00:55:19,174 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 00:55:19,174 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 00:55:19,175 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-30 00:55:19,175 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 00:55:19,175 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 00:55:19,175 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-30 00:55:19,175 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 00:55:19,176 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 00:55:19,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 12:55:19 BasicIcfg [2018-01-30 00:55:19,188 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 00:55:19,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:55:19,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:55:19,192 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:55:19,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:54:38" (1/4) ... [2018-01-30 00:55:19,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bad1ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:55:19, skipping insertion in model container [2018-01-30 00:55:19,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:54:38" (2/4) ... [2018-01-30 00:55:19,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bad1ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:55:19, skipping insertion in model container [2018-01-30 00:55:19,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:54:38" (3/4) ... [2018-01-30 00:55:19,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bad1ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:55:19, skipping insertion in model container [2018-01-30 00:55:19,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 12:55:19" (4/4) ... [2018-01-30 00:55:19,195 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 00:55:19,259 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:55:19,267 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-30 00:55:19,306 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:55:19,306 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:55:19,306 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:55:19,306 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:55:19,306 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:55:19,307 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:55:19,307 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:55:19,307 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:55:19,307 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:55:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-30 00:55:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-30 00:55:19,322 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:55:19,323 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:55:19,323 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 00:55:19,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1085108799, now seen corresponding path program 1 times [2018-01-30 00:55:19,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:55:19,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:55:19,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:19,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:55:19,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:19,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:55:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:19,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:55:19,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:55:19,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:55:19,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:55:19,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:55:19,519 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-01-30 00:55:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:55:19,692 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-01-30 00:55:19,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:55:19,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-30 00:55:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:55:19,703 INFO L225 Difference]: With dead ends: 66 [2018-01-30 00:55:19,703 INFO L226 Difference]: Without dead ends: 50 [2018-01-30 00:55:19,706 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:55:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-30 00:55:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-30 00:55:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-30 00:55:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-30 00:55:19,736 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 14 [2018-01-30 00:55:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:55:19,736 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-30 00:55:19,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:55:19,736 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-30 00:55:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-30 00:55:19,737 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:55:19,737 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:55:19,737 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 00:55:19,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1085108801, now seen corresponding path program 1 times [2018-01-30 00:55:19,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:55:19,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:55:19,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:19,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:55:19,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:19,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:55:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:19,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:55:19,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:55:19,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:55:19,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:55:19,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:55:19,840 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-01-30 00:55:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:55:20,032 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-01-30 00:55:20,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:55:20,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-30 00:55:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:55:20,033 INFO L225 Difference]: With dead ends: 52 [2018-01-30 00:55:20,034 INFO L226 Difference]: Without dead ends: 49 [2018-01-30 00:55:20,035 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:55:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-30 00:55:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-01-30 00:55:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-30 00:55:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-30 00:55:20,041 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 14 [2018-01-30 00:55:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:55:20,041 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-30 00:55:20,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:55:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-30 00:55:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 00:55:20,042 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:55:20,042 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:55:20,042 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 00:55:20,043 INFO L82 PathProgramCache]: Analyzing trace with hash -723273970, now seen corresponding path program 1 times [2018-01-30 00:55:20,043 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:55:20,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:55:20,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:20,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:55:20,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:20,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:55:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:20,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:55:20,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:55:20,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:55:20,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:55:20,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:55:20,073 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2018-01-30 00:55:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:55:20,097 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-01-30 00:55:20,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:55:20,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-30 00:55:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:55:20,098 INFO L225 Difference]: With dead ends: 49 [2018-01-30 00:55:20,098 INFO L226 Difference]: Without dead ends: 44 [2018-01-30 00:55:20,098 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:55:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-30 00:55:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-30 00:55:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-30 00:55:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-01-30 00:55:20,103 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 15 [2018-01-30 00:55:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:55:20,104 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-01-30 00:55:20,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:55:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-01-30 00:55:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 00:55:20,104 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:55:20,105 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:55:20,105 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 00:55:20,105 INFO L82 PathProgramCache]: Analyzing trace with hash -721365356, now seen corresponding path program 1 times [2018-01-30 00:55:20,105 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:55:20,105 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:55:20,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:20,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:55:20,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:20,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:55:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:20,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:55:20,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:55:20,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:55:20,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:55:20,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:55:20,218 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 5 states. [2018-01-30 00:55:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:55:20,298 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-01-30 00:55:20,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:55:20,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-30 00:55:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:55:20,299 INFO L225 Difference]: With dead ends: 44 [2018-01-30 00:55:20,299 INFO L226 Difference]: Without dead ends: 42 [2018-01-30 00:55:20,300 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:55:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-30 00:55:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-30 00:55:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-30 00:55:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-01-30 00:55:20,305 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 15 [2018-01-30 00:55:20,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:55:20,305 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-01-30 00:55:20,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:55:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-01-30 00:55:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:55:20,306 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:55:20,306 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] [2018-01-30 00:55:20,306 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 00:55:20,307 INFO L82 PathProgramCache]: Analyzing trace with hash 984728391, now seen corresponding path program 1 times [2018-01-30 00:55:20,307 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:55:20,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:55:20,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:20,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:55:20,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:20,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:55:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:20,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:55:20,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:55:20,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:55:20,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:55:20,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:55:20,373 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 4 states. [2018-01-30 00:55:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:55:20,405 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-01-30 00:55:20,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:55:20,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-30 00:55:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:55:20,406 INFO L225 Difference]: With dead ends: 42 [2018-01-30 00:55:20,406 INFO L226 Difference]: Without dead ends: 35 [2018-01-30 00:55:20,407 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:55:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-30 00:55:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-30 00:55:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-30 00:55:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-30 00:55:20,412 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 22 [2018-01-30 00:55:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:55:20,412 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-30 00:55:20,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:55:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-30 00:55:20,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:55:20,413 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:55:20,413 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] [2018-01-30 00:55:20,413 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 00:55:20,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1092162755, now seen corresponding path program 1 times [2018-01-30 00:55:20,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:55:20,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:55:20,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:20,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:55:20,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:20,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:55:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:20,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:55:20,483 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:55:20,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:55:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:20,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:55:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:20,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:55:20,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-01-30 00:55:20,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:55:20,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:55:20,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:55:20,568 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-01-30 00:55:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:55:20,650 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-01-30 00:55:20,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:55:20,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-30 00:55:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:55:20,651 INFO L225 Difference]: With dead ends: 46 [2018-01-30 00:55:20,652 INFO L226 Difference]: Without dead ends: 45 [2018-01-30 00:55:20,652 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:55:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-30 00:55:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-01-30 00:55:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-30 00:55:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-30 00:55:20,657 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 28 [2018-01-30 00:55:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:55:20,661 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-30 00:55:20,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:55:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-30 00:55:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:55:20,662 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:55:20,662 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] [2018-01-30 00:55:20,662 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 00:55:20,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1092162757, now seen corresponding path program 1 times [2018-01-30 00:55:20,663 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:55:20,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:55:20,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:20,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:55:20,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:20,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:55:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:21,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:55:21,134 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:55:21,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:55:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:21,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:55:21,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:55:21,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:21,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:21,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-30 00:55:21,271 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 19 treesize of output 15 [2018-01-30 00:55:21,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 00:55:21,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:55:21,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:55:21,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:55:21,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:40 [2018-01-30 00:55:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:21,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:55:21,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-01-30 00:55:21,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 00:55:21,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 00:55:21,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:55:21,514 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 20 states. [2018-01-30 00:55:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:55:21,937 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-30 00:55:21,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:55:21,937 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-01-30 00:55:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:55:21,938 INFO L225 Difference]: With dead ends: 60 [2018-01-30 00:55:21,938 INFO L226 Difference]: Without dead ends: 59 [2018-01-30 00:55:21,939 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:55:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-30 00:55:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2018-01-30 00:55:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-30 00:55:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-01-30 00:55:21,945 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 28 [2018-01-30 00:55:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:55:21,945 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-01-30 00:55:21,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 00:55:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-01-30 00:55:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 00:55:21,946 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:55:21,946 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:55:21,946 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 00:55:21,947 INFO L82 PathProgramCache]: Analyzing trace with hash -660340663, now seen corresponding path program 2 times [2018-01-30 00:55:21,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:55:21,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:55:21,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:21,948 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:55:21,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:21,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:55:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:22,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:55:22,590 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:55:22,595 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:55:22,604 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:55:22,614 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:55:22,616 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:55:22,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:55:22,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:55:22,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:22,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:22,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:55:22,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:22,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:55:22,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:22,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:22,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:22,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:20 [2018-01-30 00:55:22,777 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 20 treesize of output 16 [2018-01-30 00:55:22,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-30 00:55:22,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:55:22,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:55:22,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:55:22,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:55 [2018-01-30 00:55:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:22,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:55:22,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-01-30 00:55:22,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 00:55:22,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 00:55:22,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:55:22,987 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 22 states. [2018-01-30 00:55:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:55:23,627 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-01-30 00:55:23,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 00:55:23,628 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-01-30 00:55:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:55:23,628 INFO L225 Difference]: With dead ends: 74 [2018-01-30 00:55:23,628 INFO L226 Difference]: Without dead ends: 73 [2018-01-30 00:55:23,629 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 00:55:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-30 00:55:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2018-01-30 00:55:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 00:55:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-01-30 00:55:23,634 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 42 [2018-01-30 00:55:23,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:55:23,634 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-01-30 00:55:23,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 00:55:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-01-30 00:55:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:55:23,636 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:55:23,636 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:55:23,636 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 00:55:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash 911897805, now seen corresponding path program 3 times [2018-01-30 00:55:23,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:55:23,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:55:23,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:23,637 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:55:23,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:23,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:55:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:24,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:55:24,441 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:55:24,447 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:55:24,454 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:55:24,458 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:55:24,461 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:55:24,466 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:55:24,468 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:55:24,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:55:24,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:55:24,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:24,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:24,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:55:24,740 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 19 treesize of output 15 [2018-01-30 00:55:24,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 00:55:24,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:55:24,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:55:24,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:55:24,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-30 00:55:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:24,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:55:24,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2018-01-30 00:55:24,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 00:55:24,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 00:55:24,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:55:24,981 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 28 states. [2018-01-30 00:55:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:55:27,286 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2018-01-30 00:55:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 00:55:27,286 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-01-30 00:55:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:55:27,288 INFO L225 Difference]: With dead ends: 130 [2018-01-30 00:55:27,288 INFO L226 Difference]: Without dead ends: 129 [2018-01-30 00:55:27,289 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=881, Invalid=3541, Unknown=0, NotChecked=0, Total=4422 [2018-01-30 00:55:27,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-30 00:55:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-01-30 00:55:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-30 00:55:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-01-30 00:55:27,301 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 56 [2018-01-30 00:55:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:55:27,302 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-01-30 00:55:27,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 00:55:27,302 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-01-30 00:55:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-30 00:55:27,306 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:55:27,306 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:55:27,306 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 00:55:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash -561209123, now seen corresponding path program 4 times [2018-01-30 00:55:27,307 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:55:27,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:55:27,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:27,308 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:55:27,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:27,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:55:27,865 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 27 DAG size of output 22 [2018-01-30 00:55:28,037 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 27 DAG size of output 22 [2018-01-30 00:55:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:29,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:55:29,069 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:55:29,074 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:55:29,117 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:55:29,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:55:29,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:55:29,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:55:29,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:29,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:55:29,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:20 [2018-01-30 00:55:29,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:29,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:55:29,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-01-30 00:55:29,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:29,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:55:29,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-01-30 00:55:29,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:29,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-30 00:55:29,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-01-30 00:55:29,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:29,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:55:29,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-01-30 00:55:29,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-01-30 00:55:29,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-01-30 00:55:29,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:29,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2018-01-30 00:55:30,027 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 20 treesize of output 16 [2018-01-30 00:55:30,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-30 00:55:30,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:55:30,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:55:30,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:55:30,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:55 [2018-01-30 00:55:30,408 WARN L143 SmtUtils]: Spent 303ms on a formula simplification that was a NOOP. DAG size: 28 [2018-01-30 00:55:30,851 WARN L143 SmtUtils]: Spent 271ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-30 00:55:30,892 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:30,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:55:30,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2018-01-30 00:55:30,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-30 00:55:30,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-30 00:55:30,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2006, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 00:55:30,914 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 47 states. [2018-01-30 00:55:33,401 WARN L143 SmtUtils]: Spent 315ms on a formula simplification that was a NOOP. DAG size: 30 [2018-01-30 00:55:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:55:33,506 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-01-30 00:55:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-30 00:55:33,507 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 112 [2018-01-30 00:55:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:55:33,508 INFO L225 Difference]: With dead ends: 144 [2018-01-30 00:55:33,508 INFO L226 Difference]: Without dead ends: 143 [2018-01-30 00:55:33,509 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=538, Invalid=6104, Unknown=0, NotChecked=0, Total=6642 [2018-01-30 00:55:33,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-30 00:55:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 132. [2018-01-30 00:55:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-30 00:55:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-01-30 00:55:33,521 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 112 [2018-01-30 00:55:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:55:33,522 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-01-30 00:55:33,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-30 00:55:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-01-30 00:55:33,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-01-30 00:55:33,525 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:55:33,525 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:55:33,525 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 00:55:33,525 INFO L82 PathProgramCache]: Analyzing trace with hash -612072863, now seen corresponding path program 5 times [2018-01-30 00:55:33,525 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:55:33,525 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:55:33,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:33,526 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:55:33,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:55:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:55:33,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:55:34,679 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 58 DAG size of output 39 [2018-01-30 00:55:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 66 proven. 132 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-01-30 00:55:35,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:55:35,036 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:55:35,042 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:55:35,056 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:55:35,060 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:55:35,065 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:55:35,073 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:55:35,080 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:55:35,090 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:55:35,099 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:55:35,106 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:55:35,113 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:55:35,118 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:55:35,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:55:35,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:55:35,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:55:35,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:35,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:55:35,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:20 [2018-01-30 00:55:35,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:35,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:55:35,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-01-30 00:55:35,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:35,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:55:35,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-01-30 00:55:35,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:35,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-30 00:55:35,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-01-30 00:55:35,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:35,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:55:35,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-01-30 00:55:35,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:35,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:55:35,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-01-30 00:55:35,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:55:35,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-30 00:55:35,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:55:35,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-01-30 00:55:35,934 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 20 treesize of output 16 [2018-01-30 00:55:35,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-30 00:55:35,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:55:35,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:55:35,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:55:35,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:55 [2018-01-30 00:55:36,281 WARN L143 SmtUtils]: Spent 291ms on a formula simplification that was a NOOP. DAG size: 28 [2018-01-30 00:55:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:55:36,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:55:36,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 37 [2018-01-30 00:55:36,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-30 00:55:36,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-30 00:55:36,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2018-01-30 00:55:36,489 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 38 states. [2018-01-30 00:55:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:55:40,995 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2018-01-30 00:55:40,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-01-30 00:55:40,996 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 126 [2018-01-30 00:55:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:55:40,996 INFO L225 Difference]: With dead ends: 157 [2018-01-30 00:55:40,996 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 00:55:40,999 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 103 SyntacticMatches, 14 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2619 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1151, Invalid=7969, Unknown=0, NotChecked=0, Total=9120 [2018-01-30 00:55:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 00:55:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 00:55:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 00:55:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 00:55:41,000 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2018-01-30 00:55:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:55:41,000 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 00:55:41,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-30 00:55:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 00:55:41,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 00:55:41,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 00:55:41,111 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 154 DAG size of output 153 [2018-01-30 00:55:41,535 WARN L146 SmtUtils]: Spent 418ms on a formula simplification. DAG size of input: 153 DAG size of output 67 [2018-01-30 00:55:41,538 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,538 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,538 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 552) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 00:55:41,538 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,538 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 552) the Hoare annotation is: true [2018-01-30 00:55:41,538 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,538 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 552) the Hoare annotation is: true [2018-01-30 00:55:41,538 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point L547'''''''''(lines 547 550) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point mainErr10EnsuresViolation(lines 540 552) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point mainErr6RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point L548''''(line 548) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,539 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point L547(lines 547 550) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point mainErr9RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point L547'''''''(line 547) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point mainErr8RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-30 00:55:41,540 INFO L399 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,541 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-30 00:55:41,541 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 540 552) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 00:55:41,541 INFO L399 ceAbstractionStarter]: For program point mainErr7RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-30 00:55:41,541 INFO L399 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-30 00:55:41,541 INFO L399 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed. [2018-01-30 00:55:41,541 INFO L395 ceAbstractionStarter]: At program point L547''''''''(lines 547 550) the Hoare annotation is: (let ((.cse1 (select |#length| main_~arr~2.base)) (.cse0 (* 4 main_~length~2))) (let ((.cse2 (not (= 0 main_~arr~2.base))) (.cse3 (<= |main_#t~malloc1.offset| 0)) (.cse4 (<= 0 |main_#t~malloc1.offset|)) (.cse5 (= main_~arr~2.base main_~a~2.base)) (.cse6 (= 0 main_~arr~2.offset)) (.cse7 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse8 (= (select |#length| |main_#t~malloc1.base|) .cse0)) (.cse9 (not (= 0 |main_#t~malloc1.base|))) (.cse10 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse11 (= 1 (select |#valid| main_~arr~2.base))) (.cse12 (= .cse1 .cse0))) (or (and (<= (+ (* 3 main_~a~2.offset) .cse0) (+ .cse1 (* 12 (div (+ main_~a~2.offset (+ (- main_~arr~2.offset) (- 28))) 4)) 84)) .cse2 .cse3 .cse4 (<= (+ main_~a~2.offset 4) (select |#length| main_~a~2.base)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 8 main_~a~2.offset)) (and .cse2 (= main_~arr~2.offset main_~a~2.offset) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 4 (+ .cse0 |main_#t~malloc1.offset|))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((v_prenex_1 Int)) (let ((.cse13 (* 4 v_prenex_1))) (and (<= 1 v_prenex_1) (= (select |#length| main_~a~2.base) .cse13) (not (= .cse13 4))))) .cse8 (= (+ main_~arr~2.offset 4) main_~a~2.offset) .cse9 .cse10 .cse11 .cse12)))) [2018-01-30 00:55:41,541 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-30 00:55:41,541 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-30 00:55:41,541 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-30 00:55:41,541 INFO L399 ceAbstractionStarter]: For program point L548'''(line 548) no Hoare annotation was computed. [2018-01-30 00:55:41,541 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-30 00:55:41,541 INFO L399 ceAbstractionStarter]: For program point L547''''''(line 547) no Hoare annotation was computed. [2018-01-30 00:55:41,542 INFO L399 ceAbstractionStarter]: For program point L549''(line 549) no Hoare annotation was computed. [2018-01-30 00:55:41,542 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-30 00:55:41,542 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-30 00:55:41,542 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-30 00:55:41,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:55:41,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:55:41,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:55:41,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:55:41,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:55:41,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:55:41,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:55:41 BasicIcfg [2018-01-30 00:55:41,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:55:41,569 INFO L168 Benchmark]: Toolchain (without parser) took 63533.11 ms. Allocated memory was 306.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 265.1 MB in the beginning and 1.3 GB in the end (delta: -996.1 MB). Peak memory consumption was 967.9 MB. Max. memory is 5.3 GB. [2018-01-30 00:55:41,570 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 306.2 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:55:41,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.09 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 255.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:55:41,570 INFO L168 Benchmark]: Boogie Preprocessor took 31.61 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 253.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 00:55:41,571 INFO L168 Benchmark]: RCFGBuilder took 246.05 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 235.9 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:55:41,571 INFO L168 Benchmark]: IcfgTransformer took 40672.54 ms. Allocated memory was 306.2 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 235.9 MB in the beginning and 744.7 MB in the end (delta: -508.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-30 00:55:41,571 INFO L168 Benchmark]: TraceAbstraction took 22379.12 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 108.5 MB). Free memory was 744.7 MB in the beginning and 1.3 GB in the end (delta: -516.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:55:41,573 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.19 ms. Allocated memory is still 306.2 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 196.09 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 255.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.61 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 246.05 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 235.9 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 40672.54 ms. Allocated memory was 306.2 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 235.9 MB in the beginning and 744.7 MB in the end (delta: -508.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. * TraceAbstraction took 22379.12 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 108.5 MB). Free memory was 744.7 MB in the beginning and 1.3 GB in the end (delta: -516.4 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 : 44 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 4 LocStat_NO_SUPPORTING_EQUALITIES : 866 LocStat_NO_SUPPORTING_DISEQUALITIES : 377 LocStat_NO_DISJUNCTIONS : -88 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 62 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 100 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 67 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 32.032200 RENAME_VARIABLES(MILLISECONDS) : 0.010776 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 31.794135 PROJECTAWAY(MILLISECONDS) : 0.086090 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.041154 DISJOIN(MILLISECONDS) : 9.874312 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.021959 ADD_EQUALITY(MILLISECONDS) : 0.029614 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011073 #CONJOIN_DISJUNCTIVE : 463 #RENAME_VARIABLES : 973 #UNFREEZE : 0 #CONJOIN : 619 #PROJECTAWAY : 518 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 129 #RENAME_VARIABLES_DISJUNCTIVE : 920 #ADD_EQUALITY : 101 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 5 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant [2018-01-30 00:55:41,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:55:41,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:55:41,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:55:41,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:55:41,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:55:41,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:55:41,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:55:41,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((3 * a + 4 * length <= unknown-#length-unknown[arr] + 12 * ((a + (-arr + -28)) / 4) + 84 && !(0 == arr)) && __builtin_alloca (length*sizeof(int)) <= 0) && 0 <= __builtin_alloca (length*sizeof(int))) && a + 4 <= unknown-#length-unknown[a]) && arr == a) && 0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && unknown-#length-unknown[arr] == 4 * length) && 8 <= a) || ((((((((((((!(0 == arr) && arr == a) && __builtin_alloca (length*sizeof(int)) <= 0) && 0 <= __builtin_alloca (length*sizeof(int))) && arr == a) && 0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && unknown-#length-unknown[arr] == 4 * length) && 4 <= 4 * length + __builtin_alloca (length*sizeof(int)))) || ((((((((((((!(0 == arr) && __builtin_alloca (length*sizeof(int)) <= 0) && 0 <= __builtin_alloca (length*sizeof(int))) && arr == a) && 0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && (\exists v_prenex_1 : int :: (1 <= v_prenex_1 && unknown-#length-unknown[a] == 4 * v_prenex_1) && !(4 * v_prenex_1 == 4))) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && arr + 4 == a) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && unknown-#length-unknown[arr] == 4 * length) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 11 error locations. SAFE Result, 22.2s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 437 SDtfs, 2455 SDslu, 3643 SDs, 0 SdLazy, 4255 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 673 GetRequests, 323 SyntacticMatches, 22 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5721 ImplicationChecksByTransitivity, 15.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 58 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 14 NumberOfFragments, 228 HoareAnnotationTreeSize, 5 FomulaSimplifications, 7 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 1231 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 864 NumberOfCodeBlocks, 862 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 847 ConstructedInterpolants, 65 QuantifiedInterpolants, 1711473 SizeOfPredicates, 161 NumberOfNonLiveVariables, 1186 ConjunctsInSsa, 298 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 276/1572 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_00-55-41-598.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_00-55-41-598.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_00-55-41-598.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_00-55-41-598.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-55-41-598.csv Received shutdown request...