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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:24:59,602 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:24:59,604 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:24:59,619 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:24:59,619 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:24:59,620 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:24:59,621 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:24:59,623 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:24:59,625 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:24:59,626 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:24:59,627 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:24:59,627 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:24:59,628 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:24:59,629 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:24:59,630 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:24:59,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:24:59,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:24:59,636 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:24:59,638 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:24:59,639 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:24:59,641 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:24:59,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:24:59,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:24:59,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:24:59,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:24:59,645 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:24:59,645 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:24:59,646 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:24:59,646 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:24:59,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:24:59,647 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:24:59,647 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:24:59,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:24:59,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:24:59,656 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:24:59,656 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:24:59,657 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:24:59,657 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:24:59,657 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:24:59,657 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:24:59,657 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:24:59,657 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:24:59,658 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:24:59,658 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:24:59,658 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:24:59,658 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:24:59,658 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:24:59,658 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:24:59,658 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:24:59,658 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:24:59,659 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:24:59,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:24:59,659 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:24:59,659 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:24:59,659 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:24:59,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:24:59,660 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:24:59,660 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:24:59,660 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:24:59,660 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:24:59,660 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:24:59,661 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:24:59,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:24:59,661 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:24:59,661 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:24:59,662 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:24:59,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:24:59,704 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:24:59,707 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:24:59,708 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:24:59,708 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:24:59,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-01-24 13:24:59,888 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:24:59,894 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:24:59,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:24:59,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:24:59,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:24:59,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:24:59" (1/1) ... [2018-01-24 13:24:59,904 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 24.01 01:24:59, skipping insertion in model container [2018-01-24 13:24:59,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:24:59" (1/1) ... [2018-01-24 13:24:59,917 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:24:59,963 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:25:00,081 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:25:00,103 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:25:00,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:25:00 WrapperNode [2018-01-24 13:25:00,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:25:00,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:25:00,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:25:00,111 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:25:00,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:25:00" (1/1) ... [2018-01-24 13:25:00,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:25:00" (1/1) ... [2018-01-24 13:25:00,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:25:00" (1/1) ... [2018-01-24 13:25:00,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:25:00" (1/1) ... [2018-01-24 13:25:00,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:25:00" (1/1) ... [2018-01-24 13:25:00,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:25:00" (1/1) ... [2018-01-24 13:25:00,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:25:00" (1/1) ... [2018-01-24 13:25:00,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:25:00,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:25:00,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:25:00,142 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:25:00,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:25:00" (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-24 13:25:00,190 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:25:00,190 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:25:00,190 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 13:25:00,190 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-24 13:25:00,190 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 13:25:00,190 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:25:00,190 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:25:00,190 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:25:00,191 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:25:00,191 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:25:00,191 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:25:00,191 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:25:00,191 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:25:00,191 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:25:00,191 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 13:25:00,191 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-24 13:25:00,191 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 13:25:00,191 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:25:00,192 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:25:00,192 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:25:00,434 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:25:00,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:25:00 BoogieIcfgContainer [2018-01-24 13:25:00,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:25:00,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:25:00,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:25:00,438 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:25:00,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:24:59" (1/3) ... [2018-01-24 13:25:00,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfe1987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:25:00, skipping insertion in model container [2018-01-24 13:25:00,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:25:00" (2/3) ... [2018-01-24 13:25:00,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfe1987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:25:00, skipping insertion in model container [2018-01-24 13:25:00,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:25:00" (3/3) ... [2018-01-24 13:25:00,441 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-01-24 13:25:00,447 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:25:00,453 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 13:25:00,497 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:25:00,498 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:25:00,498 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:25:00,498 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:25:00,498 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:25:00,498 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:25:00,498 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:25:00,498 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:25:00,499 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:25:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-24 13:25:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:25:00,528 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:25:00,529 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:25:00,529 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:25:00,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029176, now seen corresponding path program 1 times [2018-01-24 13:25:00,538 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:25:00,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:00,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:25:00,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:00,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:25:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:25:00,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:25:00,741 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-24 13:25:00,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:25:00,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:25:00,744 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:25:00,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:25:00,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:25:00,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:25:00,827 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-24 13:25:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:25:01,007 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2018-01-24 13:25:01,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:25:01,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 13:25:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:25:01,024 INFO L225 Difference]: With dead ends: 148 [2018-01-24 13:25:01,024 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 13:25:01,029 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-24 13:25:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 13:25:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-01-24 13:25:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 13:25:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-01-24 13:25:01,073 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2018-01-24 13:25:01,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:25:01,074 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-01-24 13:25:01,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:25:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-01-24 13:25:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:25:01,076 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:25:01,076 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:25:01,076 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:25:01,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1524292544, now seen corresponding path program 1 times [2018-01-24 13:25:01,077 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:25:01,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:01,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:25:01,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:01,080 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:25:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:25:01,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:25:01,171 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-24 13:25:01,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:25:01,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:25:01,171 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:25:01,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:25:01,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:25:01,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:25:01,174 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-01-24 13:25:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:25:01,200 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2018-01-24 13:25:01,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:25:01,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 13:25:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:25:01,202 INFO L225 Difference]: With dead ends: 116 [2018-01-24 13:25:01,202 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 13:25:01,204 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-24 13:25:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 13:25:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-01-24 13:25:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 13:25:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-01-24 13:25:01,210 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 17 [2018-01-24 13:25:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:25:01,210 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-01-24 13:25:01,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:25:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-01-24 13:25:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:25:01,211 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:25:01,211 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-24 13:25:01,211 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:25:01,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1268239334, now seen corresponding path program 1 times [2018-01-24 13:25:01,211 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:25:01,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:01,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:25:01,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:01,213 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:25:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:25:01,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:25:01,283 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-24 13:25:01,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:25:01,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:25:01,284 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:25:01,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:25:01,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:25:01,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:25:01,285 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2018-01-24 13:25:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:25:01,355 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-01-24 13:25:01,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:25:01,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 13:25:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:25:01,357 INFO L225 Difference]: With dead ends: 65 [2018-01-24 13:25:01,357 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 13:25:01,358 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-24 13:25:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 13:25:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-24 13:25:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 13:25:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-01-24 13:25:01,366 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-01-24 13:25:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:25:01,366 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-01-24 13:25:01,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:25:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-01-24 13:25:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:25:01,367 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:25:01,367 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-24 13:25:01,368 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:25:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975966, now seen corresponding path program 1 times [2018-01-24 13:25:01,368 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:25:01,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:01,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:25:01,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:01,370 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:25:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:25:01,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:25:01,434 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-24 13:25:01,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:25:01,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:25:01,435 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:25:01,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:25:01,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:25:01,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:25:01,435 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-01-24 13:25:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:25:01,561 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-01-24 13:25:01,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:25:01,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 13:25:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:25:01,562 INFO L225 Difference]: With dead ends: 61 [2018-01-24 13:25:01,562 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 13:25:01,563 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-24 13:25:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 13:25:01,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 13:25:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 13:25:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-24 13:25:01,568 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 19 [2018-01-24 13:25:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:25:01,568 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-24 13:25:01,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:25:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-24 13:25:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:25:01,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:25:01,569 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-24 13:25:01,569 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:25:01,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975965, now seen corresponding path program 1 times [2018-01-24 13:25:01,569 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:25:01,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:01,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:25:01,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:01,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:25:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:25:01,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:25:01,793 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-24 13:25:01,957 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-24 13:25:01,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:25:01,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:25:01,957 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:25:01,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:25:01,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:25:01,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:25:01,958 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2018-01-24 13:25:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:25:02,173 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-01-24 13:25:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:25:02,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 13:25:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:25:02,181 INFO L225 Difference]: With dead ends: 110 [2018-01-24 13:25:02,181 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 13:25:02,181 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-24 13:25:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 13:25:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-01-24 13:25:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 13:25:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-24 13:25:02,188 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 19 [2018-01-24 13:25:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:25:02,189 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-24 13:25:02,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:25:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-24 13:25:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:25:02,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:25:02,189 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-24 13:25:02,189 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:25:02,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1174934022, now seen corresponding path program 1 times [2018-01-24 13:25:02,190 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:25:02,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:02,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:25:02,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:02,191 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:25:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:25:02,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:25:02,455 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-24 13:25:02,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:25:02,456 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-24 13:25:02,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:25:02,467 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:25:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:25:02,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:25:02,556 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-24 13:25:02,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:25:02,570 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-24 13:25:02,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:25:02,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:25:02,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:25:02,842 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-24 13:25:02,842 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:25:03,366 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-24 13:25:03,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:25:03,399 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-24 13:25:03,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:25:03,404 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:25:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:25:03,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:25:03,441 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-24 13:25:03,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:25:03,452 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-24 13:25:03,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:25:03,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:25:03,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:25:03,532 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-24 13:25:03,533 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:25:04,125 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-24 13:25:04,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:25:04,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 31 [2018-01-24 13:25:04,127 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:25:04,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 13:25:04,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 13:25:04,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-01-24 13:25:04,128 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 18 states. [2018-01-24 13:25:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:25:04,539 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2018-01-24 13:25:04,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:25:04,539 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-24 13:25:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:25:04,540 INFO L225 Difference]: With dead ends: 114 [2018-01-24 13:25:04,540 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 13:25:04,541 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 13:25:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 13:25:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-01-24 13:25:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 13:25:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-24 13:25:04,547 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 23 [2018-01-24 13:25:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:25:04,548 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-24 13:25:04,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 13:25:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-24 13:25:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:25:04,549 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:25:04,549 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-24 13:25:04,549 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:25:04,549 INFO L82 PathProgramCache]: Analyzing trace with hash 614865, now seen corresponding path program 2 times [2018-01-24 13:25:04,549 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:25:04,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:04,550 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:25:04,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:25:04,551 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:25:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:25:04,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:25:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:25:04,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:25:04,883 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-24 13:25:04,889 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:25:04,889 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:25:04,899 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:25:04,903 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:25:04,904 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:25:04,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:25:04,923 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-24 13:25:04,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:25:04,934 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-24 13:25:04,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:25:04,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:25:04,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:25:05,453 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-24 13:25:05,453 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:25:05,953 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2018-01-24 13:25:09,266 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 349792 conjuctions. This might take some time... [2018-01-24 13:25:53,211 INFO L170 XnfTransformerHelper]: Simplified to disjunction of 576 conjuctions. [2018-01-24 13:25:53,392 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 576 Received shutdown request... [2018-01-24 13:26:12,653 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 13:26:12,654 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:26:12,658 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:26:12,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:26:12 BoogieIcfgContainer [2018-01-24 13:26:12,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:26:12,660 INFO L168 Benchmark]: Toolchain (without parser) took 72770.88 ms. Allocated memory was 300.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 257.9 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. [2018-01-24 13:26:12,661 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 300.9 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:26:12,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.16 ms. Allocated memory is still 300.9 MB. Free memory was 257.9 MB in the beginning and 244.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:26:12,661 INFO L168 Benchmark]: Boogie Preprocessor took 30.13 ms. Allocated memory is still 300.9 MB. Free memory was 244.8 MB in the beginning and 242.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:26:12,661 INFO L168 Benchmark]: RCFGBuilder took 293.41 ms. Allocated memory is still 300.9 MB. Free memory was 242.8 MB in the beginning and 222.7 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:26:12,662 INFO L168 Benchmark]: TraceAbstraction took 72223.34 ms. Allocated memory was 300.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 221.7 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-01-24 13:26:12,663 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.16 ms. Allocated memory is still 300.9 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.16 ms. Allocated memory is still 300.9 MB. Free memory was 257.9 MB in the beginning and 244.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.13 ms. Allocated memory is still 300.9 MB. Free memory was 244.8 MB in the beginning and 242.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 293.41 ms. Allocated memory is still 300.9 MB. Free memory was 242.8 MB in the beginning and 222.7 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 72223.34 ms. Allocated memory was 300.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 221.7 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. * 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: 1471]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1471). 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 1463). 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 1463). 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 1467). 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 1467). 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 6 procedures, 62 locations, 13 error locations. TIMEOUT Result, 72.1s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 343 SDtfs, 150 SDslu, 1135 SDs, 0 SdLazy, 409 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=6, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 37 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 196 ConstructedInterpolants, 28 QuantifiedInterpolants, 56510 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_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-26-12-671.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-26-12-671.csv Completed graceful shutdown