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_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:48:12,761 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:48:12,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:48:12,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:48:12,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:48:12,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:48:12,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:48:12,778 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:48:12,780 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:48:12,781 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:48:12,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:48:12,782 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:48:12,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:48:12,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:48:12,784 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:48:12,786 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:48:12,788 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:48:12,789 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:48:12,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:48:12,791 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:48:12,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:48:12,793 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:48:12,794 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:48:12,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:48:12,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:48:12,796 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:48:12,797 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:48:12,797 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:48:12,797 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:48:12,797 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:48:12,798 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:48:12,798 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:12,808 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:48:12,808 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:48:12,809 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:48:12,809 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:48:12,809 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:48:12,810 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:48:12,810 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:48:12,810 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:48:12,810 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:48:12,810 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:48:12,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:48:12,810 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:48:12,810 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:48:12,810 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:48:12,811 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:48:12,811 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:48:12,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:48:12,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:48:12,811 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:48:12,811 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:48:12,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:12,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:48:12,812 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:48:12,812 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:48:12,839 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:48:12,847 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:48:12,849 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:48:12,850 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:48:12,851 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:48:12,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-02 10:48:12,991 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:48:12,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:48:12,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:12,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:48:12,997 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:48:12,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:12" (1/1) ... [2018-02-02 10:48:12,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f5e5214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:12, skipping insertion in model container [2018-02-02 10:48:13,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:12" (1/1) ... [2018-02-02 10:48:13,009 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:13,041 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:13,128 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:13,142 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:13,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:13 WrapperNode [2018-02-02 10:48:13,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:13,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:48:13,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:48:13,147 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:48:13,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:48:13" (1/1) ... [2018-02-02 10:48:13,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:48:13" (1/1) ... [2018-02-02 10:48:13,161 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:13" (1/1) ... [2018-02-02 10:48:13,162 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:13" (1/1) ... [2018-02-02 10:48:13,164 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:13" (1/1) ... [2018-02-02 10:48:13,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:48:13" (1/1) ... [2018-02-02 10:48:13,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:48:13" (1/1) ... [2018-02-02 10:48:13,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:48:13,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:48:13,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:48:13,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:48:13,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:13" (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:13,206 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:48:13,207 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:48:13,207 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:48:13,207 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:48:13,207 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:48:13,207 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:48:13,207 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:48:13,207 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:48:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:48:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:48:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:48:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:48:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:48:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:48:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:48:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:48:13,209 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:48:13,209 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:48:13,376 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:48:13,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:13 BoogieIcfgContainer [2018-02-02 10:48:13,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:48:13,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:48:13,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:48:13,379 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:48:13,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:48:12" (1/3) ... [2018-02-02 10:48:13,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d4212e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:13, skipping insertion in model container [2018-02-02 10:48:13,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:13" (2/3) ... [2018-02-02 10:48:13,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d4212e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:13, skipping insertion in model container [2018-02-02 10:48:13,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:13" (3/3) ... [2018-02-02 10:48:13,382 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-02 10:48:13,390 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:48:13,398 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 10:48:13,436 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:48:13,436 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:48:13,436 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:48:13,436 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:48:13,436 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:48:13,436 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:48:13,436 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:48:13,436 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:48:13,437 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:48:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 10:48:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:48:13,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:13,453 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:48:13,453 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:48:13,456 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-02-02 10:48:13,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:13,537 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:13,597 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:13,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:13,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:48:13,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:13,601 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:13,602 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= |#valid| |old(#valid)|)] [2018-02-02 10:48:13,602 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:13,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:48:13,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:48:13,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:13,613 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 10:48:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:13,748 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-02 10:48:13,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:48:13,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:48:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:13,754 INFO L225 Difference]: With dead ends: 74 [2018-02-02 10:48:13,755 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 10:48:13,756 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:48:13,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 10:48:13,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-02-02 10:48:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 10:48:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-02-02 10:48:13,778 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-02-02 10:48:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:13,779 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-02-02 10:48:13,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:48:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-02-02 10:48:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:48:13,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:13,780 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:48:13,780 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:48:13,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-02-02 10:48:13,781 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:13,792 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:13,830 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:13,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:13,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:13,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:13,831 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:13,831 INFO L182 omatonBuilderFactory]: Interpolants [176#(not (= 0 |ldv_malloc_#res.base|)), 177#(not (= 0 |entry_point_#t~ret2.base|)), 178#(not (= 0 entry_point_~array~0.base)), 173#true, 174#false, 175#(not (= 0 |ldv_malloc_#t~malloc1.base|))] [2018-02-02 10:48:13,831 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:13,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:13,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:13,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:13,833 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-02-02 10:48:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:13,905 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-02-02 10:48:13,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:13,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:48:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:13,907 INFO L225 Difference]: With dead ends: 71 [2018-02-02 10:48:13,907 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 10:48:13,908 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:48:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 10:48:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-02-02 10:48:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 10:48:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-02 10:48:13,913 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-02-02 10:48:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:13,914 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-02 10:48:13,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-02 10:48:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:48:13,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:13,915 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:13,915 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:48:13,916 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-02-02 10:48:13,917 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:13,931 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:13,962 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:13,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:13,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:48:13,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:13,963 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:13,963 INFO L182 omatonBuilderFactory]: Interpolants [295#true, 296#false, 297#(= 0 |ldv_malloc_#res.offset|), 298#(= 0 |entry_point_#t~ret2.offset|), 299#(= 0 entry_point_~array~0.offset)] [2018-02-02 10:48:13,963 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:13,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:13,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:13,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:13,964 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-02-02 10:48:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:14,022 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-02-02 10:48:14,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:14,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 10:48:14,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:14,024 INFO L225 Difference]: With dead ends: 69 [2018-02-02 10:48:14,024 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 10:48:14,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:48:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 10:48:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-02-02 10:48:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 10:48:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-02-02 10:48:14,031 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-02-02 10:48:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:14,031 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-02-02 10:48:14,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-02-02 10:48:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:48:14,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:14,032 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:14,032 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:48:14,032 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-02-02 10:48:14,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:14,044 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:14,083 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:14,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:14,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:48:14,084 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:14,084 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:14,084 INFO L182 omatonBuilderFactory]: Interpolants [432#false, 433#(= 0 |ldv_malloc_#res.base|), 434#(= 0 |entry_point_#t~ret2.base|), 435#(= entry_point_~array~0.base 0), 431#true] [2018-02-02 10:48:14,084 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:14,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:14,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:14,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:14,085 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-02-02 10:48:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:14,137 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-02-02 10:48:14,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:14,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 10:48:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:14,139 INFO L225 Difference]: With dead ends: 70 [2018-02-02 10:48:14,139 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 10:48:14,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:48:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 10:48:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-02-02 10:48:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 10:48:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-02-02 10:48:14,150 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-02-02 10:48:14,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:14,150 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-02-02 10:48:14,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-02-02 10:48:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:48:14,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:14,151 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:14,151 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:48:14,152 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-02-02 10:48:14,153 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:14,165 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:14,201 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:14,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:14,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:14,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:14,202 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:14,202 INFO L182 omatonBuilderFactory]: Interpolants [568#true, 569#false, 570#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 571#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 |entry_point_#t~ret2.base|)), 572#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 10:48:14,202 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:14,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:14,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:14,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:14,203 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-02-02 10:48:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:14,219 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-02 10:48:14,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:14,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 10:48:14,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:14,220 INFO L225 Difference]: With dead ends: 47 [2018-02-02 10:48:14,220 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 10:48:14,220 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:48:14,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 10:48:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 10:48:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 10:48:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-02 10:48:14,224 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-02-02 10:48:14,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:14,224 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-02 10:48:14,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-02 10:48:14,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:48:14,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:14,225 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:14,225 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:48:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-02-02 10:48:14,226 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:14,239 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:14,267 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:14,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:14,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:14,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:14,268 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:14,268 INFO L182 omatonBuilderFactory]: Interpolants [665#true, 666#false, 667#(= 0 |ldv_malloc_#t~malloc1.offset|), 668#(= 0 |ldv_malloc_#res.offset|), 669#(= 0 |entry_point_#t~ret2.offset|), 670#(= 0 entry_point_~array~0.offset)] [2018-02-02 10:48:14,269 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:14,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:14,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:14,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:14,269 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-02-02 10:48:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:14,291 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-02 10:48:14,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:14,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 10:48:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:14,292 INFO L225 Difference]: With dead ends: 44 [2018-02-02 10:48:14,292 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 10:48:14,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 10:48:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 10:48:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 10:48:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-02 10:48:14,295 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-02-02 10:48:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:14,295 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-02 10:48:14,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-02 10:48:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:48:14,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:14,296 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:14,296 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:14,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-02-02 10:48:14,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:14,307 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:14,340 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:14,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:14,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:14,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:14,340 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:14,341 INFO L182 omatonBuilderFactory]: Interpolants [761#true, 762#false, 763#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 764#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 765#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 766#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 10:48:14,341 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:14,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:14,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:14,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:14,341 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-02 10:48:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:14,396 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-02 10:48:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:14,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 10:48:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:14,397 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:48:14,397 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:48:14,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:14,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:48:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-02-02 10:48:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:48:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-02 10:48:14,401 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-02-02 10:48:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:14,401 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-02 10:48:14,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-02 10:48:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:48:14,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:14,402 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:14,402 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:14,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-02-02 10:48:14,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:14,412 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:14,443 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:14,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:14,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:48:14,444 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:14,444 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:14,444 INFO L182 omatonBuilderFactory]: Interpolants [868#true, 869#false, 870#(<= 10 entry_point_~len~0), 871#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0))] [2018-02-02 10:48:14,444 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:14,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:48:14,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:48:14,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:48:14,445 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-02-02 10:48:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:14,467 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-02-02 10:48:14,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:48:14,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 10:48:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:14,468 INFO L225 Difference]: With dead ends: 73 [2018-02-02 10:48:14,469 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 10:48:14,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:48:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 10:48:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-02-02 10:48:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 10:48:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-02 10:48:14,473 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-02-02 10:48:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:14,473 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-02 10:48:14,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:48:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-02 10:48:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:48:14,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:14,474 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:48:14,474 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-02-02 10:48:14,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:14,482 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:14,524 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:48:14,524 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:14,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:14,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:14,524 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:48:14,525 INFO L182 omatonBuilderFactory]: Interpolants [996#true, 997#false, 998#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 999#(and (= 0 |entry_point_#t~ret4.base|) (= 0 |entry_point_#t~ret4.offset|)), 1000#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset))] [2018-02-02 10:48:14,525 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:48:14,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:14,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:14,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:14,526 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-02-02 10:48:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:14,536 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-02 10:48:14,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:14,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 10:48:14,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:14,537 INFO L225 Difference]: With dead ends: 67 [2018-02-02 10:48:14,537 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 10:48:14,538 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:48:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 10:48:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-02-02 10:48:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 10:48:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-02 10:48:14,541 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-02-02 10:48:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:14,541 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-02 10:48:14,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-02 10:48:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:48:14,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:14,542 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:48:14,542 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-02-02 10:48:14,543 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:14,555 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:14,561 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:14,564 INFO L168 Benchmark]: Toolchain (without parser) took 1572.84 ms. Allocated memory was 400.0 MB in the beginning and 601.9 MB in the end (delta: 201.9 MB). Free memory was 354.1 MB in the beginning and 442.2 MB in the end (delta: -88.1 MB). Peak memory consumption was 113.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:14,565 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 400.0 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:14,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.19 ms. Allocated memory is still 400.0 MB. Free memory was 354.1 MB in the beginning and 340.9 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:14,566 INFO L168 Benchmark]: Boogie Preprocessor took 22.42 ms. Allocated memory is still 400.0 MB. Free memory was 340.9 MB in the beginning and 339.6 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:14,566 INFO L168 Benchmark]: RCFGBuilder took 206.92 ms. Allocated memory is still 400.0 MB. Free memory was 339.6 MB in the beginning and 321.0 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:14,566 INFO L168 Benchmark]: TraceAbstraction took 1186.80 ms. Allocated memory was 400.0 MB in the beginning and 601.9 MB in the end (delta: 201.9 MB). Free memory was 319.7 MB in the beginning and 442.2 MB in the end (delta: -122.5 MB). Peak memory consumption was 79.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:14,567 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.10 ms. Allocated memory is still 400.0 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.19 ms. Allocated memory is still 400.0 MB. Free memory was 354.1 MB in the beginning and 340.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.42 ms. Allocated memory is still 400.0 MB. Free memory was 340.9 MB in the beginning and 339.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 206.92 ms. Allocated memory is still 400.0 MB. Free memory was 339.6 MB in the beginning and 321.0 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1186.80 ms. Allocated memory was 400.0 MB in the beginning and 601.9 MB in the end (delta: 201.9 MB). Free memory was 319.7 MB in the beginning and 442.2 MB in the end (delta: -122.5 MB). Peak memory consumption was 79.4 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_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-48-14-572.csv Received shutdown request...