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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:25:22,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:25:22,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:25:22,088 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:25:22,089 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:25:22,090 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:25:22,091 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:25:22,093 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:25:22,095 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:25:22,095 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:25:22,096 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:25:22,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:25:22,098 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:25:22,099 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:25:22,100 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:25:22,103 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:25:22,105 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:25:22,107 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:25:22,108 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:25:22,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:25:22,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:25:22,112 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:25:22,112 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:25:22,113 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:25:22,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:25:22,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:25:22,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:25:22,116 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:25:22,116 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:25:22,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:25:22,117 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:25:22,117 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:25:22,127 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:25:22,127 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:25:22,128 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:25:22,128 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:25:22,129 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:25:22,129 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:25:22,129 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:25:22,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:25:22,130 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:25:22,130 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:25:22,130 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:25:22,131 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:25:22,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:25:22,131 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:25:22,131 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:25:22,131 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:25:22,132 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:25:22,132 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:25:22,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:25:22,132 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:25:22,132 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:25:22,133 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:25:22,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:25:22,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:25:22,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:25:22,133 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:25:22,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:25:22,134 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:25:22,134 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:25:22,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:25:22,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:25:22,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:25:22,135 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:25:22,136 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:25:22,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:25:22,183 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:25:22,187 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:25:22,189 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:25:22,189 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:25:22,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-01-30 00:25:22,351 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:25:22,358 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:25:22,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:25:22,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:25:22,363 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:25:22,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:25:22" (1/1) ... [2018-01-30 00:25:22,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a6d8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:22, skipping insertion in model container [2018-01-30 00:25:22,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:25:22" (1/1) ... [2018-01-30 00:25:22,384 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:25:22,424 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:25:22,542 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:25:22,564 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:25:22,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:22 WrapperNode [2018-01-30 00:25:22,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:25:22,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:25:22,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:25:22,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:25:22,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:22" (1/1) ... [2018-01-30 00:25:22,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:22" (1/1) ... [2018-01-30 00:25:22,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:22" (1/1) ... [2018-01-30 00:25:22,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:22" (1/1) ... [2018-01-30 00:25:22,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:22" (1/1) ... [2018-01-30 00:25:22,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:22" (1/1) ... [2018-01-30 00:25:22,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:22" (1/1) ... [2018-01-30 00:25:22,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:25:22,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:25:22,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:25:22,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:25:22,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:22" (1/1) ... No working directory specified, using /storage/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-01-30 00:25:22,663 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:25:22,664 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:25:22,664 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-30 00:25:22,664 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:25:22,664 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:25:22,664 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:25:22,664 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:25:22,664 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:25:22,665 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:25:22,665 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:25:22,665 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:25:22,665 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:25:22,665 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:25:22,665 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:25:22,665 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-30 00:25:22,666 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:25:22,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:25:22,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:25:22,863 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:25:22,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:25:22 BoogieIcfgContainer [2018-01-30 00:25:22,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:25:22,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:25:22,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:25:22,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:25:22,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:25:22" (1/3) ... [2018-01-30 00:25:22,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71353df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:25:22, skipping insertion in model container [2018-01-30 00:25:22,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:22" (2/3) ... [2018-01-30 00:25:22,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71353df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:25:22, skipping insertion in model container [2018-01-30 00:25:22,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:25:22" (3/3) ... [2018-01-30 00:25:22,872 INFO L107 eAbstractionObserver]: Analyzing ICFG simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-01-30 00:25:22,881 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:25:22,888 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-30 00:25:22,938 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:25:22,939 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:25:22,939 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:25:22,939 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:25:22,939 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:25:22,939 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:25:22,939 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:25:22,939 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:25:22,940 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:25:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-30 00:25:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-30 00:25:22,961 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:22,962 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:22,962 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:25:22,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1666539943, now seen corresponding path program 1 times [2018-01-30 00:25:22,968 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:22,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:23,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:23,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:23,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:23,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:23,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:25:23,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 00:25:23,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 00:25:23,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:25:23,102 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-30 00:25:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:23,123 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-01-30 00:25:23,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 00:25:23,124 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-30 00:25:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:23,133 INFO L225 Difference]: With dead ends: 64 [2018-01-30 00:25:23,133 INFO L226 Difference]: Without dead ends: 37 [2018-01-30 00:25:23,136 INFO L553 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-01-30 00:25:23,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-30 00:25:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-30 00:25:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-30 00:25:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-01-30 00:25:23,253 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 11 [2018-01-30 00:25:23,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:23,253 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-01-30 00:25:23,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 00:25:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-01-30 00:25:23,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 00:25:23,254 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:23,254 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:23,254 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:25:23,254 INFO L82 PathProgramCache]: Analyzing trace with hash 466217918, now seen corresponding path program 1 times [2018-01-30 00:25:23,255 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:23,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:23,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:23,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:23,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:23,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:23,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:25:23,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:25:23,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:25:23,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:25:23,316 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 3 states. [2018-01-30 00:25:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:23,383 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-30 00:25:23,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:25:23,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-30 00:25:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:23,385 INFO L225 Difference]: With dead ends: 57 [2018-01-30 00:25:23,385 INFO L226 Difference]: Without dead ends: 55 [2018-01-30 00:25:23,386 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:25:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-30 00:25:23,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-01-30 00:25:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-30 00:25:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-30 00:25:23,394 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2018-01-30 00:25:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:23,394 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-30 00:25:23,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:25:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-30 00:25:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 00:25:23,395 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:23,395 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:23,395 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:25:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash 466217959, now seen corresponding path program 1 times [2018-01-30 00:25:23,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:23,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:23,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:23,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:23,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:23,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:23,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:25:23,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:25:23,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:25:23,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:25:23,439 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 3 states. [2018-01-30 00:25:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:23,486 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-01-30 00:25:23,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:25:23,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-30 00:25:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:23,487 INFO L225 Difference]: With dead ends: 66 [2018-01-30 00:25:23,487 INFO L226 Difference]: Without dead ends: 51 [2018-01-30 00:25:23,488 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:25:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-30 00:25:23,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2018-01-30 00:25:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-30 00:25:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-01-30 00:25:23,493 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 15 [2018-01-30 00:25:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:23,494 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-01-30 00:25:23,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:25:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-01-30 00:25:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 00:25:23,494 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:23,495 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:23,495 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:25:23,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1655861603, now seen corresponding path program 1 times [2018-01-30 00:25:23,495 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:23,495 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:23,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:23,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:23,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:23,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:23,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:25:23,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:25:23,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:25:23,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:25:23,547 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 4 states. [2018-01-30 00:25:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:23,596 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-01-30 00:25:23,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:25:23,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 00:25:23,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:23,598 INFO L225 Difference]: With dead ends: 43 [2018-01-30 00:25:23,598 INFO L226 Difference]: Without dead ends: 41 [2018-01-30 00:25:23,598 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:25:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-30 00:25:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-01-30 00:25:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-30 00:25:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-01-30 00:25:23,604 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 16 [2018-01-30 00:25:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:23,604 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-01-30 00:25:23,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:25:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-01-30 00:25:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 00:25:23,605 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:23,605 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:23,605 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:25:23,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1655861604, now seen corresponding path program 1 times [2018-01-30 00:25:23,606 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:23,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:23,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:23,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:23,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:23,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:23,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:25:23,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:25:23,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:25:23,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:25:23,698 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 4 states. [2018-01-30 00:25:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:23,756 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-30 00:25:23,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:25:23,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 00:25:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:23,757 INFO L225 Difference]: With dead ends: 41 [2018-01-30 00:25:23,757 INFO L226 Difference]: Without dead ends: 39 [2018-01-30 00:25:23,758 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:25:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-30 00:25:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-01-30 00:25:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-30 00:25:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-01-30 00:25:23,763 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 16 [2018-01-30 00:25:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:23,763 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-01-30 00:25:23,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:25:23,763 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-01-30 00:25:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:25:23,764 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:23,764 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:23,765 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:25:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1496875029, now seen corresponding path program 1 times [2018-01-30 00:25:23,765 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:23,765 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:23,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:23,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:23,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:23,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:23,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:25:23,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:25:23,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:25:23,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:25:23,839 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 5 states. [2018-01-30 00:25:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:23,926 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-01-30 00:25:23,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:25:23,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-30 00:25:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:23,927 INFO L225 Difference]: With dead ends: 56 [2018-01-30 00:25:23,927 INFO L226 Difference]: Without dead ends: 54 [2018-01-30 00:25:23,928 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-30 00:25:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-30 00:25:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-01-30 00:25:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-30 00:25:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-01-30 00:25:23,933 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 25 [2018-01-30 00:25:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:23,934 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-01-30 00:25:23,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:25:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-01-30 00:25:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:25:23,935 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:23,935 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:23,935 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:25:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1496875070, now seen corresponding path program 1 times [2018-01-30 00:25:23,936 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:23,936 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:23,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:23,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:23,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:23,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:23,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:25:23,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:25:23,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:25:23,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:25:23,999 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 4 states. [2018-01-30 00:25:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:24,059 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-01-30 00:25:24,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:25:24,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-30 00:25:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:24,060 INFO L225 Difference]: With dead ends: 48 [2018-01-30 00:25:24,060 INFO L226 Difference]: Without dead ends: 46 [2018-01-30 00:25:24,061 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:25:24,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-30 00:25:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-01-30 00:25:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-30 00:25:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-30 00:25:24,066 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 25 [2018-01-30 00:25:24,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:24,067 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-30 00:25:24,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:25:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-30 00:25:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:25:24,068 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:24,068 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:24,068 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:25:24,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1496875071, now seen corresponding path program 1 times [2018-01-30 00:25:24,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:24,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:24,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:24,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:24,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:24,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:24,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:24,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:25:24,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:25:24,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:25:24,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:25:24,184 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-01-30 00:25:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:24,251 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-01-30 00:25:24,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:25:24,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-30 00:25:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:24,252 INFO L225 Difference]: With dead ends: 51 [2018-01-30 00:25:24,252 INFO L226 Difference]: Without dead ends: 49 [2018-01-30 00:25:24,253 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:25:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-30 00:25:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-01-30 00:25:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-30 00:25:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-01-30 00:25:24,256 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 25 [2018-01-30 00:25:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:24,256 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-01-30 00:25:24,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:25:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-01-30 00:25:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 00:25:24,257 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:24,257 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:24,257 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:25:24,258 INFO L82 PathProgramCache]: Analyzing trace with hash 975199522, now seen corresponding path program 1 times [2018-01-30 00:25:24,258 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:24,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:24,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:24,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:24,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:25:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:25:24,313 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 00:25:24,330 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-30 00:25:24,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:25:24 BoogieIcfgContainer [2018-01-30 00:25:24,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:25:24,344 INFO L168 Benchmark]: Toolchain (without parser) took 1992.03 ms. Allocated memory was 308.3 MB in the beginning and 475.0 MB in the end (delta: 166.7 MB). Free memory was 268.0 MB in the beginning and 337.9 MB in the end (delta: -69.9 MB). Peak memory consumption was 96.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:24,345 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 308.3 MB. Free memory is still 274.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:25:24,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.20 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 257.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:24,345 INFO L168 Benchmark]: Boogie Preprocessor took 32.06 ms. Allocated memory is still 308.3 MB. Free memory was 257.0 MB in the beginning and 255.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:24,345 INFO L168 Benchmark]: RCFGBuilder took 258.35 ms. Allocated memory is still 308.3 MB. Free memory was 255.0 MB in the beginning and 237.9 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:24,346 INFO L168 Benchmark]: TraceAbstraction took 1478.76 ms. Allocated memory was 308.3 MB in the beginning and 475.0 MB in the end (delta: 166.7 MB). Free memory was 237.9 MB in the beginning and 337.9 MB in the end (delta: -100.1 MB). Peak memory consumption was 66.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:24,347 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.23 ms. Allocated memory is still 308.3 MB. Free memory is still 274.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.20 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 257.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.06 ms. Allocated memory is still 308.3 MB. Free memory was 257.0 MB in the beginning and 255.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 258.35 ms. Allocated memory is still 308.3 MB. Free memory was 255.0 MB in the beginning and 237.9 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1478.76 ms. Allocated memory was 308.3 MB in the beginning and 475.0 MB in the end (delta: 166.7 MB). Free memory was 237.9 MB in the beginning and 337.9 MB in the end (delta: -100.1 MB). Peak memory consumption was 66.7 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] List t; [L628] List p = 0; VAL [p={0:0}] [L629] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, p={0:0}] [L630] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={13:0}, p={0:0}] [L630] t = (List) malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] [L631] COND FALSE !(t == 0) VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] [L632] FCALL t->h = 1 VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] [L633] FCALL t->n = p VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] [L634] p = t VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, t={13:0}] [L629] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={13:0}, p={13:0}, t={13:0}] [L636] COND TRUE p!=0 VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, t={13:0}] [L637] EXPR, FCALL p->h VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=1, t={13:0}] [L637] COND FALSE !(p->h != 1) VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=1, t={13:0}] [L640] EXPR, FCALL p->n VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}, t={13:0}] [L640] p = p->n VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, p->n={0:0}, t={13:0}] [L636] COND FALSE !(p!=0) VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 47 locations, 9 error locations. UNSAFE Result, 1.4s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 256 SDtfs, 313 SDslu, 195 SDs, 0 SdLazy, 154 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=2, 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, 8 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 7926 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 9/9 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 /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-25-24-356.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-25-24-356.csv Received shutdown request...