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/list-ext-properties/960521-1_1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:56:58,432 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:56:58,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:56:58,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:56:58,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:56:58,474 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:56:58,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:56:58,477 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:56:58,479 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:56:58,480 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:56:58,481 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:56:58,481 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:56:58,483 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:56:58,487 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:56:58,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:56:58,490 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:56:58,492 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:56:58,503 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:56:58,504 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:56:58,506 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:56:58,508 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:56:58,508 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:56:58,508 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:56:58,509 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:56:58,510 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:56:58,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:56:58,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:56:58,519 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:56:58,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:56:58,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:56:58,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:56:58,520 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:56:58,541 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:56:58,541 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:56:58,542 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:56:58,542 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:56:58,542 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:56:58,543 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:56:58,543 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:56:58,545 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:56:58,546 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:56:58,546 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:56:58,546 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:56:58,546 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:56:58,546 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:56:58,546 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:56:58,547 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:56:58,547 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:56:58,547 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:56:58,547 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:56:58,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:56:58,547 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:56:58,548 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:56:58,548 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:56:58,549 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:56:58,549 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:56:58,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:56:58,550 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:56:58,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:56:58,550 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:56:58,550 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:56:58,550 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:56:58,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:56:58,551 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:56:58,552 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:56:58,552 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:56:58,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:56:58,620 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:56:58,626 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:56:58,628 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:56:58,628 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:56:58,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i [2018-01-31 09:56:58,877 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:56:58,886 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:56:58,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:56:58,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:56:58,897 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:56:58,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:56:58" (1/1) ... [2018-01-31 09:56:58,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10afa21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:56:58, skipping insertion in model container [2018-01-31 09:56:58,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:56:58" (1/1) ... [2018-01-31 09:56:58,922 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:56:58,977 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:56:59,147 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:56:59,170 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:56:59,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:56:59 WrapperNode [2018-01-31 09:56:59,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:56:59,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:56:59,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:56:59,189 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:56:59,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:56:59" (1/1) ... [2018-01-31 09:56:59,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:56:59" (1/1) ... [2018-01-31 09:56:59,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:56:59" (1/1) ... [2018-01-31 09:56:59,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:56:59" (1/1) ... [2018-01-31 09:56:59,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:56:59" (1/1) ... [2018-01-31 09:56:59,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:56:59" (1/1) ... [2018-01-31 09:56:59,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:56:59" (1/1) ... [2018-01-31 09:56:59,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:56:59,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:56:59,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:56:59,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:56:59,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:56:59" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:56:59,298 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:56:59,298 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:56:59,298 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 09:56:59,298 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:56:59,299 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:56:59,299 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:56:59,299 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:56:59,299 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:56:59,299 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:56:59,299 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:56:59,300 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:56:59,300 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:56:59,300 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 09:56:59,300 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:56:59,300 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:56:59,300 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:56:59,835 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:56:59,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:56:59 BoogieIcfgContainer [2018-01-31 09:56:59,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:56:59,836 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:56:59,837 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:56:59,837 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:56:59,840 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:56:59" (1/1) ... [2018-01-31 09:56:59,848 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:56:59,848 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:56:59,849 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:56:59,894 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 13 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:56:59,936 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:57:00,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:57:33,112 INFO L314 AbstractInterpreter]: Visited 83 different actions 388 times. Merged at 52 different actions 196 times. Widened at 1 different actions 6 times. Found 24 fixpoints after 8 different actions. Largest state had 69 variables. [2018-01-31 09:57:33,114 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:57:33,128 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4 [2018-01-31 09:57:33,128 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:57:33,128 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:57:33,129 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_8| |v_main_#t~post8.base_3|), at (SUMMARY for call write~int(0, #t~post8.base, #t~post8.offset, 4); srcloc: L638'')) ((select |v_#memory_int_2| v_~b.base_2), at (SUMMARY for call write~int(-1, ~b.base, ~b.offset + ~i~4 * 4, 4); srcloc: L628)) ((select |v_#memory_int_4| v_~a.base_2), at (SUMMARY for call write~int(-1, ~a.base, ~a.offset + ~i~4 * 4, 4); srcloc: L626)) ((select (select |v_#memory_int_11| v_~b.base_12) (+ v_~b.offset_11 (- 4))), at (SUMMARY for call #t~mem10 := read~int(~b.base, ~b.offset + -4, 4); srcloc: L639')) [2018-01-31 09:57:33,147 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:57:33,147 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:57:33,147 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:57:33,147 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 4 [2018-01-31 09:57:33,148 INFO L564 PartitionManager]: # location blocks :3 [2018-01-31 09:57:33,148 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:57:33,148 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-31 09:57:33,148 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:57:33,148 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:57:33,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:57:33 BasicIcfg [2018-01-31 09:57:33,171 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:57:33,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:57:33,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:57:33,175 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:57:33,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:56:58" (1/4) ... [2018-01-31 09:57:33,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a64b4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:57:33, skipping insertion in model container [2018-01-31 09:57:33,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:56:59" (2/4) ... [2018-01-31 09:57:33,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a64b4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:57:33, skipping insertion in model container [2018-01-31 09:57:33,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:56:59" (3/4) ... [2018-01-31 09:57:33,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a64b4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:57:33, skipping insertion in model container [2018-01-31 09:57:33,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:57:33" (4/4) ... [2018-01-31 09:57:33,180 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:57:33,190 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:57:33,283 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-31 09:57:33,322 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:57:33,333 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:57:33,333 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:57:33,333 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:57:33,334 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:57:33,334 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:57:33,334 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:57:33,334 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:57:33,335 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:57:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2018-01-31 09:57:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-31 09:57:33,353 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:57:33,354 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:57:33,354 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:57:33,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1182210392, now seen corresponding path program 1 times [2018-01-31 09:57:33,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:57:33,359 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:57:33,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:33,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:57:33,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:57:33,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:57:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:57:33,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:57:33,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:57:33,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-31 09:57:33,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-31 09:57:33,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 09:57:33,492 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2018-01-31 09:57:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:57:33,522 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2018-01-31 09:57:33,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-31 09:57:33,523 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-31 09:57:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:57:33,534 INFO L225 Difference]: With dead ends: 130 [2018-01-31 09:57:33,534 INFO L226 Difference]: Without dead ends: 71 [2018-01-31 09:57:33,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 09:57:33,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-31 09:57:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-31 09:57:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 09:57:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-01-31 09:57:33,573 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 11 [2018-01-31 09:57:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:57:33,573 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-01-31 09:57:33,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-31 09:57:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-01-31 09:57:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-31 09:57:33,574 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:57:33,574 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:57:33,574 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:57:33,574 INFO L82 PathProgramCache]: Analyzing trace with hash 874102517, now seen corresponding path program 1 times [2018-01-31 09:57:33,575 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:57:33,575 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:57:33,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:33,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:57:33,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:57:33,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:57:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:57:33,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:57:33,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:57:33,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:57:33,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:57:33,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:57:33,799 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 5 states. [2018-01-31 09:57:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:57:34,216 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-01-31 09:57:34,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:57:34,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-31 09:57:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:57:34,218 INFO L225 Difference]: With dead ends: 71 [2018-01-31 09:57:34,219 INFO L226 Difference]: Without dead ends: 68 [2018-01-31 09:57:34,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:57:34,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-31 09:57:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-31 09:57:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-31 09:57:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-01-31 09:57:34,227 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 14 [2018-01-31 09:57:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:57:34,228 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-01-31 09:57:34,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:57:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-01-31 09:57:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-31 09:57:34,229 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:57:34,229 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:57:34,229 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:57:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash 874102519, now seen corresponding path program 1 times [2018-01-31 09:57:34,229 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:57:34,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:57:34,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:34,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:57:34,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:57:34,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:57:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:57:34,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:57:34,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:57:34,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:57:34,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:57:34,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:57:34,393 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 6 states. [2018-01-31 09:57:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:57:35,058 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-01-31 09:57:35,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:57:35,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-31 09:57:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:57:35,060 INFO L225 Difference]: With dead ends: 125 [2018-01-31 09:57:35,060 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 09:57:35,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:57:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 09:57:35,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 79. [2018-01-31 09:57:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-31 09:57:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-31 09:57:35,070 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 14 [2018-01-31 09:57:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:57:35,070 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-31 09:57:35,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:57:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-31 09:57:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 09:57:35,071 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:57:35,072 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:57:35,072 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:57:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1701024, now seen corresponding path program 1 times [2018-01-31 09:57:35,072 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:57:35,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:57:35,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:35,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:57:35,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:57:35,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:57:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:57:35,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:57:35,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:57:35,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:57:35,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:57:35,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:57:35,271 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-01-31 09:57:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:57:35,616 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2018-01-31 09:57:35,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:57:35,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-31 09:57:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:57:35,618 INFO L225 Difference]: With dead ends: 121 [2018-01-31 09:57:35,618 INFO L226 Difference]: Without dead ends: 117 [2018-01-31 09:57:35,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:57:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-31 09:57:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 96. [2018-01-31 09:57:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-31 09:57:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-01-31 09:57:35,629 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 17 [2018-01-31 09:57:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:57:35,630 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-01-31 09:57:35,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:57:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-01-31 09:57:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 09:57:35,631 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:57:35,631 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:57:35,631 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:57:35,631 INFO L82 PathProgramCache]: Analyzing trace with hash -864114393, now seen corresponding path program 1 times [2018-01-31 09:57:35,631 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:57:35,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:57:35,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:35,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:57:35,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:57:35,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:57:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:57:35,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:57:35,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:57:35,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:57:35,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:57:35,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:57:35,695 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 4 states. [2018-01-31 09:57:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:57:35,743 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-01-31 09:57:35,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:57:35,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-31 09:57:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:57:35,745 INFO L225 Difference]: With dead ends: 114 [2018-01-31 09:57:35,745 INFO L226 Difference]: Without dead ends: 112 [2018-01-31 09:57:35,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:57:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-31 09:57:35,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2018-01-31 09:57:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-31 09:57:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-01-31 09:57:35,758 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 20 [2018-01-31 09:57:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:57:35,758 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-01-31 09:57:35,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:57:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-01-31 09:57:35,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 09:57:35,759 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:57:35,759 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:57:35,759 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:57:35,760 INFO L82 PathProgramCache]: Analyzing trace with hash -864114391, now seen corresponding path program 1 times [2018-01-31 09:57:35,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:57:35,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:57:35,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:35,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:57:35,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:57:35,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:57:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:57:35,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:57:35,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:57:35,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:57:35,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:57:35,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:57:35,935 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 7 states. [2018-01-31 09:57:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:57:36,038 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-01-31 09:57:36,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:57:36,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-31 09:57:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:57:36,040 INFO L225 Difference]: With dead ends: 94 [2018-01-31 09:57:36,040 INFO L226 Difference]: Without dead ends: 91 [2018-01-31 09:57:36,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:57:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-31 09:57:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-01-31 09:57:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-31 09:57:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-01-31 09:57:36,049 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 20 [2018-01-31 09:57:36,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:57:36,049 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-01-31 09:57:36,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:57:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-01-31 09:57:36,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:57:36,051 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:57:36,051 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:57:36,051 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:57:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash -954819142, now seen corresponding path program 1 times [2018-01-31 09:57:36,051 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:57:36,051 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:57:36,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:36,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:57:36,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:57:36,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:57:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:57:36,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:57:36,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:57:36,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:57:36,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:57:36,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:57:36,199 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 7 states. [2018-01-31 09:57:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:57:36,347 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-01-31 09:57:36,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:57:36,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-31 09:57:36,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:57:36,351 INFO L225 Difference]: With dead ends: 143 [2018-01-31 09:57:36,351 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 09:57:36,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:57:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 09:57:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2018-01-31 09:57:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-31 09:57:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-01-31 09:57:36,363 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 21 [2018-01-31 09:57:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:57:36,363 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-01-31 09:57:36,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:57:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-01-31 09:57:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:57:36,364 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:57:36,364 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:57:36,364 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:57:36,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1017742026, now seen corresponding path program 1 times [2018-01-31 09:57:36,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:57:36,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:57:36,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:36,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:57:36,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:57:36,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:57:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:57:36,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:57:36,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 09:57:36,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:57:36,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:57:36,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:57:36,590 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 9 states. [2018-01-31 09:57:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:57:37,079 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-01-31 09:57:37,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 09:57:37,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-31 09:57:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:57:37,081 INFO L225 Difference]: With dead ends: 138 [2018-01-31 09:57:37,081 INFO L226 Difference]: Without dead ends: 133 [2018-01-31 09:57:37,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:57:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-31 09:57:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 95. [2018-01-31 09:57:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-31 09:57:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2018-01-31 09:57:37,092 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 21 [2018-01-31 09:57:37,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:57:37,092 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2018-01-31 09:57:37,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:57:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2018-01-31 09:57:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:57:37,093 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:57:37,094 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:57:37,094 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 09:57:37,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1017680330, now seen corresponding path program 1 times [2018-01-31 09:57:37,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:57:37,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:57:37,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:37,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:57:37,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:57:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:57:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:57:37,144 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 09:57:37,147 INFO L84 mationBacktranslator]: Skipped ATE [333] [333] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{~n=v_~n_6, #valid=|v_#valid_7|, ~a.base=v_~a.base_5, ~b.offset=v_~b.offset_4, #NULL.offset=|v_#NULL.offset_2|, ~a.offset=v_~a.offset_4, #NULL.base=|v_#NULL.base_2|, ~b.base=v_~b.base_5} AuxVars[] AssignedVars[~n, #valid, ~a.base, ~b.offset, #NULL.offset, ~a.offset, #NULL.base, ~b.base] [2018-01-31 09:57:37,147 INFO L84 mationBacktranslator]: Skipped ATE [339] [339] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-31 09:57:37,147 INFO L84 mationBacktranslator]: Skipped ATE [345] [345] mainENTRY-->L633''''': Formula: (= v_~n_14 1) InVars {} OutVars{~n=v_~n_14} AuxVars[] AssignedVars[~n] [2018-01-31 09:57:37,148 INFO L84 mationBacktranslator]: Skipped ATE [349] [349] L633'''''-->L633: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-31 09:57:37,148 INFO L84 mationBacktranslator]: Skipped ATE [355] [355] L633-->L633': Formula: (and (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_2|} AuxVars[] AssignedVars[] [2018-01-31 09:57:37,148 INFO L84 mationBacktranslator]: Skipped ATE [361] [361] L633'-->L633'': Formula: (or (not (< v_~n_15 30)) (= |v_main_#t~nondet4_3| 0)) InVars {~n=v_~n_15, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{~n=v_~n_15, main_#t~nondet4=|v_main_#t~nondet4_3|} AuxVars[] AssignedVars[] [2018-01-31 09:57:37,148 INFO L84 mationBacktranslator]: Skipped ATE [369] [369] L633''-->L633'''''': Formula: true InVars {} OutVars{main_#t~nondet4=|v_main_#t~nondet4_4|} AuxVars[] AssignedVars[main_#t~nondet4] [2018-01-31 09:57:37,148 INFO L84 mationBacktranslator]: Skipped ATE [357] [357] L633''''''-->L636: Formula: (and (not (= 0 |v_main_#t~malloc6.base_1|)) (= |v_#length_7| (store |v_#length_8| |v_main_#t~malloc6.base_1| (* 4 v_~n_12))) (= |v_main_#t~malloc6.offset_1| 0) (= |v_#valid_11| (store |v_#valid_12| |v_main_#t~malloc6.base_1| 1)) (= (select |v_#valid_12| |v_main_#t~malloc6.base_1|) 0)) InVars {~n=v_~n_12, #length=|v_#length_8|, #valid=|v_#valid_12|} OutVars{~n=v_~n_12, #length=|v_#length_7|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] [2018-01-31 09:57:37,148 INFO L84 mationBacktranslator]: Skipped ATE [365] [365] L636-->L637: Formula: (and (= v_~a.offset_8 |v_main_#t~malloc6.offset_2|) (= v_~a.base_9 |v_main_#t~malloc6.base_2|)) InVars {main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|, main_#t~malloc6.base=|v_main_#t~malloc6.base_2|} OutVars{main_#t~malloc6.base=|v_main_#t~malloc6.base_2|, ~a.offset=v_~a.offset_8, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|, ~a.base=v_~a.base_9} AuxVars[] AssignedVars[~a.base, ~a.offset] [2018-01-31 09:57:37,149 INFO L84 mationBacktranslator]: Skipped ATE [373] [373] L637-->L637': Formula: (and (= (store |v_#length_10| |v_main_#t~malloc7.base_1| (* 4 v_~n_13)) |v_#length_9|) (= |v_#valid_13| (store |v_#valid_14| |v_main_#t~malloc7.base_1| 1)) (not (= |v_main_#t~malloc7.base_1| 0)) (= |v_main_#t~malloc7.offset_1| 0) (= 0 (select |v_#valid_14| |v_main_#t~malloc7.base_1|))) InVars {~n=v_~n_13, #length=|v_#length_10|, #valid=|v_#valid_14|} OutVars{~n=v_~n_13, #length=|v_#length_9|, main_#t~malloc7.base=|v_main_#t~malloc7.base_1|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_1|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[main_#t~malloc7.offset, #valid, #length, main_#t~malloc7.base] [2018-01-31 09:57:37,149 INFO L84 mationBacktranslator]: Skipped ATE [379] [379] L637'-->L638: Formula: (and (= v_~b.offset_8 |v_main_#t~malloc7.offset_2|) (= v_~b.base_9 |v_main_#t~malloc7.base_2|)) InVars {main_#t~malloc7.offset=|v_main_#t~malloc7.offset_2|, main_#t~malloc7.base=|v_main_#t~malloc7.base_2|} OutVars{main_#t~malloc7.base=|v_main_#t~malloc7.base_2|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_2|, ~b.base=v_~b.base_9, ~b.offset=v_~b.offset_8} AuxVars[] AssignedVars[~b.offset, ~b.base] [2018-01-31 09:57:37,149 INFO L84 mationBacktranslator]: Skipped ATE [383] [383] L638-->L638': Formula: (and (= |v_main_#t~post8.offset_1| v_~b.offset_9) (= |v_main_#t~post8.base_1| v_~b.base_10)) InVars {~b.base=v_~b.base_10, ~b.offset=v_~b.offset_9} OutVars{main_#t~post8.base=|v_main_#t~post8.base_1|, main_#t~post8.offset=|v_main_#t~post8.offset_1|, ~b.base=v_~b.base_10, ~b.offset=v_~b.offset_9} AuxVars[] AssignedVars[main_#t~post8.base, main_#t~post8.offset] [2018-01-31 09:57:37,149 INFO L84 mationBacktranslator]: Skipped ATE [387] [387] L638'-->L638'': Formula: (and (= v_~b.base_11 |v_main_#t~post8.base_2|) (= v_~b.offset_10 (+ |v_main_#t~post8.offset_2| 4))) InVars {main_#t~post8.base=|v_main_#t~post8.base_2|, main_#t~post8.offset=|v_main_#t~post8.offset_2|} OutVars{main_#t~post8.base=|v_main_#t~post8.base_2|, ~b.base=v_~b.base_11, main_#t~post8.offset=|v_main_#t~post8.offset_2|, ~b.offset=v_~b.offset_10} AuxVars[] AssignedVars[~b.offset, ~b.base] [2018-01-31 09:57:37,149 INFO L84 mationBacktranslator]: Skipped ATE [389] [389] L638''-->L638''': Formula: (and (<= (+ |v_main_#t~post8.offset_3| 4) (select |v_#length_11| |v_main_#t~post8.base_3|)) (and (= |v_#memory_int_part_locs_40_locs_19_1| |v_#memory_int_part_locs_40_locs_19_2|) (= |v_#memory_int_part_locs_30_locs_19_1| |v_#memory_int_part_locs_30_locs_19_2|) (= (store |v_#memory_int_part_locs_76_locs_19_1| |v_main_#t~post8.base_3| (store (select |v_#memory_int_part_locs_30_locs_19_1| |v_main_#t~post8.base_3|) |v_main_#t~post8.offset_3| 0)) |v_#memory_int_part_locs_76_locs_19_2|)) (<= 0 |v_main_#t~post8.offset_3|) (= 1 (select |v_#valid_15| |v_main_#t~post8.base_3|))) InVars {#memory_int_part_locs_40_locs_19=|v_#memory_int_part_locs_40_locs_19_1|, #memory_int_part_locs_30_locs_19=|v_#memory_int_part_locs_30_locs_19_1|, #valid=|v_#valid_15|, #length=|v_#length_11|, #memory_int_part_locs_76_locs_19=|v_#memory_int_part_locs_76_locs_19_1|, main_#t~post8.base=|v_main_#t~post8.base_3|, main_#t~post8.offset=|v_main_#t~post8.offset_3|} OutVars{#memory_int_part_locs_40_locs_19=|v_#memory_int_part_locs_40_locs_19_2|, #memory_int_part_locs_30_locs_19=|v_#memory_int_part_locs_30_locs_19_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, #memory_int_part_locs_76_locs_19=|v_#memory_int_part_locs_76_locs_19_2|, main_#t~post8.base=|v_main_#t~post8.base_3|, main_#t~post8.offset=|v_main_#t~post8.offset_3|} AuxVars[] AssignedVars[#memory_int_part_locs_40_locs_19, #memory_int_part_locs_30_locs_19, #memory_int, #memory_int_part_locs_76_locs_19] [2018-01-31 09:57:37,149 INFO L84 mationBacktranslator]: Skipped ATE [395] [395] L638'''-->L639: Formula: true InVars {} OutVars{main_#t~post8.base=|v_main_#t~post8.base_6|, main_#t~post8.offset=|v_main_#t~post8.offset_5|} AuxVars[] AssignedVars[main_#t~post8.base, main_#t~post8.offset] [2018-01-31 09:57:37,149 INFO L84 mationBacktranslator]: Skipped ATE [397] [397] L639-->L639': Formula: true InVars {} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[#memory_int] [2018-01-31 09:57:37,150 INFO L84 mationBacktranslator]: Skipped ATE [401] [401] L639'-->L640: Formula: (and (<= v_~b.offset_11 (select |v_#length_13| v_~b.base_12)) (<= 4 v_~b.offset_11) (= (select (select |v_#memory_int_part_locs_76_locs_19_3| v_~b.base_12) (+ v_~b.offset_11 (- 4))) |v_main_#t~mem10_1|) (= (select |v_#valid_17| v_~b.base_12) 1)) InVars {#length=|v_#length_13|, #memory_int_part_locs_76_locs_19=|v_#memory_int_part_locs_76_locs_19_3|, ~b.base=v_~b.base_12, ~b.offset=v_~b.offset_11, #valid=|v_#valid_17|} OutVars{main_#t~mem10=|v_main_#t~mem10_1|, ~b.offset=v_~b.offset_11, #valid=|v_#valid_17|, #length=|v_#length_13|, #memory_int_part_locs_76_locs_19=|v_#memory_int_part_locs_76_locs_19_3|, ~b.base=v_~b.base_12} AuxVars[] AssignedVars[main_#t~mem10] [2018-01-31 09:57:37,150 INFO L84 mationBacktranslator]: Skipped ATE [411] [411] L640-->L640'': Formula: (= 0 |v_main_#t~mem10_4|) InVars {main_#t~mem10=|v_main_#t~mem10_4|} OutVars{main_#t~mem10=|v_main_#t~mem10_4|} AuxVars[] AssignedVars[] [2018-01-31 09:57:37,150 INFO L84 mationBacktranslator]: Skipped ATE [417] [417] L640''-->L643: Formula: true InVars {} OutVars{main_#t~mem10=|v_main_#t~mem10_5|} AuxVars[] AssignedVars[main_#t~mem10] [2018-01-31 09:57:37,150 INFO L84 mationBacktranslator]: Skipped ATE [429] [429] L643-->L643': Formula: (let ((.cse0 (= v_~a.base_12 0))) (and (= 0 v_~a.offset_11) (or .cse0 (= (store |v_#valid_26| v_~a.base_12 0) |v_#valid_25|)) (or (= |v_#valid_26| |v_#valid_25|) (not .cse0)) (or .cse0 (= 1 (select |v_#valid_26| v_~a.base_12))))) InVars {~a.offset=v_~a.offset_11, #valid=|v_#valid_26|, ~a.base=v_~a.base_12} OutVars{~a.offset=v_~a.offset_11, #valid=|v_#valid_25|, ~a.base=v_~a.base_12} AuxVars[] AssignedVars[#valid] [2018-01-31 09:57:37,150 INFO L84 mationBacktranslator]: Skipped ATE [449] [449] L643'-->mainErr10RequiresViolation: Formula: (not (= v_~b.offset_16 0)) InVars {~b.offset=v_~b.offset_16} OutVars{~b.offset=v_~b.offset_16} AuxVars[] AssignedVars[] [2018-01-31 09:57:37,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:57:37 BasicIcfg [2018-01-31 09:57:37,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:57:37,157 INFO L168 Benchmark]: Toolchain (without parser) took 38279.56 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 266.9 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 301.3 MB. Max. memory is 5.3 GB. [2018-01-31 09:57:37,158 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 307.2 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:57:37,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.56 ms. Allocated memory is still 307.2 MB. Free memory was 265.9 MB in the beginning and 256.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:57:37,158 INFO L168 Benchmark]: Boogie Preprocessor took 47.84 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:57:37,158 INFO L168 Benchmark]: RCFGBuilder took 599.52 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 232.9 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:57:37,159 INFO L168 Benchmark]: IcfgTransformer took 33335.09 ms. Allocated memory was 307.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 232.9 MB in the beginning and 968.9 MB in the end (delta: -735.9 MB). Peak memory consumption was 991.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:57:37,159 INFO L168 Benchmark]: TraceAbstraction took 3983.89 ms. Allocated memory was 2.0 GB in the beginning and 2.3 GB in the end (delta: 230.2 MB). Free memory was 968.9 MB in the beginning and 1.9 GB in the end (delta: -953.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:57:37,161 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.21 ms. Allocated memory is still 307.2 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 300.56 ms. Allocated memory is still 307.2 MB. Free memory was 265.9 MB in the beginning and 256.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 47.84 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 599.52 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 232.9 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 33335.09 ms. Allocated memory was 307.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 232.9 MB in the beginning and 968.9 MB in the end (delta: -735.9 MB). Peak memory consumption was 991.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3983.89 ms. Allocated memory was 2.0 GB in the beginning and 2.3 GB in the end (delta: 230.2 MB). Free memory was 968.9 MB in the beginning and 1.9 GB in the end (delta: -953.9 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 63 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 2134 LocStat_NO_SUPPORTING_DISEQUALITIES : 1768 LocStat_NO_DISJUNCTIONS : -126 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 92 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 251 TransStat_NO_SUPPORTING_DISEQUALITIES : 31 TransStat_NO_DISJUNCTIONS : 106 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.005044 RENAME_VARIABLES(MILLISECONDS) : 2.005735 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001160 PROJECTAWAY(MILLISECONDS) : 0.258304 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.050892 DISJOIN(MILLISECONDS) : 1.257553 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.035830 ADD_EQUALITY(MILLISECONDS) : 0.034538 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.021913 #CONJOIN_DISJUNCTIVE : 641 #RENAME_VARIABLES : 1405 #UNFREEZE : 0 #CONJOIN : 1106 #PROJECTAWAY : 758 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 173 #RENAME_VARIABLES_DISJUNCTIVE : 1333 #ADD_EQUALITY : 210 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 25 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 4 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 74 locations, 17 error locations. UNSAFE Result, 3.8s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 465 SDtfs, 614 SDslu, 1175 SDs, 0 SdLazy, 726 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=4, 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, 8 MinimizatonAttempts, 148 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 12306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-57-37-171.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-57-37-171.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-57-37-171.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-57-37-171.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-57-37-171.csv Received shutdown request...