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_test5_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:48:42,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:48:42,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:48:42,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:48:42,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:48:42,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:48:42,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:48:42,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:48:42,140 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:48:42,140 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:48:42,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:48:42,141 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:48:42,142 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:48:42,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:48:42,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:48:42,146 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:48:42,147 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:48:42,149 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:48:42,150 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:48:42,151 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:48:42,152 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:48:42,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:48:42,153 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:48:42,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:48:42,154 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:48:42,155 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:48:42,155 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:48:42,156 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:48:42,156 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:48:42,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:48:42,157 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:48:42,157 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:48:42,167 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:48:42,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:48:42,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:48:42,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:48:42,168 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:48:42,168 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:48:42,169 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:48:42,169 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:48:42,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:48:42,169 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:48:42,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:48:42,169 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:48:42,169 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:48:42,170 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:48:42,170 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:48:42,170 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:48:42,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:48:42,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:48:42,170 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:48:42,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:48:42,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:42,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:48:42,171 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:48:42,171 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:48:42,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:48:42,207 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:48:42,210 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:48:42,211 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:48:42,212 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:48:42,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test5_true-valid-memsafety_true-termination.i [2018-02-02 10:48:42,371 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:48:42,372 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:48:42,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:42,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:48:42,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:48:42,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:42" (1/1) ... [2018-02-02 10:48:42,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d1e458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:42, skipping insertion in model container [2018-02-02 10:48:42,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:42" (1/1) ... [2018-02-02 10:48:42,389 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:42,425 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:42,515 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:42,524 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:42,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:42 WrapperNode [2018-02-02 10:48:42,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:42,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:48:42,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:48:42,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:48:42,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:42" (1/1) ... [2018-02-02 10:48:42,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:42" (1/1) ... [2018-02-02 10:48:42,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:42" (1/1) ... [2018-02-02 10:48:42,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:42" (1/1) ... [2018-02-02 10:48:42,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:42" (1/1) ... [2018-02-02 10:48:42,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:42" (1/1) ... [2018-02-02 10:48:42,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:42" (1/1) ... [2018-02-02 10:48:42,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:48:42,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:48:42,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:48:42,553 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:48:42,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:42" (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:48:42,590 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:48:42,590 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:48:42,590 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:48:42,590 INFO L136 BoogieDeclarations]: Found implementation of procedure h5 [2018-02-02 10:48:42,590 INFO L136 BoogieDeclarations]: Found implementation of procedure g5 [2018-02-02 10:48:42,590 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:48:42,590 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:48:42,591 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:48:42,591 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:48:42,591 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:48:42,591 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:48:42,591 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:48:42,591 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:48:42,591 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:48:42,591 INFO L128 BoogieDeclarations]: Found specification of procedure h5 [2018-02-02 10:48:42,591 INFO L128 BoogieDeclarations]: Found specification of procedure g5 [2018-02-02 10:48:42,592 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:48:42,592 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:48:42,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:48:42,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:48:42,697 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:48:42,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:42 BoogieIcfgContainer [2018-02-02 10:48:42,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:48:42,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:48:42,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:48:42,700 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:48:42,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:48:42" (1/3) ... [2018-02-02 10:48:42,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5c803e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:42, skipping insertion in model container [2018-02-02 10:48:42,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:42" (2/3) ... [2018-02-02 10:48:42,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5c803e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:42, skipping insertion in model container [2018-02-02 10:48:42,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:42" (3/3) ... [2018-02-02 10:48:42,702 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test5_true-valid-memsafety_true-termination.i [2018-02-02 10:48:42,707 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:48:42,711 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-02 10:48:42,743 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:48:42,743 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:48:42,743 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:48:42,743 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:48:42,744 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:48:42,744 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:48:42,744 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:48:42,744 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:48:42,745 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:48:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-02-02 10:48:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:48:42,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:42,766 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:42,767 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-02 10:48:42,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1224818119, now seen corresponding path program 1 times [2018-02-02 10:48:42,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:42,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:42,991 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:48:42,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:42,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:48:42,994 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:42,995 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:48:42,995 INFO L182 omatonBuilderFactory]: Interpolants [36#true, 37#false, 38#(= 0 |ldv_malloc_#res.offset|), 39#(= 0 |h5_#t~ret2.offset|), 40#(= 0 |h5_#res.offset|), 41#(= 0 |entry_point_#t~ret3.offset|), 42#(= 0 entry_point_~p~1.offset), 43#(= 0 |g5_#in~p.offset|), 44#(= 0 g5_~p.offset)] [2018-02-02 10:48:42,995 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:48:42,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:48:43,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:48:43,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:43,010 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 9 states. [2018-02-02 10:48:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:43,140 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-02 10:48:43,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:43,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-02 10:48:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:43,153 INFO L225 Difference]: With dead ends: 48 [2018-02-02 10:48:43,153 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 10:48:43,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 10:48:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-02-02 10:48:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:48:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-02 10:48:43,177 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 20 [2018-02-02 10:48:43,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:43,177 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-02 10:48:43,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:48:43,177 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-02 10:48:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:48:43,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:43,178 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:43,178 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-02 10:48:43,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1224818118, now seen corresponding path program 1 times [2018-02-02 10:48:43,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:43,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:43,253 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:48:43,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:43,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:48:43,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:43,254 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:48:43,254 INFO L182 omatonBuilderFactory]: Interpolants [144#(= 0 |g5_#in~p.base|), 145#(= g5_~p.base 0), 137#true, 138#false, 139#(= 0 |ldv_malloc_#res.base|), 140#(= 0 |h5_#t~ret2.base|), 141#(= 0 |h5_#res.base|), 142#(= 0 |entry_point_#t~ret3.base|), 143#(= 0 entry_point_~p~1.base)] [2018-02-02 10:48:43,255 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:48:43,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:48:43,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:48:43,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:43,257 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 9 states. [2018-02-02 10:48:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:43,306 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-02-02 10:48:43,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:43,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-02 10:48:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:43,308 INFO L225 Difference]: With dead ends: 46 [2018-02-02 10:48:43,308 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 10:48:43,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 10:48:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-02-02 10:48:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:48:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-02-02 10:48:43,314 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 20 [2018-02-02 10:48:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:43,314 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-02-02 10:48:43,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:48:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-02-02 10:48:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:48:43,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:43,315 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] [2018-02-02 10:48:43,315 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-02 10:48:43,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1045905065, now seen corresponding path program 1 times [2018-02-02 10:48:43,316 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:43,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:43,406 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:48:43,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:43,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:48:43,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:43,407 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:48:43,407 INFO L182 omatonBuilderFactory]: Interpolants [240#(= 0 |h5_#t~ret2.offset|), 241#(= 0 |h5_#res.offset|), 242#(= 0 |entry_point_#t~ret3.offset|), 243#(= 0 entry_point_~p~1.offset), 244#(= 0 |g5_#in~p.offset|), 245#(= 0 g5_~p.offset), 236#true, 237#false, 238#(= 0 |ldv_malloc_#t~malloc1.offset|), 239#(= 0 |ldv_malloc_#res.offset|)] [2018-02-02 10:48:43,407 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:48:43,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:43,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:43,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:43,408 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 10 states. [2018-02-02 10:48:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:43,464 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-02-02 10:48:43,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:48:43,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 10:48:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:43,466 INFO L225 Difference]: With dead ends: 41 [2018-02-02 10:48:43,466 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 10:48:43,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:48:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 10:48:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 10:48:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 10:48:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-02-02 10:48:43,472 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 22 [2018-02-02 10:48:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:43,472 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-02-02 10:48:43,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-02-02 10:48:43,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:48:43,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:43,473 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] [2018-02-02 10:48:43,473 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-02 10:48:43,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1045905064, now seen corresponding path program 1 times [2018-02-02 10:48:43,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:43,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:43,552 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:48:43,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:43,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:48:43,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:43,553 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:48:43,553 INFO L182 omatonBuilderFactory]: Interpolants [336#(= 1 (select |#valid| |h5_#t~ret2.base|)), 337#(= 1 (select |#valid| |h5_#res.base|)), 338#(= 1 (select |#valid| |entry_point_#t~ret3.base|)), 339#(= 1 (select |#valid| entry_point_~p~1.base)), 340#(= 1 (select |#valid| |g5_#in~p.base|)), 341#(= 1 (select |#valid| g5_~p.base)), 332#true, 333#false, 334#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 335#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-02 10:48:43,553 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:48:43,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:43,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:43,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:43,554 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2018-02-02 10:48:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:43,650 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-02-02 10:48:43,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:43,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 10:48:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:43,651 INFO L225 Difference]: With dead ends: 44 [2018-02-02 10:48:43,651 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 10:48:43,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:48:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 10:48:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2018-02-02 10:48:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 10:48:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-02-02 10:48:43,653 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2018-02-02 10:48:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:43,653 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-02-02 10:48:43,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-02-02 10:48:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:48:43,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:43,654 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:48:43,654 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-02 10:48:43,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1043029204, now seen corresponding path program 1 times [2018-02-02 10:48:43,655 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:43,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:43,689 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:48:43,689 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:43,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:48:43,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:43,690 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:48:43,690 INFO L182 omatonBuilderFactory]: Interpolants [418#true, 419#false, 420#(= |#valid| |old(#valid)|)] [2018-02-02 10:48:43,690 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:48:43,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:48:43,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:48:43,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:43,691 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 3 states. [2018-02-02 10:48:43,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:43,718 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-02-02 10:48:43,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:48:43,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-02-02 10:48:43,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:43,719 INFO L225 Difference]: With dead ends: 40 [2018-02-02 10:48:43,719 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 10:48:43,719 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:48:43,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 10:48:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-02 10:48:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 10:48:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-02 10:48:43,727 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2018-02-02 10:48:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:43,728 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-02 10:48:43,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:48:43,728 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-02 10:48:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:48:43,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:43,729 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:48:43,729 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-02 10:48:43,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1685081515, now seen corresponding path program 1 times [2018-02-02 10:48:43,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:43,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:43,853 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:48:43,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:43,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:48:43,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:43,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:48:43,854 INFO L182 omatonBuilderFactory]: Interpolants [498#true, 499#false, 500#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 501#(and (= 0 |h5_#t~ret2.offset|) (= 0 |h5_#t~ret2.base|)), 502#(and (= 0 |h5_#res.offset|) (= 0 |h5_#res.base|)), 503#(and (= 0 |entry_point_#t~ret3.offset|) (= 0 |entry_point_#t~ret3.base|)), 504#(and (= 0 entry_point_~p~1.base) (= 0 entry_point_~p~1.offset)), 505#(and (= g5_~p.offset |g5_#in~p.offset|) (= g5_~p.base |g5_#in~p.base|)), 506#(and (or (not (= g5_~p.base 0)) (and (not (= 0 g5_~p.offset)) (= g5_~p.offset |g5_#in~p.offset|))) (or (= g5_~p.base 0) (= |g5_#in~p.base| g5_~p.base))), 507#(or (not (= 0 |g5_#in~p.offset|)) (not (= |g5_#in~p.base| 0)))] [2018-02-02 10:48:43,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:48:43,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:43,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:43,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:43,855 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-02-02 10:48:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:43,916 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-02-02 10:48:43,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:48:43,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-02-02 10:48:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:43,917 INFO L225 Difference]: With dead ends: 37 [2018-02-02 10:48:43,917 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 10:48:43,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 10:48:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-02-02 10:48:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 10:48:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-02-02 10:48:43,919 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-02-02 10:48:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:43,919 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-02-02 10:48:43,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-02-02 10:48:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:48:43,920 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:43,920 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:48:43,920 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-02 10:48:43,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1527636810, now seen corresponding path program 1 times [2018-02-02 10:48:43,921 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:43,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:43,983 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:48:43,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:43,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:48:43,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:43,984 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:48:43,984 INFO L182 omatonBuilderFactory]: Interpolants [576#false, 577#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 578#(not (= 0 |ldv_malloc_#res.base|)), 579#(not (= 0 |h5_#t~ret2.base|)), 580#(not (= 0 |h5_#res.base|)), 581#(not (= 0 |entry_point_#t~ret3.base|)), 582#(not (= 0 entry_point_~p~1.base)), 583#(= |g5_#in~p.base| g5_~p.base), 584#(= 0 |g5_#in~p.base|), 575#true] [2018-02-02 10:48:43,984 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:48:43,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:43,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:43,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:43,985 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 10 states. [2018-02-02 10:48:44,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:44,050 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2018-02-02 10:48:44,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:44,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-02-02 10:48:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:44,051 INFO L225 Difference]: With dead ends: 30 [2018-02-02 10:48:44,051 INFO L226 Difference]: Without dead ends: 28 [2018-02-02 10:48:44,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:48:44,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-02 10:48:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-02 10:48:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 10:48:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2018-02-02 10:48:44,054 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 26 [2018-02-02 10:48:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:44,054 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2018-02-02 10:48:44,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2018-02-02 10:48:44,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:48:44,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:44,055 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] [2018-02-02 10:48:44,055 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-02 10:48:44,056 INFO L82 PathProgramCache]: Analyzing trace with hash -228650675, now seen corresponding path program 1 times [2018-02-02 10:48:44,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:44,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:44,077 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:48:44,080 INFO L168 Benchmark]: Toolchain (without parser) took 1708.42 ms. Allocated memory was 402.1 MB in the beginning and 631.2 MB in the end (delta: 229.1 MB). Free memory was 358.8 MB in the beginning and 596.5 MB in the end (delta: -237.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:44,081 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.1 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:44,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.74 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 345.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:48:44,081 INFO L168 Benchmark]: Boogie Preprocessor took 23.25 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 344.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:48:44,081 INFO L168 Benchmark]: RCFGBuilder took 144.65 ms. Allocated memory is still 402.1 MB. Free memory was 344.3 MB in the beginning and 329.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:44,081 INFO L168 Benchmark]: TraceAbstraction took 1381.22 ms. Allocated memory was 402.1 MB in the beginning and 631.2 MB in the end (delta: 229.1 MB). Free memory was 328.4 MB in the beginning and 596.5 MB in the end (delta: -268.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:44,082 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 402.1 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.74 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 345.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 23.25 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 344.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 144.65 ms. Allocated memory is still 402.1 MB. Free memory was 344.3 MB in the beginning and 329.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1381.22 ms. Allocated memory was 402.1 MB in the beginning and 631.2 MB in the end (delta: 229.1 MB). Free memory was 328.4 MB in the beginning and 596.5 MB in the end (delta: -268.1 MB). There was no memory consumed. 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_test5_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-48-44-087.csv Received shutdown request...