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/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:08:26,530 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:08:26,532 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:08:26,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:08:26,546 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:08:26,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:08:26,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:08:26,549 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:08:26,551 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:08:26,551 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:08:26,552 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:08:26,552 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:08:26,553 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:08:26,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:08:26,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:08:26,557 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:08:26,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:08:26,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:08:26,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:08:26,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:08:26,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:08:26,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:08:26,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:08:26,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:08:26,567 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:08:26,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:08:26,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:08:26,569 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:08:26,570 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:08:26,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:08:26,571 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:08:26,571 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-25 00:08:26,581 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:08:26,581 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:08:26,582 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:08:26,582 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:08:26,582 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:08:26,582 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:08:26,583 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:08:26,583 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:08:26,583 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:08:26,584 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:08:26,584 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:08:26,584 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:08:26,584 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:08:26,584 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:08:26,585 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:08:26,585 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:08:26,585 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:08:26,585 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:08:26,585 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:08:26,586 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:08:26,586 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:08:26,586 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:08:26,586 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:08:26,586 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:08:26,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:08:26,587 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:08:26,587 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:08:26,587 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:08:26,587 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:08:26,587 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:08:26,588 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:08:26,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:08:26,588 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:08:26,588 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:08:26,589 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:08:26,589 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:08:26,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:08:26,636 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:08:26,640 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:08:26,642 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:08:26,642 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:08:26,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-25 00:08:26,823 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:08:26,829 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:08:26,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:08:26,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:08:26,862 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:08:26,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:08:26" (1/1) ... [2018-01-25 00:08:26,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2871eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:08:26, skipping insertion in model container [2018-01-25 00:08:26,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:08:26" (1/1) ... [2018-01-25 00:08:26,880 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:08:26,927 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:08:27,044 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:08:27,061 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:08:27,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:08:27 WrapperNode [2018-01-25 00:08:27,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:08:27,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:08:27,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:08:27,070 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:08:27,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:08:27" (1/1) ... [2018-01-25 00:08:27,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:08:27" (1/1) ... [2018-01-25 00:08:27,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:08:27" (1/1) ... [2018-01-25 00:08:27,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:08:27" (1/1) ... [2018-01-25 00:08:27,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:08:27" (1/1) ... [2018-01-25 00:08:27,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:08:27" (1/1) ... [2018-01-25 00:08:27,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:08:27" (1/1) ... [2018-01-25 00:08:27,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:08:27,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:08:27,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:08:27,105 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:08:27,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:08:27" (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-25 00:08:27,151 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:08:27,152 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:08:27,152 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:08:27,152 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-25 00:08:27,152 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-25 00:08:27,152 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:08:27,152 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:08:27,153 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:08:27,153 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:08:27,153 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:08:27,153 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:08:27,153 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:08:27,153 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:08:27,153 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:08:27,154 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:08:27,154 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:08:27,154 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-25 00:08:27,154 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-25 00:08:27,154 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:08:27,154 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:08:27,155 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:08:27,155 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:08:27,416 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:08:27,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:08:27 BoogieIcfgContainer [2018-01-25 00:08:27,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:08:27,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:08:27,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:08:27,421 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:08:27,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:08:26" (1/3) ... [2018-01-25 00:08:27,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b5800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:08:27, skipping insertion in model container [2018-01-25 00:08:27,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:08:27" (2/3) ... [2018-01-25 00:08:27,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b5800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:08:27, skipping insertion in model container [2018-01-25 00:08:27,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:08:27" (3/3) ... [2018-01-25 00:08:27,424 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-25 00:08:27,431 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:08:27,438 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-25 00:08:27,477 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:08:27,477 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:08:27,477 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:08:27,477 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:08:27,477 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:08:27,477 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:08:27,477 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:08:27,477 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:08:27,478 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:08:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-25 00:08:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 00:08:27,502 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:08:27,503 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:08:27,503 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:08:27,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-01-25 00:08:27,509 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:08:27,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:27,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:08:27,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:27,558 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:08:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:08:27,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:08:27,791 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-25 00:08:27,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:08:27,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:08:27,794 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:08:27,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:08:27,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:08:27,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:08:27,886 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-01-25 00:08:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:08:27,949 INFO L93 Difference]: Finished difference Result 148 states and 172 transitions. [2018-01-25 00:08:27,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:08:27,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 00:08:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:08:27,960 INFO L225 Difference]: With dead ends: 148 [2018-01-25 00:08:27,960 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 00:08:27,963 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:08:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 00:08:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-01-25 00:08:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 00:08:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-01-25 00:08:28,005 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-01-25 00:08:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:08:28,005 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-01-25 00:08:28,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:08:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-01-25 00:08:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 00:08:28,008 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:08:28,008 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:08:28,008 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:08:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-01-25 00:08:28,008 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:08:28,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:28,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:08:28,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:28,011 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:08:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:08:28,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:08:28,067 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-25 00:08:28,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:08:28,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:08:28,068 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:08:28,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:08:28,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:08:28,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:08:28,071 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-01-25 00:08:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:08:28,187 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-01-25 00:08:28,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:08:28,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 00:08:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:08:28,189 INFO L225 Difference]: With dead ends: 113 [2018-01-25 00:08:28,190 INFO L226 Difference]: Without dead ends: 107 [2018-01-25 00:08:28,191 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:08:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-25 00:08:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-01-25 00:08:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 00:08:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-25 00:08:28,201 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-01-25 00:08:28,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:08:28,202 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-25 00:08:28,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:08:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-25 00:08:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:08:28,203 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:08:28,203 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:08:28,203 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:08:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-01-25 00:08:28,204 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:08:28,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:28,205 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:08:28,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:28,206 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:08:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:08:28,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:08:28,280 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-25 00:08:28,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:08:28,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:08:28,280 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:08:28,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:08:28,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:08:28,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:08:28,281 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-01-25 00:08:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:08:28,425 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-01-25 00:08:28,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:08:28,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 00:08:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:08:28,427 INFO L225 Difference]: With dead ends: 77 [2018-01-25 00:08:28,427 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 00:08:28,427 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:08:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 00:08:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-01-25 00:08:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 00:08:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-01-25 00:08:28,437 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-01-25 00:08:28,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:08:28,438 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-01-25 00:08:28,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:08:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-01-25 00:08:28,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:08:28,439 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:08:28,439 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:08:28,439 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:08:28,439 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-01-25 00:08:28,440 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:08:28,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:28,442 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:08:28,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:28,442 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:08:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:08:28,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:08:28,754 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-25 00:08:28,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:08:28,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 00:08:28,754 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:08:28,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 00:08:28,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 00:08:28,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:08:28,755 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-01-25 00:08:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:08:29,041 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-01-25 00:08:29,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 00:08:29,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 00:08:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:08:29,043 INFO L225 Difference]: With dead ends: 140 [2018-01-25 00:08:29,043 INFO L226 Difference]: Without dead ends: 80 [2018-01-25 00:08:29,044 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:08:29,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-25 00:08:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-01-25 00:08:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 00:08:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-01-25 00:08:29,054 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-01-25 00:08:29,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:08:29,054 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-01-25 00:08:29,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 00:08:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-01-25 00:08:29,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:08:29,056 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:08:29,056 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:08:29,056 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:08:29,056 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-01-25 00:08:29,056 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:08:29,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:29,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:08:29,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:29,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:08:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:08:29,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:08:29,118 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-25 00:08:29,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:08:29,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:08:29,118 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:08:29,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:08:29,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:08:29,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:08:29,119 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-01-25 00:08:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:08:29,159 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-25 00:08:29,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:08:29,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 00:08:29,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:08:29,160 INFO L225 Difference]: With dead ends: 81 [2018-01-25 00:08:29,161 INFO L226 Difference]: Without dead ends: 77 [2018-01-25 00:08:29,161 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:08:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-25 00:08:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-25 00:08:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 00:08:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-01-25 00:08:29,170 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-01-25 00:08:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:08:29,174 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-01-25 00:08:29,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:08:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-01-25 00:08:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 00:08:29,175 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:08:29,176 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:08:29,176 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:08:29,178 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-01-25 00:08:29,178 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:08:29,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:29,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:08:29,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:29,180 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:08:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:08:29,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:08:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:08:29,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:08:29,461 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:08:29,462 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 00:08:29,463 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [92], [94], [97], [101], [106], [107], [109], [111], [125], [129], [130], [131], [133], [134] [2018-01-25 00:08:29,505 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:08:29,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:08:45,151 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 00:08:45,153 INFO L268 AbstractInterpreter]: Visited 21 different actions 26 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-25 00:08:45,171 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 00:08:45,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:08:45,171 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 00:08:45,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:08:45,178 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:08:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:08:45,210 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:08:45,329 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 17 treesize of output 16 [2018-01-25 00:08:45,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:08:45,344 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 20 treesize of output 19 [2018-01-25 00:08:45,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:08:45,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:08:45,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:08:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:08:45,661 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:08:46,381 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 52 DAG size of output 27 [2018-01-25 00:08:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:08:46,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:08:46,422 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 00:08:46,426 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:08:46,426 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:08:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:08:46,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:08:46,460 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 20 treesize of output 19 [2018-01-25 00:08:46,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:08:46,476 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 17 treesize of output 16 [2018-01-25 00:08:46,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:08:46,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:08:46,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:08:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:08:46,567 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:08:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:08:47,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 00:08:47,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 31 [2018-01-25 00:08:47,246 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 00:08:47,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 00:08:47,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 00:08:47,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-01-25 00:08:47,247 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 18 states. [2018-01-25 00:08:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:08:47,622 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-01-25 00:08:47,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:08:47,623 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-25 00:08:47,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:08:47,624 INFO L225 Difference]: With dead ends: 142 [2018-01-25 00:08:47,624 INFO L226 Difference]: Without dead ends: 82 [2018-01-25 00:08:47,625 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2018-01-25 00:08:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-25 00:08:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-01-25 00:08:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-25 00:08:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-25 00:08:47,634 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 23 [2018-01-25 00:08:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:08:47,634 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-25 00:08:47,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 00:08:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-25 00:08:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 00:08:47,635 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:08:47,635 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:08:47,636 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:08:47,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-01-25 00:08:47,636 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:08:47,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:47,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:08:47,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:08:47,637 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:08:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:08:47,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:08:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:08:47,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:08:47,974 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:08:47,974 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 00:08:47,974 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 00:08:47,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:08:47,974 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 00:08:47,979 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 00:08:47,979 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 00:08:47,989 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 00:08:47,993 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 00:08:47,994 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 00:08:47,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:08:48,021 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 17 treesize of output 16 [2018-01-25 00:08:48,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:08:48,037 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 20 treesize of output 19 [2018-01-25 00:08:48,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:08:48,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:08:48,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:08:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:08:48,235 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:08:48,636 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2018-01-25 00:08:51,203 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 265148 conjuctions. This might take some time... [2018-01-25 00:09:22,550 INFO L170 XnfTransformerHelper]: Simplified to disjunction of 576 conjuctions. [2018-01-25 00:09:22,717 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 576 Received shutdown request... [2018-01-25 00:09:28,858 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 00:09:28,859 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 00:09:28,862 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 00:09:28,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:09:28 BoogieIcfgContainer [2018-01-25 00:09:28,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:09:28,863 INFO L168 Benchmark]: Toolchain (without parser) took 62038.76 ms. Allocated memory was 297.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 256.3 MB in the beginning and 1.3 GB in the end (delta: -995.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-01-25 00:09:28,863 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:09:28,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.68 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 242.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:09:28,864 INFO L168 Benchmark]: Boogie Preprocessor took 34.84 ms. Allocated memory is still 297.3 MB. Free memory was 242.4 MB in the beginning and 241.4 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-25 00:09:28,864 INFO L168 Benchmark]: RCFGBuilder took 311.77 ms. Allocated memory is still 297.3 MB. Free memory was 241.4 MB in the beginning and 218.7 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-25 00:09:28,864 INFO L168 Benchmark]: TraceAbstraction took 61444.07 ms. Allocated memory was 297.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 218.7 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-25 00:09:28,865 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 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.68 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 242.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.84 ms. Allocated memory is still 297.3 MB. Free memory was 242.4 MB in the beginning and 241.4 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 311.77 ms. Allocated memory is still 297.3 MB. Free memory was 241.4 MB in the beginning and 218.7 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 61444.07 ms. Allocated memory was 297.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 218.7 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 126 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.569038 RENAME_VARIABLES(MILLISECONDS) : 0.720293 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.523967 PROJECTAWAY(MILLISECONDS) : 1.918789 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.101753 DISJOIN(MILLISECONDS) : 1.415750 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.817125 ADD_EQUALITY(MILLISECONDS) : 0.038291 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008428 #CONJOIN_DISJUNCTIVE : 42 #RENAME_VARIABLES : 69 #UNFREEZE : 0 #CONJOIN : 82 #PROJECTAWAY : 67 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 66 #ADD_EQUALITY : 51 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1478]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1478). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 576 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 76 locations, 17 error locations. TIMEOUT Result, 61.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 432 SDtfs, 142 SDslu, 1566 SDs, 0 SdLazy, 507 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 15.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 196 ConstructedInterpolants, 28 QuantifiedInterpolants, 56312 SizeOfPredicates, 10 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 0/15 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-09-28-876.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_00-09-28-876.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_00-09-28-876.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-09-28-876.csv Completed graceful shutdown