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/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:40:05,673 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:40:05,674 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:40:05,686 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:40:05,686 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:40:05,687 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:40:05,688 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:40:05,689 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:40:05,690 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:40:05,690 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:40:05,691 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:40:05,691 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:40:05,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:40:05,692 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:40:05,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:40:05,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:40:05,694 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:40:05,695 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:40:05,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:40:05,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:40:05,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:40:05,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:40:05,698 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:40:05,699 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:40:05,699 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:40:05,700 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:40:05,700 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:40:05,700 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:40:05,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:40:05,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:40:05,701 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:40:05,701 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:40:05,707 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:40:05,707 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:40:05,708 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:40:05,708 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:40:05,708 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:40:05,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:40:05,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:40:05,709 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:40:05,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:40:05,709 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:40:05,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:40:05,709 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:40:05,709 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:40:05,709 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:40:05,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:40:05,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:40:05,709 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:40:05,709 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:40:05,709 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:40:05,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:40:05,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:40:05,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:40:05,710 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:40:05,710 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:40:05,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:40:05,744 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:40:05,747 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:40:05,748 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:40:05,749 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:40:05,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-02-02 10:40:05,882 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:40:05,884 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:40:05,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:40:05,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:40:05,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:40:05,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:40:05" (1/1) ... [2018-02-02 10:40:05,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282d9c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:05, skipping insertion in model container [2018-02-02 10:40:05,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:40:05" (1/1) ... [2018-02-02 10:40:05,909 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:40:05,939 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:40:06,028 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:40:06,040 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:40:06,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:06 WrapperNode [2018-02-02 10:40:06,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:40:06,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:40:06,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:40:06,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:40:06,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:06" (1/1) ... [2018-02-02 10:40:06,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:06" (1/1) ... [2018-02-02 10:40:06,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:06" (1/1) ... [2018-02-02 10:40:06,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:06" (1/1) ... [2018-02-02 10:40:06,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:06" (1/1) ... [2018-02-02 10:40:06,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:06" (1/1) ... [2018-02-02 10:40:06,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:06" (1/1) ... [2018-02-02 10:40:06,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:40:06,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:40:06,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:40:06,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:40:06,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:06" (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:40:06,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:40:06,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:40:06,119 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:40:06,119 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:40:06,119 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:40:06,119 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:40:06,119 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:40:06,120 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:40:06,120 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:40:06,120 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:40:06,120 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:40:06,120 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:40:06,120 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:40:06,120 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:40:06,334 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:40:06,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:40:06 BoogieIcfgContainer [2018-02-02 10:40:06,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:40:06,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:40:06,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:40:06,337 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:40:06,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:40:05" (1/3) ... [2018-02-02 10:40:06,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcd712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:40:06, skipping insertion in model container [2018-02-02 10:40:06,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:06" (2/3) ... [2018-02-02 10:40:06,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcd712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:40:06, skipping insertion in model container [2018-02-02 10:40:06,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:40:06" (3/3) ... [2018-02-02 10:40:06,341 INFO L107 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-02-02 10:40:06,348 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:40:06,352 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-02-02 10:40:06,376 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:40:06,376 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:40:06,376 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:40:06,376 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:40:06,376 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:40:06,376 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:40:06,376 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:40:06,376 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:40:06,377 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:40:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-02-02 10:40:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 10:40:06,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:06,394 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:06,394 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:06,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1414487999, now seen corresponding path program 1 times [2018-02-02 10:40:06,448 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:06,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:06,579 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:40:06,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:06,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:06,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:06,582 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:40:06,582 INFO L182 omatonBuilderFactory]: Interpolants [68#true, 69#false, 70#(= 1 (select |#valid| |main_#t~malloc0.base|)), 71#(= 1 (select |#valid| main_~y~0.base))] [2018-02-02 10:40:06,582 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:40:06,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:06,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:06,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:06,593 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2018-02-02 10:40:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:06,828 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-02-02 10:40:06,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:40:06,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-02-02 10:40:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:06,834 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:40:06,834 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 10:40:06,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 10:40:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2018-02-02 10:40:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 10:40:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-02-02 10:40:06,857 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 9 [2018-02-02 10:40:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:06,857 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-02-02 10:40:06,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-02-02 10:40:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 10:40:06,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:06,857 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:06,857 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1414487998, now seen corresponding path program 1 times [2018-02-02 10:40:06,858 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:06,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:40:06,930 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:40:06,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:06,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:06,930 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:06,931 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:40:06,931 INFO L182 omatonBuilderFactory]: Interpolants [213#true, 214#false, 215#(and (= 13 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 216#(and (= (select |#length| main_~y~0.base) 13) (= main_~y~0.offset 0))] [2018-02-02 10:40:06,931 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:40:06,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:06,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:06,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:06,933 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 4 states. [2018-02-02 10:40:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:07,020 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-02 10:40:07,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:40:07,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-02-02 10:40:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:07,022 INFO L225 Difference]: With dead ends: 104 [2018-02-02 10:40:07,022 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 10:40:07,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 10:40:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 54. [2018-02-02 10:40:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 10:40:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-02-02 10:40:07,028 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 9 [2018-02-02 10:40:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:07,028 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-02-02 10:40:07,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:07,029 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-02-02 10:40:07,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:40:07,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:07,029 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:07,029 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash 689004913, now seen corresponding path program 1 times [2018-02-02 10:40:07,030 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:07,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:07,085 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:40:07,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:07,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:07,085 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:07,086 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:40:07,086 INFO L182 omatonBuilderFactory]: Interpolants [377#true, 378#false, 379#(= (select |#valid| main_~y~0.base) 1), 380#(= 1 (select |#valid| main_~list~0.base))] [2018-02-02 10:40:07,086 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:40:07,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:07,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:07,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:07,087 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-02-02 10:40:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:07,181 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-02-02 10:40:07,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:40:07,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-02 10:40:07,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:07,183 INFO L225 Difference]: With dead ends: 64 [2018-02-02 10:40:07,183 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 10:40:07,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 10:40:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-02-02 10:40:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 10:40:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-02-02 10:40:07,187 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 18 [2018-02-02 10:40:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:07,188 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-02-02 10:40:07,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-02-02 10:40:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:40:07,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:07,189 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:07,189 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash 689004914, now seen corresponding path program 1 times [2018-02-02 10:40:07,190 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:07,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:07,282 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:40:07,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:07,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:40:07,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:07,284 INFO L182 omatonBuilderFactory]: Interpolants [505#true, 506#false, 507#(and (= 13 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 508#(and (= 13 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset)), 509#(and (= main_~list~0.offset 0) (= (select |#length| main_~list~0.base) 13))] [2018-02-02 10:40:07,284 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:40:07,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:40:07,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:40:07,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:07,285 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 5 states. [2018-02-02 10:40:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:07,398 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2018-02-02 10:40:07,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:40:07,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:40:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:07,399 INFO L225 Difference]: With dead ends: 139 [2018-02-02 10:40:07,399 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 10:40:07,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:40:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 10:40:07,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2018-02-02 10:40:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:40:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-02-02 10:40:07,403 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 18 [2018-02-02 10:40:07,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:07,404 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-02-02 10:40:07,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:40:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-02-02 10:40:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:40:07,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:07,404 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:07,404 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:07,404 INFO L82 PathProgramCache]: Analyzing trace with hash 689036531, now seen corresponding path program 1 times [2018-02-02 10:40:07,405 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:07,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:07,440 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:40:07,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:07,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:07,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:07,441 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:40:07,441 INFO L182 omatonBuilderFactory]: Interpolants [731#true, 732#false, 733#(= 1 (select |#valid| |main_#t~malloc5.base|)), 734#(= 1 (select |#valid| main_~y~0.base))] [2018-02-02 10:40:07,441 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:40:07,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:07,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:07,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:07,442 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 4 states. [2018-02-02 10:40:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:07,495 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-02-02 10:40:07,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:40:07,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-02 10:40:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:07,497 INFO L225 Difference]: With dead ends: 92 [2018-02-02 10:40:07,497 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:40:07,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:40:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2018-02-02 10:40:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 10:40:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2018-02-02 10:40:07,504 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 18 [2018-02-02 10:40:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:07,504 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2018-02-02 10:40:07,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2018-02-02 10:40:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:40:07,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:07,506 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:07,506 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:07,506 INFO L82 PathProgramCache]: Analyzing trace with hash 689036532, now seen corresponding path program 1 times [2018-02-02 10:40:07,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:07,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:07,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:40:07,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:07,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:07,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:07,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:40:07,553 INFO L182 omatonBuilderFactory]: Interpolants [905#true, 906#false, 907#(and (= 0 |main_#t~malloc5.offset|) (= 13 (select |#length| |main_#t~malloc5.base|))), 908#(and (= (select |#length| main_~y~0.base) 13) (= main_~y~0.offset 0))] [2018-02-02 10:40:07,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:40:07,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:07,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:07,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:07,554 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 4 states. [2018-02-02 10:40:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:07,623 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2018-02-02 10:40:07,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:40:07,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-02 10:40:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:07,624 INFO L225 Difference]: With dead ends: 110 [2018-02-02 10:40:07,624 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 10:40:07,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 10:40:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 73. [2018-02-02 10:40:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 10:40:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2018-02-02 10:40:07,629 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 18 [2018-02-02 10:40:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:07,629 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2018-02-02 10:40:07,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-02-02 10:40:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:40:07,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:07,630 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:40:07,630 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash -115685232, now seen corresponding path program 1 times [2018-02-02 10:40:07,631 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:07,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:07,663 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:40:07,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:07,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:40:07,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:07,663 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:40:07,663 INFO L182 omatonBuilderFactory]: Interpolants [1095#true, 1096#false, 1097#(not (= 0 |main_#t~malloc0.base|)), 1098#(not (= 0 main_~y~0.base)), 1099#(not (= 0 main_~list~0.base))] [2018-02-02 10:40:07,664 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:40:07,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:40:07,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:40:07,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:07,664 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand 5 states. [2018-02-02 10:40:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:07,749 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-02-02 10:40:07,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:40:07,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-02 10:40:07,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:07,750 INFO L225 Difference]: With dead ends: 87 [2018-02-02 10:40:07,750 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 10:40:07,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:40:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 10:40:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2018-02-02 10:40:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 10:40:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2018-02-02 10:40:07,754 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 19 [2018-02-02 10:40:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:07,754 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2018-02-02 10:40:07,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:40:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2018-02-02 10:40:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:40:07,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:07,755 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] [2018-02-02 10:40:07,755 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash 580005852, now seen corresponding path program 1 times [2018-02-02 10:40:07,755 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:07,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:07,893 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:40:07,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:07,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:40:07,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:07,894 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:40:07,894 INFO L182 omatonBuilderFactory]: Interpolants [1266#true, 1267#false, 1268#(= 0 |main_#t~malloc0.offset|), 1269#(= 0 main_~y~0.offset), 1270#(and (= (+ main_~y~0.offset 12) (select (select |#memory_$Pointer$.offset| main_~y~0.base) (+ main_~y~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 8)) main_~y~0.base) (= 0 main_~y~0.offset)), 1271#(and (= 12 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ 0 8))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ 0 8)) main_~list~0.base)), 1272#(and (= main_~y~0.offset 0) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 8))) (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 8))) (= |main_#t~mem14.offset| (+ main_~y~0.offset 12)))] [2018-02-02 10:40:07,894 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:40:07,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:40:07,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:40:07,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:40:07,895 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 7 states. [2018-02-02 10:40:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:08,033 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-02 10:40:08,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:40:08,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 10:40:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:08,034 INFO L225 Difference]: With dead ends: 77 [2018-02-02 10:40:08,034 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 10:40:08,035 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:40:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 10:40:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-02-02 10:40:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 10:40:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-02-02 10:40:08,042 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 23 [2018-02-02 10:40:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:08,042 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-02-02 10:40:08,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:40:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-02-02 10:40:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:40:08,042 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:08,042 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] [2018-02-02 10:40:08,043 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:08,043 INFO L82 PathProgramCache]: Analyzing trace with hash -493029770, now seen corresponding path program 1 times [2018-02-02 10:40:08,043 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:08,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:08,069 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:40:08,072 INFO L168 Benchmark]: Toolchain (without parser) took 2189.20 ms. Allocated memory was 405.8 MB in the beginning and 632.3 MB in the end (delta: 226.5 MB). Free memory was 359.8 MB in the beginning and 556.9 MB in the end (delta: -197.0 MB). Peak memory consumption was 29.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:08,073 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 405.8 MB. Free memory is still 366.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:40:08,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.34 ms. Allocated memory is still 405.8 MB. Free memory was 359.8 MB in the beginning and 349.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:08,074 INFO L168 Benchmark]: Boogie Preprocessor took 30.11 ms. Allocated memory is still 405.8 MB. Free memory was 349.2 MB in the beginning and 347.9 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:40:08,074 INFO L168 Benchmark]: RCFGBuilder took 258.19 ms. Allocated memory is still 405.8 MB. Free memory was 347.9 MB in the beginning and 325.4 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:08,074 INFO L168 Benchmark]: TraceAbstraction took 1736.24 ms. Allocated memory was 405.8 MB in the beginning and 632.3 MB in the end (delta: 226.5 MB). Free memory was 324.0 MB in the beginning and 556.9 MB in the end (delta: -232.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:40:08,076 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.18 ms. Allocated memory is still 405.8 MB. Free memory is still 366.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.34 ms. Allocated memory is still 405.8 MB. Free memory was 359.8 MB in the beginning and 349.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.11 ms. Allocated memory is still 405.8 MB. Free memory was 349.2 MB in the beginning and 347.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 258.19 ms. Allocated memory is still 405.8 MB. Free memory was 347.9 MB in the beginning and 325.4 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1736.24 ms. Allocated memory was 405.8 MB in the beginning and 632.3 MB in the end (delta: 226.5 MB). Free memory was 324.0 MB in the beginning and 556.9 MB in the end (delta: -232.8 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/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-40-08-083.csv Received shutdown request...