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_Camel.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 01:04:57,099 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:04:57,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:04:57,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:04:57,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:04:57,114 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:04:57,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:04:57,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:04:57,117 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:04:57,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:04:57,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:04:57,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:04:57,120 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:04:57,120 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:04:57,121 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:04:57,123 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:04:57,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:04:57,126 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:04:57,127 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:04:57,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:04:57,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:04:57,130 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:04:57,130 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:04:57,131 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:04:57,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:04:57,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:04:57,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:04:57,133 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:04:57,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:04:57,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:04:57,134 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:04:57,134 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 01:04:57,143 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:04:57,143 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:04:57,144 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:04:57,145 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:04:57,145 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:04:57,145 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:04:57,145 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:04:57,145 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:04:57,145 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:04:57,145 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:04:57,146 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:04:57,146 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:04:57,146 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:04:57,146 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:04:57,146 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:04:57,146 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:04:57,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:04:57,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:04:57,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:04:57,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:04:57,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:04:57,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:04:57,147 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 01:04:57,147 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 01:04:57,148 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 01:04:57,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:04:57,184 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:04:57,187 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:04:57,188 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:04:57,188 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:04:57,189 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 01:04:57,309 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:04:57,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:04:57,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:04:57,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:04:57,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:04:57,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:04:57" (1/1) ... [2018-02-04 01:04:57,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a67664e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:57, skipping insertion in model container [2018-02-04 01:04:57,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:04:57" (1/1) ... [2018-02-04 01:04:57,333 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:04:57,361 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:04:57,450 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:04:57,467 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:04:57,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:57 WrapperNode [2018-02-04 01:04:57,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:04:57,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:04:57,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:04:57,474 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:04:57,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:57" (1/1) ... [2018-02-04 01:04:57,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:57" (1/1) ... [2018-02-04 01:04:57,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:57" (1/1) ... [2018-02-04 01:04:57,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:57" (1/1) ... [2018-02-04 01:04:57,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:57" (1/1) ... [2018-02-04 01:04:57,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:57" (1/1) ... [2018-02-04 01:04:57,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:57" (1/1) ... [2018-02-04 01:04:57,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:04:57,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:04:57,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:04:57,501 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:04:57,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:57" (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 01:04:57,542 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:04:57,543 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:04:57,543 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-04 01:04:57,543 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:04:57,543 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:04:57,543 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:04:57,543 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 01:04:57,543 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 01:04:57,544 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:04:57,544 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:04:57,544 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:04:57,544 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 01:04:57,544 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:04:57,544 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 01:04:57,544 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-04 01:04:57,544 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:04:57,545 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:04:57,545 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:04:57,710 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:04:57,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:04:57 BoogieIcfgContainer [2018-02-04 01:04:57,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:04:57,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:04:57,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:04:57,713 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:04:57,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:04:57" (1/3) ... [2018-02-04 01:04:57,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42568675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:04:57, skipping insertion in model container [2018-02-04 01:04:57,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:04:57" (2/3) ... [2018-02-04 01:04:57,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42568675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:04:57, skipping insertion in model container [2018-02-04 01:04:57,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:04:57" (3/3) ... [2018-02-04 01:04:57,715 INFO L107 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2018-02-04 01:04:57,720 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:04:57,725 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 01:04:57,754 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:04:57,754 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:04:57,754 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 01:04:57,754 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 01:04:57,754 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:04:57,754 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:04:57,754 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:04:57,754 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:04:57,755 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:04:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-04 01:04:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 01:04:57,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:57,771 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:57,771 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 01:04:57,775 INFO L82 PathProgramCache]: Analyzing trace with hash 33713669, now seen corresponding path program 1 times [2018-02-04 01:04:57,776 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:57,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:57,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:57,811 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:57,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:57,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:57,870 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 01:04:57,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:57,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 01:04:57,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 01:04:57,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 01:04:57,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 01:04:57,882 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-02-04 01:04:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:57,895 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-04 01:04:57,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 01:04:57,896 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-02-04 01:04:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:57,901 INFO L225 Difference]: With dead ends: 53 [2018-02-04 01:04:57,901 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 01:04:57,903 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 01:04:57,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 01:04:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 01:04:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 01:04:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-04 01:04:57,982 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 11 [2018-02-04 01:04:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:57,983 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-04 01:04:57,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 01:04:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-04 01:04:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:04:57,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:57,983 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:57,983 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 01:04:57,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1961763874, now seen corresponding path program 1 times [2018-02-04 01:04:57,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:57,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:57,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:57,985 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:57,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:57,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:58,048 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 01:04:58,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:58,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:04:58,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:04:58,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:04:58,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:04:58,050 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 5 states. [2018-02-04 01:04:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:58,189 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-02-04 01:04:58,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:04:58,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 01:04:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:58,190 INFO L225 Difference]: With dead ends: 55 [2018-02-04 01:04:58,190 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 01:04:58,191 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 01:04:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 01:04:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-02-04 01:04:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 01:04:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-04 01:04:58,195 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 13 [2018-02-04 01:04:58,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:58,196 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-04 01:04:58,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:04:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-04 01:04:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:04:58,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:58,197 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:58,197 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 01:04:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1961763873, now seen corresponding path program 1 times [2018-02-04 01:04:58,197 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:58,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:58,198 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:58,198 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:58,198 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:58,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:58,299 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 01:04:58,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:58,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:04:58,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:04:58,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:04:58,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:04:58,300 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 5 states. [2018-02-04 01:04:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:58,395 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 01:04:58,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:04:58,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 01:04:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:58,396 INFO L225 Difference]: With dead ends: 63 [2018-02-04 01:04:58,396 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 01:04:58,397 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 01:04:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 01:04:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-02-04 01:04:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 01:04:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-04 01:04:58,400 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 13 [2018-02-04 01:04:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:58,400 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-04 01:04:58,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:04:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-04 01:04:58,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:04:58,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:58,401 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 01:04:58,401 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 01:04:58,401 INFO L82 PathProgramCache]: Analyzing trace with hash 722281926, now seen corresponding path program 1 times [2018-02-04 01:04:58,401 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:58,401 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:58,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:58,402 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:58,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:58,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:58,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-04 01:04:58,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:58,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:04:58,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:04:58,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:04:58,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:04:58,442 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2018-02-04 01:04:58,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:58,505 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-04 01:04:58,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:04:58,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 01:04:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:58,507 INFO L225 Difference]: With dead ends: 60 [2018-02-04 01:04:58,507 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 01:04:58,507 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 01:04:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 01:04:58,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-04 01:04:58,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 01:04:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-04 01:04:58,511 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 19 [2018-02-04 01:04:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:58,512 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-04 01:04:58,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:04:58,512 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-04 01:04:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:04:58,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:58,513 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 01:04:58,513 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 01:04:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash 587467943, now seen corresponding path program 1 times [2018-02-04 01:04:58,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:58,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:58,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:58,514 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:58,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:58,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:58,578 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 01:04:58,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:58,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:04:58,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:04:58,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:04:58,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:04:58,580 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 7 states. [2018-02-04 01:04:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:58,720 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-02-04 01:04:58,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:04:58,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 01:04:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:58,722 INFO L225 Difference]: With dead ends: 73 [2018-02-04 01:04:58,722 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 01:04:58,722 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 01:04:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 01:04:58,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2018-02-04 01:04:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 01:04:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-02-04 01:04:58,726 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 23 [2018-02-04 01:04:58,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:58,727 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-02-04 01:04:58,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:04:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-02-04 01:04:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:04:58,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:58,727 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 01:04:58,728 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 01:04:58,728 INFO L82 PathProgramCache]: Analyzing trace with hash 587467944, now seen corresponding path program 1 times [2018-02-04 01:04:58,728 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:58,728 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:58,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:58,729 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:58,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:58,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:58,812 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 01:04:58,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:04:58,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:04:58,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:04:58,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:04:58,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:04:58,813 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 7 states. [2018-02-04 01:04:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:59,045 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-02-04 01:04:59,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:04:59,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 01:04:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:59,046 INFO L225 Difference]: With dead ends: 69 [2018-02-04 01:04:59,046 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 01:04:59,046 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 01:04:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 01:04:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2018-02-04 01:04:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 01:04:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-02-04 01:04:59,050 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 23 [2018-02-04 01:04:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:59,050 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-02-04 01:04:59,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:04:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-02-04 01:04:59,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:04:59,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:59,051 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 01:04:59,051 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 01:04:59,051 INFO L82 PathProgramCache]: Analyzing trace with hash 857300197, now seen corresponding path program 1 times [2018-02-04 01:04:59,051 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:59,051 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:59,052 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:59,052 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:59,052 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:59,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:59,199 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 01:04:59,199 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:59,200 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:04:59,205 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:59,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:59,286 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 11 treesize of output 8 [2018-02-04 01:04:59,288 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 8 treesize of output 7 [2018-02-04 01:04:59,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:59,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:59,294 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 11 treesize of output 8 [2018-02-04 01:04:59,295 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 8 treesize of output 7 [2018-02-04 01:04:59,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:59,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:59,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:59,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-02-04 01:04:59,326 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 01:04:59,328 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 01:04:59,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:59,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:59,336 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 01:04:59,338 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 01:04:59,338 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:59,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:59,342 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 01:04:59,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-02-04 01:04:59,358 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 01:04:59,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:04:59,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2018-02-04 01:04:59,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:04:59,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:04:59,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:04:59,378 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-02-04 01:04:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:59,527 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-02-04 01:04:59,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:04:59,527 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-02-04 01:04:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:59,528 INFO L225 Difference]: With dead ends: 64 [2018-02-04 01:04:59,528 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 01:04:59,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:04:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 01:04:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-02-04 01:04:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 01:04:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-02-04 01:04:59,530 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-02-04 01:04:59,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:59,531 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-02-04 01:04:59,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:04:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-02-04 01:04:59,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 01:04:59,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:59,531 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 01:04:59,531 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 01:04:59,531 INFO L82 PathProgramCache]: Analyzing trace with hash 806501016, now seen corresponding path program 1 times [2018-02-04 01:04:59,531 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:59,531 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:59,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:59,532 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:59,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 01:04:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 01:04:59,565 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 01:04:59,574 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 01:04:59,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:04:59 BoogieIcfgContainer [2018-02-04 01:04:59,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:04:59,584 INFO L168 Benchmark]: Toolchain (without parser) took 2274.59 ms. Allocated memory was 401.1 MB in the beginning and 630.2 MB in the end (delta: 229.1 MB). Free memory was 359.3 MB in the beginning and 504.8 MB in the end (delta: -145.5 MB). Peak memory consumption was 83.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:59,584 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:04:59,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.74 ms. Allocated memory is still 401.1 MB. Free memory was 358.0 MB in the beginning and 347.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:59,584 INFO L168 Benchmark]: Boogie Preprocessor took 27.49 ms. Allocated memory is still 401.1 MB. Free memory was 347.3 MB in the beginning and 346.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:59,585 INFO L168 Benchmark]: RCFGBuilder took 209.05 ms. Allocated memory is still 401.1 MB. Free memory was 346.0 MB in the beginning and 325.3 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:59,585 INFO L168 Benchmark]: TraceAbstraction took 1872.38 ms. Allocated memory was 401.1 MB in the beginning and 630.2 MB in the end (delta: 229.1 MB). Free memory was 325.3 MB in the beginning and 504.8 MB in the end (delta: -179.5 MB). Peak memory consumption was 49.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:59,586 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 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 162.74 ms. Allocated memory is still 401.1 MB. Free memory was 358.0 MB in the beginning and 347.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.49 ms. Allocated memory is still 401.1 MB. Free memory was 347.3 MB in the beginning and 346.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 209.05 ms. Allocated memory is still 401.1 MB. Free memory was 346.0 MB in the beginning and 325.3 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1872.38 ms. Allocated memory was 401.1 MB in the beginning and 630.2 MB in the end (delta: 229.1 MB). Free memory was 325.3 MB in the beginning and 504.8 MB in the end (delta: -179.5 MB). Peak memory consumption was 49.6 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.8s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 226 SDtfs, 632 SDslu, 430 SDs, 0 SdLazy, 505 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 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.5s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 16082 SizeOfPredicates, 11 NumberOfNonLiveVariables, 95 ConjunctsInSsa, 21 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-04-59-592.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-04-59-592.csv Received shutdown request...