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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:47:50,362 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:47:50,363 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:47:50,378 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:47:50,378 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:47:50,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:47:50,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:47:50,382 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:47:50,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:47:50,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:47:50,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:47:50,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:47:50,386 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:47:50,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:47:50,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:47:50,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:47:50,391 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:47:50,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:47:50,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:47:50,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:47:50,397 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:47:50,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:47:50,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:47:50,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:47:50,399 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:47:50,399 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:47:50,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:47:50,400 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:47:50,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:47:50,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:47:50,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:47:50,401 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:47:50,410 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:47:50,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:47:50,411 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:47:50,411 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:47:50,412 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:47:50,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:47:50,412 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:47:50,412 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:47:50,412 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:47:50,412 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:47:50,412 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:47:50,412 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:47:50,412 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:47:50,412 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:47:50,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:47:50,413 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:47:50,413 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:47:50,413 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:47:50,413 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:47:50,413 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:47:50,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:47:50,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:47:50,413 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:47:50,414 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:47:50,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:47:50,450 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:47:50,452 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:47:50,453 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:47:50,453 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:47:50,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-02-02 10:47:50,581 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:47:50,582 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:47:50,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:50,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:47:50,588 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:47:50,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2b8cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50, skipping insertion in model container [2018-02-02 10:47:50,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,606 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:50,642 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:50,727 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:50,741 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:50,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50 WrapperNode [2018-02-02 10:47:50,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:50,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:47:50,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:47:50,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:47:50,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:47:50,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:47:50,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:47:50,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:47:50,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 10:47:50,814 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:47:50,814 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:47:50,814 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:47:50,814 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-02 10:47:50,814 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-02 10:47:50,814 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-02 10:47:50,814 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-02-02 10:47:50,814 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:47:50,815 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:47:50,815 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:47:50,815 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:47:50,815 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:47:50,815 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:47:50,815 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:47:50,815 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:47:50,815 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:47:50,815 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:47:50,815 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:47:50,815 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-02 10:47:50,815 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-02 10:47:50,815 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-02 10:47:50,816 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-02-02 10:47:50,816 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:47:50,816 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:47:50,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:47:50,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:47:50,986 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:47:50,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:50 BoogieIcfgContainer [2018-02-02 10:47:50,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:47:50,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:47:50,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:47:50,989 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:47:50,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:47:50" (1/3) ... [2018-02-02 10:47:50,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f16064d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:50, skipping insertion in model container [2018-02-02 10:47:50,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (2/3) ... [2018-02-02 10:47:50,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f16064d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:50, skipping insertion in model container [2018-02-02 10:47:50,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:50" (3/3) ... [2018-02-02 10:47:50,993 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-02-02 10:47:50,999 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:47:51,003 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 10:47:51,033 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:47:51,033 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:47:51,033 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:47:51,033 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:47:51,033 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:47:51,033 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:47:51,033 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:47:51,033 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:47:51,034 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:47:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-02-02 10:47:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 10:47:51,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,052 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 10:47:51,053 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:47:51,058 INFO L82 PathProgramCache]: Analyzing trace with hash 3053611, now seen corresponding path program 1 times [2018-02-02 10:47:51,099 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:47:51,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,169 INFO L182 omatonBuilderFactory]: Interpolants [64#(= 1 (select |#valid| |~#a6.base|)), 62#true, 63#false] [2018-02-02 10:47:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:47:51,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:47:51,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:51,180 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-02-02 10:47:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,249 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-02 10:47:51,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:47:51,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 10:47:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,309 INFO L225 Difference]: With dead ends: 68 [2018-02-02 10:47:51,310 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 10:47:51,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-02 10:47:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 10:47:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-02-02 10:47:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 10:47:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-02 10:47:51,336 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 4 [2018-02-02 10:47:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:51,336 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-02 10:47:51,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:47:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-02 10:47:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 10:47:51,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,337 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 10:47:51,337 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:47:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash 3053612, now seen corresponding path program 1 times [2018-02-02 10:47:51,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:47:51,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,382 INFO L182 omatonBuilderFactory]: Interpolants [197#true, 198#false, 199#(and (= |~#a6.offset| 0) (= (select |#length| |~#a6.base|) 4))] [2018-02-02 10:47:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:47:51,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:47:51,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:51,385 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 3 states. [2018-02-02 10:47:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,439 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-02-02 10:47:51,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:47:51,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 10:47:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,441 INFO L225 Difference]: With dead ends: 110 [2018-02-02 10:47:51,441 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 10:47:51,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-02 10:47:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 10:47:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2018-02-02 10:47:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 10:47:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-02-02 10:47:51,453 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 4 [2018-02-02 10:47:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:51,454 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-02-02 10:47:51,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:47:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-02-02 10:47:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:47:51,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,455 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:51,455 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:47:51,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1645066521, now seen corresponding path program 1 times [2018-02-02 10:47:51,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:51,546 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,547 INFO L182 omatonBuilderFactory]: Interpolants [411#true, 412#false, 413#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 414#(and (= 0 |probe1_6_#t~ret4.base|) (= 0 |probe1_6_#t~ret4.offset|)), 415#(and (= probe1_6_~p~0.base 0) (= 0 probe1_6_~p~0.offset))] [2018-02-02 10:47:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:51,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:51,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:51,548 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 5 states. [2018-02-02 10:47:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,572 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-02-02 10:47:51,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:51,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 10:47:51,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,575 INFO L225 Difference]: With dead ends: 78 [2018-02-02 10:47:51,575 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 10:47:51,576 INFO L554 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-02-02 10:47:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 10:47:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-02-02 10:47:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:47:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-02-02 10:47:51,580 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 24 [2018-02-02 10:47:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:51,581 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-02-02 10:47:51,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-02-02 10:47:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:47:51,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,582 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:51,582 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:47:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash 995391925, now seen corresponding path program 1 times [2018-02-02 10:47:51,583 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:47:51,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,667 INFO L182 omatonBuilderFactory]: Interpolants [570#true, 571#false, 572#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 573#(not (= 0 |ldv_malloc_#res.base|)), 574#(not (= 0 |probe1_6_#t~ret4.base|)), 575#(not (= 0 probe1_6_~p~0.base))] [2018-02-02 10:47:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:51,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:51,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:51,667 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 6 states. [2018-02-02 10:47:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,698 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-02-02 10:47:51,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:51,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:47:51,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,699 INFO L225 Difference]: With dead ends: 76 [2018-02-02 10:47:51,699 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:47:51,699 INFO L554 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-02-02 10:47:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:47:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-02 10:47:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:47:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-02 10:47:51,703 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 24 [2018-02-02 10:47:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:51,703 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-02 10:47:51,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-02 10:47:51,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:47:51,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,704 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:51,704 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:47:51,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763835, now seen corresponding path program 1 times [2018-02-02 10:47:51,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,785 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:51,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,786 INFO L182 omatonBuilderFactory]: Interpolants [730#true, 731#false, 732#(= 0 |ldv_malloc_#t~malloc1.offset|), 733#(= 0 |ldv_malloc_#res.offset|), 734#(= 0 |probe1_6_#t~ret4.offset|), 735#(= 0 probe1_6_~p~0.offset)] [2018-02-02 10:47:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:51,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:51,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:51,786 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2018-02-02 10:47:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,805 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 10:47:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:47:51,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 10:47:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,806 INFO L225 Difference]: With dead ends: 75 [2018-02-02 10:47:51,806 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 10:47:51,806 INFO L554 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-02-02 10:47:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 10:47:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-02 10:47:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 10:47:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-02-02 10:47:51,810 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 26 [2018-02-02 10:47:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:51,810 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-02-02 10:47:51,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-02-02 10:47:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:47:51,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,811 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:51,811 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:47:51,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763836, now seen corresponding path program 1 times [2018-02-02 10:47:51,812 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:51,873 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,873 INFO L182 omatonBuilderFactory]: Interpolants [888#true, 889#false, 890#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 891#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 892#(= 1 (select |#valid| |probe1_6_#t~ret4.base|)), 893#(= 1 (select |#valid| probe1_6_~p~0.base))] [2018-02-02 10:47:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:51,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:51,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:51,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:51,874 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 6 states. [2018-02-02 10:47:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,993 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-02-02 10:47:51,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:51,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 10:47:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,995 INFO L225 Difference]: With dead ends: 74 [2018-02-02 10:47:51,995 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 10:47:51,996 INFO L554 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-02-02 10:47:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 10:47:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 10:47:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 10:47:52,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 10:47:52,003 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 26 [2018-02-02 10:47:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:52,003 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 10:47:52,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 10:47:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:47:52,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:52,004 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:52,005 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:47:52,005 INFO L82 PathProgramCache]: Analyzing trace with hash -772946127, now seen corresponding path program 1 times [2018-02-02 10:47:52,006 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:52,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:52,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:52,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:47:52,042 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:52,043 INFO L182 omatonBuilderFactory]: Interpolants [1044#true, 1045#false, 1046#(= |#valid| |old(#valid)|)] [2018-02-02 10:47:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:52,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:47:52,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:47:52,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:52,044 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 3 states. [2018-02-02 10:47:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:52,085 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-02 10:47:52,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:47:52,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-02-02 10:47:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:52,087 INFO L225 Difference]: With dead ends: 77 [2018-02-02 10:47:52,087 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 10:47:52,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-02-02 10:47:52,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 10:47:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 10:47:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:47:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-02-02 10:47:52,091 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 25 [2018-02-02 10:47:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:52,092 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-02-02 10:47:52,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:47:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-02-02 10:47:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:47:52,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:52,093 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:52,093 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:47:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1279706416, now seen corresponding path program 1 times [2018-02-02 10:47:52,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:52,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:52,116 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:47:52,119 INFO L168 Benchmark]: Toolchain (without parser) took 1537.48 ms. Allocated memory was 405.8 MB in the beginning and 617.6 MB in the end (delta: 211.8 MB). Free memory was 359.8 MB in the beginning and 492.0 MB in the end (delta: -132.2 MB). Peak memory consumption was 79.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:52,120 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 405.8 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:47:52,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.43 ms. Allocated memory is still 405.8 MB. Free memory was 359.8 MB in the beginning and 346.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:52,120 INFO L168 Benchmark]: Boogie Preprocessor took 29.26 ms. Allocated memory is still 405.8 MB. Free memory was 346.6 MB in the beginning and 345.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:52,121 INFO L168 Benchmark]: RCFGBuilder took 209.26 ms. Allocated memory is still 405.8 MB. Free memory was 345.3 MB in the beginning and 324.1 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:52,121 INFO L168 Benchmark]: TraceAbstraction took 1130.98 ms. Allocated memory was 405.8 MB in the beginning and 617.6 MB in the end (delta: 211.8 MB). Free memory was 324.1 MB in the beginning and 492.0 MB in the end (delta: -167.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:52,122 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.13 ms. Allocated memory is still 405.8 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 165.43 ms. Allocated memory is still 405.8 MB. Free memory was 359.8 MB in the beginning and 346.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.26 ms. Allocated memory is still 405.8 MB. Free memory was 346.6 MB in the beginning and 345.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 209.26 ms. Allocated memory is still 405.8 MB. Free memory was 345.3 MB in the beginning and 324.1 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1130.98 ms. Allocated memory was 405.8 MB in the beginning and 617.6 MB in the end (delta: 211.8 MB). Free memory was 324.1 MB in the beginning and 492.0 MB in the end (delta: -167.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-47-52-129.csv Received shutdown request...