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_test18_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:47:23,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:47:23,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:47:23,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:47:23,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:47:23,743 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:47:23,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:47:23,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:47:23,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:47:23,748 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:47:23,749 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:47:23,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:47:23,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:47:23,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:47:23,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:47:23,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:47:23,758 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:47:23,760 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:47:23,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:47:23,762 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:47:23,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:47:23,765 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:47:23,765 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:47:23,766 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:47:23,767 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:47:23,768 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:47:23,768 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:47:23,769 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:47:23,769 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:47:23,769 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:47:23,770 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:47:23,770 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:23,782 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:47:23,782 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:47:23,783 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:47:23,783 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:47:23,783 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:47:23,783 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:47:23,784 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:47:23,784 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:47:23,784 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:47:23,784 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:47:23,784 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:47:23,785 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:47:23,785 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:47:23,785 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:47:23,785 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:47:23,785 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:47:23,785 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:47:23,786 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:47:23,786 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:47:23,786 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:47:23,786 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:47:23,786 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:47:23,786 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:47:23,787 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:47:23,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:47:23,833 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:47:23,836 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:47:23,837 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:47:23,838 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:47:23,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-02-02 10:47:23,976 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:47:23,977 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:47:23,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:23,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:47:23,984 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:47:23,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:23" (1/1) ... [2018-02-02 10:47:23,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dca496d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:23, skipping insertion in model container [2018-02-02 10:47:23,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:23" (1/1) ... [2018-02-02 10:47:24,002 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:24,037 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:24,130 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:24,141 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:24,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:24 WrapperNode [2018-02-02 10:47:24,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:24,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:47:24,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:47:24,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:47:24,155 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:24" (1/1) ... [2018-02-02 10:47:24,155 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:24" (1/1) ... [2018-02-02 10:47:24,163 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:24" (1/1) ... [2018-02-02 10:47:24,163 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:24" (1/1) ... [2018-02-02 10:47:24,165 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:24" (1/1) ... [2018-02-02 10:47:24,167 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:24" (1/1) ... [2018-02-02 10:47:24,168 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:24" (1/1) ... [2018-02-02 10:47:24,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:47:24,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:47:24,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:47:24,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:47:24,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:24" (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:24,206 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:47:24,207 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:47:24,207 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:47:24,207 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:47:24,207 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:47:24,207 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:47:24,207 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:47:24,207 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:47:24,207 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:47:24,207 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:47:24,207 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:47:24,207 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:47:24,207 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:47:24,208 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:47:24,208 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:47:24,208 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:47:24,208 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:47:24,208 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:47:24,353 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:47:24,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:24 BoogieIcfgContainer [2018-02-02 10:47:24,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:47:24,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:47:24,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:47:24,356 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:47:24,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:47:23" (1/3) ... [2018-02-02 10:47:24,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683db31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:24, skipping insertion in model container [2018-02-02 10:47:24,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:24" (2/3) ... [2018-02-02 10:47:24,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683db31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:24, skipping insertion in model container [2018-02-02 10:47:24,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:24" (3/3) ... [2018-02-02 10:47:24,358 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-02-02 10:47:24,363 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:47:24,368 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 10:47:24,401 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:47:24,401 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:47:24,402 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:47:24,402 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:47:24,402 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:47:24,402 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:47:24,402 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:47:24,402 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:47:24,403 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:47:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 10:47:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:47:24,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:24,426 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:24,426 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:24,430 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times [2018-02-02 10:47:24,483 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:24,525 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:24,596 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:24,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:24,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:47:24,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:24,600 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:24,600 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= |#valid| |old(#valid)|)] [2018-02-02 10:47:24,600 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:24,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:47:24,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:47:24,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:24,614 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 10:47:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:24,743 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-02 10:47:24,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:47:24,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:47:24,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:24,751 INFO L225 Difference]: With dead ends: 74 [2018-02-02 10:47:24,751 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 10:47:24,752 INFO L554 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-02-02 10:47:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 10:47:24,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-02-02 10:47:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 10:47:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-02 10:47:24,781 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17 [2018-02-02 10:47:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:24,781 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-02 10:47:24,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:47:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-02 10:47:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:47:24,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:24,782 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:24,782 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:24,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times [2018-02-02 10:47:24,784 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:24,796 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:24,854 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:24,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:24,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:47:24,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:24,855 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:24,855 INFO L182 omatonBuilderFactory]: Interpolants [180#true, 181#false, 182#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 183#(not (= 0 |ldv_malloc_#res.base|)), 184#(not (= 0 |entry_point_#t~ret2.base|)), 185#(not (= 0 entry_point_~array~0.base))] [2018-02-02 10:47:24,855 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:24,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:24,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:24,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:24,857 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-02-02 10:47:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:24,948 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-02-02 10:47:24,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:24,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:47:24,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:24,950 INFO L225 Difference]: With dead ends: 78 [2018-02-02 10:47:24,950 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 10:47:24,951 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:24,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 10:47:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-02-02 10:47:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 10:47:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-02 10:47:24,957 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2018-02-02 10:47:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:24,958 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-02 10:47:24,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-02 10:47:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:47:24,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:24,959 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:24,959 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:24,959 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times [2018-02-02 10:47:24,962 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:24,981 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:25,023 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:25,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:25,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:47:25,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:25,024 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:25,024 INFO L182 omatonBuilderFactory]: Interpolants [320#true, 321#false, 322#(<= 10 entry_point_~len~0), 323#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0))] [2018-02-02 10:47:25,025 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:25,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:47:25,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:47:25,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:47:25,025 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2018-02-02 10:47:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:25,055 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-02-02 10:47:25,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:47:25,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-02 10:47:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:25,056 INFO L225 Difference]: With dead ends: 86 [2018-02-02 10:47:25,057 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 10:47:25,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:47:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 10:47:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-02-02 10:47:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 10:47:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-02-02 10:47:25,063 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2018-02-02 10:47:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:25,063 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-02-02 10:47:25,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:47:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-02-02 10:47:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:47:25,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:25,065 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:25,065 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:25,065 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times [2018-02-02 10:47:25,066 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:25,077 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:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:47:25,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:25,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:47:25,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:47:25,149 INFO L182 omatonBuilderFactory]: Interpolants [466#true, 467#false, 468#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 469#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 |entry_point_#t~ret2.base|)), 470#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 10:47:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:47:25,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:25,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:25,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:25,150 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states. [2018-02-02 10:47:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:25,173 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-02 10:47:25,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:25,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 10:47:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:25,174 INFO L225 Difference]: With dead ends: 49 [2018-02-02 10:47:25,174 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 10:47:25,175 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:25,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 10:47:25,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 10:47:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 10:47:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-02 10:47:25,179 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2018-02-02 10:47:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:25,179 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-02 10:47:25,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-02 10:47:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:47:25,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:25,180 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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:25,180 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:25,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times [2018-02-02 10:47:25,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:25,194 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:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:47:25,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:25,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:25,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:47:25,231 INFO L182 omatonBuilderFactory]: Interpolants [567#true, 568#false, 569#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 570#(and (= 0 |entry_point_#t~ret4.base|) (= 0 |entry_point_#t~ret4.offset|)), 571#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset))] [2018-02-02 10:47:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:47:25,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:25,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:25,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:25,232 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-02-02 10:47:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:25,244 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-02-02 10:47:25,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:25,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 10:47:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:25,245 INFO L225 Difference]: With dead ends: 51 [2018-02-02 10:47:25,245 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 10:47:25,246 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:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 10:47:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-02-02 10:47:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:47:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-02 10:47:25,249 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-02-02 10:47:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:25,250 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-02 10:47:25,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-02 10:47:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:47:25,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:25,251 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:25,251 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:25,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times [2018-02-02 10:47:25,252 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:25,267 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:25,275 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:25,281 INFO L168 Benchmark]: Toolchain (without parser) took 1304.62 ms. Allocated memory was 398.5 MB in the beginning and 601.4 MB in the end (delta: 202.9 MB). Free memory was 352.5 MB in the beginning and 500.4 MB in the end (delta: -147.9 MB). Peak memory consumption was 55.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:25,282 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 398.5 MB. Free memory is still 357.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:47:25,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.33 ms. Allocated memory is still 398.5 MB. Free memory was 352.5 MB in the beginning and 339.3 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:25,283 INFO L168 Benchmark]: Boogie Preprocessor took 23.38 ms. Allocated memory is still 398.5 MB. Free memory was 339.3 MB in the beginning and 336.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:25,283 INFO L168 Benchmark]: RCFGBuilder took 184.19 ms. Allocated memory is still 398.5 MB. Free memory was 336.6 MB in the beginning and 319.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:25,283 INFO L168 Benchmark]: TraceAbstraction took 926.78 ms. Allocated memory was 398.5 MB in the beginning and 601.4 MB in the end (delta: 202.9 MB). Free memory was 316.8 MB in the beginning and 500.4 MB in the end (delta: -183.6 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:25,284 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.12 ms. Allocated memory is still 398.5 MB. Free memory is still 357.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.33 ms. Allocated memory is still 398.5 MB. Free memory was 352.5 MB in the beginning and 339.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.38 ms. Allocated memory is still 398.5 MB. Free memory was 339.3 MB in the beginning and 336.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 184.19 ms. Allocated memory is still 398.5 MB. Free memory was 336.6 MB in the beginning and 319.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 926.78 ms. Allocated memory was 398.5 MB in the beginning and 601.4 MB in the end (delta: 202.9 MB). Free memory was 316.8 MB in the beginning and 500.4 MB in the end (delta: -183.6 MB). Peak memory consumption was 19.3 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_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-47-25-289.csv Received shutdown request...