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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:18:52,673 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:18:52,675 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:18:52,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:18:52,685 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:18:52,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:18:52,686 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:18:52,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:18:52,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:18:52,690 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:18:52,691 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:18:52,691 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:18:52,692 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:18:52,693 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:18:52,694 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:18:52,696 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:18:52,697 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:18:52,699 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:18:52,700 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:18:52,701 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:18:52,702 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:18:52,703 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:18:52,703 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:18:52,704 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:18:52,705 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:18:52,706 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:18:52,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:18:52,707 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:18:52,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:18:52,707 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:18:52,708 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:18:52,708 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:18:52,718 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:18:52,718 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:18:52,719 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:18:52,719 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:18:52,719 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:18:52,720 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:18:52,720 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:18:52,720 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:18:52,720 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:18:52,720 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:18:52,720 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:18:52,721 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:18:52,721 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:18:52,721 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:18:52,721 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:18:52,721 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:18:52,721 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:18:52,721 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:18:52,722 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:18:52,722 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:18:52,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:18:52,722 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:18:52,722 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:18:52,722 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:18:52,722 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:18:52,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:18:52,761 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:18:52,764 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:18:52,765 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:18:52,766 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:18:52,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-02-04 04:18:52,900 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:18:52,901 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:18:52,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:18:52,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:18:52,907 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:18:52,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:18:52" (1/1) ... [2018-02-04 04:18:52,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f51d34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:52, skipping insertion in model container [2018-02-04 04:18:52,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:18:52" (1/1) ... [2018-02-04 04:18:52,920 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:18:52,943 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:18:53,025 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:18:53,037 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:18:53,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:53 WrapperNode [2018-02-04 04:18:53,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:18:53,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:18:53,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:18:53,042 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:18:53,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:53" (1/1) ... [2018-02-04 04:18:53,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:53" (1/1) ... [2018-02-04 04:18:53,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:53" (1/1) ... [2018-02-04 04:18:53,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:53" (1/1) ... [2018-02-04 04:18:53,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:53" (1/1) ... [2018-02-04 04:18:53,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:53" (1/1) ... [2018-02-04 04:18:53,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:53" (1/1) ... [2018-02-04 04:18:53,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:18:53,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:18:53,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:18:53,074 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:18:53,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:53" (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-04 04:18:53,124 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:18:53,124 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:18:53,124 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-04 04:18:53,125 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:18:53,125 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:18:53,125 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:18:53,125 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:18:53,125 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:18:53,125 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:18:53,125 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:18:53,126 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:18:53,126 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 04:18:53,126 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:18:53,126 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:18:53,126 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-04 04:18:53,126 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:18:53,126 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:18:53,126 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:18:53,341 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:18:53,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:18:53 BoogieIcfgContainer [2018-02-04 04:18:53,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:18:53,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:18:53,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:18:53,344 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:18:53,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:18:52" (1/3) ... [2018-02-04 04:18:53,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41708f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:18:53, skipping insertion in model container [2018-02-04 04:18:53,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:53" (2/3) ... [2018-02-04 04:18:53,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41708f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:18:53, skipping insertion in model container [2018-02-04 04:18:53,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:18:53" (3/3) ... [2018-02-04 04:18:53,347 INFO L107 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2018-02-04 04:18:53,354 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:18:53,359 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 04:18:53,390 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:18:53,390 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:18:53,391 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:18:53,391 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:18:53,391 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:18:53,391 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:18:53,391 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:18:53,391 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:18:53,392 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:18:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-04 04:18:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 04:18:53,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:53,413 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:18:53,414 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 04:18:53,418 INFO L82 PathProgramCache]: Analyzing trace with hash 33713669, now seen corresponding path program 1 times [2018-02-04 04:18:53,419 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:53,420 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:53,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:53,466 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:53,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:53,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:53,536 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-04 04:18:53,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:53,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:18:53,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 04:18:53,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 04:18:53,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 04:18:53,549 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-02-04 04:18:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:53,565 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-04 04:18:53,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 04:18:53,566 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-02-04 04:18:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:53,573 INFO L225 Difference]: With dead ends: 53 [2018-02-04 04:18:53,573 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 04:18:53,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 04:18:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 04:18:53,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 04:18:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 04:18:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-04 04:18:53,659 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 11 [2018-02-04 04:18:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:53,660 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-04 04:18:53,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 04:18:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-04 04:18:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 04:18:53,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:53,660 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:18:53,660 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 04:18:53,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1961763874, now seen corresponding path program 1 times [2018-02-04 04:18:53,661 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:53,661 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:53,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:53,662 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:53,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:53,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:53,731 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-04 04:18:53,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:53,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:18:53,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:18:53,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:18:53,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:18:53,734 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 5 states. [2018-02-04 04:18:53,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:53,880 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-02-04 04:18:53,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:18:53,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 04:18:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:53,881 INFO L225 Difference]: With dead ends: 55 [2018-02-04 04:18:53,882 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 04:18:53,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:18:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 04:18:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-02-04 04:18:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 04:18:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-04 04:18:53,887 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 13 [2018-02-04 04:18:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:53,887 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-04 04:18:53,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:18:53,888 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-04 04:18:53,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 04:18:53,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:53,888 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:18:53,888 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 04:18:53,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1961763873, now seen corresponding path program 1 times [2018-02-04 04:18:53,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:53,889 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:53,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:53,890 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:53,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:53,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:53,965 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-04 04:18:53,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:53,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:18:53,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:18:53,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:18:53,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:18:53,966 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 5 states. [2018-02-04 04:18:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:54,078 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 04:18:54,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:18:54,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 04:18:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:54,080 INFO L225 Difference]: With dead ends: 63 [2018-02-04 04:18:54,080 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 04:18:54,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:18:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 04:18:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-02-04 04:18:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 04:18:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-04 04:18:54,085 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 13 [2018-02-04 04:18:54,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:54,086 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-04 04:18:54,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:18:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-04 04:18:54,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:18:54,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:54,087 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-04 04:18:54,087 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 04:18:54,087 INFO L82 PathProgramCache]: Analyzing trace with hash 722281926, now seen corresponding path program 1 times [2018-02-04 04:18:54,087 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:54,087 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:54,088 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:54,088 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:54,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:54,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:54,129 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-04 04:18:54,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:54,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:18:54,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:18:54,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:18:54,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:18:54,130 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2018-02-04 04:18:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:54,174 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-04 04:18:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:18:54,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 04:18:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:54,174 INFO L225 Difference]: With dead ends: 60 [2018-02-04 04:18:54,175 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 04:18:54,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:18:54,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 04:18:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-04 04:18:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 04:18:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-04 04:18:54,179 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 19 [2018-02-04 04:18:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:54,179 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-04 04:18:54,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:18:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-04 04:18:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 04:18:54,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:54,180 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:18:54,181 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 04:18:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash 587467943, now seen corresponding path program 1 times [2018-02-04 04:18:54,181 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:54,181 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:54,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:54,182 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:54,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:54,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:18:54,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:54,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:18:54,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:18:54,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:18:54,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:18:54,240 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 7 states. [2018-02-04 04:18:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:54,409 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-02-04 04:18:54,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:18:54,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 04:18:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:54,411 INFO L225 Difference]: With dead ends: 73 [2018-02-04 04:18:54,411 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 04:18:54,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:18:54,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 04:18:54,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2018-02-04 04:18:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 04:18:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-02-04 04:18:54,415 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 23 [2018-02-04 04:18:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:54,415 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-02-04 04:18:54,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:18:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-02-04 04:18:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 04:18:54,416 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:54,416 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] [2018-02-04 04:18:54,416 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 04:18:54,416 INFO L82 PathProgramCache]: Analyzing trace with hash 587467944, now seen corresponding path program 1 times [2018-02-04 04:18:54,416 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:54,417 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:54,417 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:54,417 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:54,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:54,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:18:54,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:54,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:18:54,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:18:54,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:18:54,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:18:54,498 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 7 states. [2018-02-04 04:18:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:54,686 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-02-04 04:18:54,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:18:54,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 04:18:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:54,687 INFO L225 Difference]: With dead ends: 69 [2018-02-04 04:18:54,687 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 04:18:54,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:18:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 04:18:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2018-02-04 04:18:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 04:18:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-02-04 04:18:54,691 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 23 [2018-02-04 04:18:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:54,691 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-02-04 04:18:54,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:18:54,691 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-02-04 04:18:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 04:18:54,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:54,692 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] [2018-02-04 04:18:54,692 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 04:18:54,692 INFO L82 PathProgramCache]: Analyzing trace with hash 857300197, now seen corresponding path program 1 times [2018-02-04 04:18:54,692 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:54,692 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:54,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:54,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:54,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:54,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:18:54,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:18:54,854 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:18:54,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:54,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:18:54,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:18:54,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:18:54,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:18:54,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:18:54,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-02-04 04:18:54,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:18:54,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 04:18:54,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 04:18:54,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 04:18:54,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:18:55,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 04:18:55,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 04:18:55,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 04:18:55,006 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:18:55,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 04:18:55,011 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:48, output treesize:28 [2018-02-04 04:18:55,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 04:18:55,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 04:18:55,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:18:55,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:18:55,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 04:18:55,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 04:18:55,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 04:18:55,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:18:55,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:18:55,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-02-04 04:18:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:18:55,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:18:55,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2018-02-04 04:18:55,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:18:55,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:18:55,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:18:55,056 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-02-04 04:18:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:55,249 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-02-04 04:18:55,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:18:55,249 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-02-04 04:18:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:55,250 INFO L225 Difference]: With dead ends: 64 [2018-02-04 04:18:55,250 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 04:18:55,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:18:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 04:18:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-02-04 04:18:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 04:18:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-02-04 04:18:55,254 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-02-04 04:18:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:55,254 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-02-04 04:18:55,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:18:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-02-04 04:18:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 04:18:55,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:55,255 INFO L351 BasicCegarLoop]: trace histogram [2, 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-04 04:18:55,255 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 04:18:55,255 INFO L82 PathProgramCache]: Analyzing trace with hash 806501016, now seen corresponding path program 1 times [2018-02-04 04:18:55,255 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:55,255 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:55,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:55,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:55,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 04:18:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 04:18:55,290 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 04:18:55,299 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 04:18:55,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:18:55 BoogieIcfgContainer [2018-02-04 04:18:55,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:18:55,311 INFO L168 Benchmark]: Toolchain (without parser) took 2410.61 ms. Allocated memory was 400.6 MB in the beginning and 629.7 MB in the end (delta: 229.1 MB). Free memory was 357.0 MB in the beginning and 485.7 MB in the end (delta: -128.6 MB). Peak memory consumption was 100.5 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:55,312 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 400.6 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:18:55,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.92 ms. Allocated memory is still 400.6 MB. Free memory was 357.0 MB in the beginning and 346.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:55,312 INFO L168 Benchmark]: Boogie Preprocessor took 32.05 ms. Allocated memory is still 400.6 MB. Free memory was 346.5 MB in the beginning and 343.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:55,312 INFO L168 Benchmark]: RCFGBuilder took 267.72 ms. Allocated memory is still 400.6 MB. Free memory was 343.8 MB in the beginning and 324.0 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:55,313 INFO L168 Benchmark]: TraceAbstraction took 1967.77 ms. Allocated memory was 400.6 MB in the beginning and 629.7 MB in the end (delta: 229.1 MB). Free memory was 324.0 MB in the beginning and 485.7 MB in the end (delta: -161.7 MB). Peak memory consumption was 67.4 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:55,314 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.14 ms. Allocated memory is still 400.6 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 139.92 ms. Allocated memory is still 400.6 MB. Free memory was 357.0 MB in the beginning and 346.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.05 ms. Allocated memory is still 400.6 MB. Free memory was 346.5 MB in the beginning and 343.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 267.72 ms. Allocated memory is still 400.6 MB. Free memory was 343.8 MB in the beginning and 324.0 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1967.77 ms. Allocated memory was 400.6 MB in the beginning and 629.7 MB in the end (delta: 229.1 MB). Free memory was 324.0 MB in the beginning and 485.7 MB in the end (delta: -161.7 MB). Peak memory consumption was 67.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={11:0}] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={11:0}, malloc(sizeof(struct node))={11:0}] [L628] COND FALSE !(a == 0) VAL [a={11:0}, malloc(sizeof(struct node))={11:0}] [L629] List t; [L630] List p = a; VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] FCALL p->h = 1 VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L639] FCALL p->n = 0 VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L640] p = a VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L641] COND TRUE p!=0 VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L642] EXPR, FCALL p->h VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=1] [L642] COND FALSE !(p->h != 1) [L645] EXPR, FCALL p->n VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->n={0:0}] [L645] p = p->n [L641] COND FALSE !(p!=0) VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={0:0}] [L647] return 0; VAL [\result=0, a={11:0}, malloc(sizeof(struct node))={11:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 15 error locations. UNSAFE Result, 1.9s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 223 SDtfs, 713 SDslu, 395 SDs, 0 SdLazy, 517 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 74 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 17140 SizeOfPredicates, 13 NumberOfNonLiveVariables, 95 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 8/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-18-55-320.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-18-55-320.csv Received shutdown request...