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_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:15:49,292 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:15:49,294 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:15:49,309 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:15:49,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:15:49,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:15:49,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:15:49,314 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:15:49,316 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:15:49,317 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:15:49,318 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:15:49,318 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:15:49,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:15:49,320 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:15:49,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:15:49,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:15:49,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:15:49,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:15:49,329 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:15:49,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:15:49,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:15:49,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:15:49,333 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:15:49,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:15:49,335 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:15:49,337 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:15:49,337 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:15:49,338 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:15:49,338 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:15:49,338 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:15:49,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:15:49,339 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:15:49,350 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:15:49,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:15:49,352 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:15:49,352 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:15:49,352 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:15:49,352 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:15:49,353 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:15:49,353 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:15:49,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:15:49,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:15:49,354 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:15:49,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:15:49,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:15:49,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:15:49,355 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:15:49,355 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:15:49,355 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:15:49,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:15:49,356 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:15:49,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:15:49,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:15:49,356 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:15:49,356 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:15:49,357 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:15:49,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:15:49,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:15:49,357 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:15:49,358 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:15:49,358 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:15:49,358 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:15:49,358 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:15:49,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:15:49,359 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:15:49,359 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:15:49,360 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:15:49,360 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:15:49,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:15:49,409 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:15:49,413 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:15:49,414 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:15:49,414 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:15:49,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-01-25 06:15:49,583 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:15:49,590 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:15:49,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:15:49,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:15:49,600 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:15:49,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:15:49" (1/1) ... [2018-01-25 06:15:49,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:49, skipping insertion in model container [2018-01-25 06:15:49,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:15:49" (1/1) ... [2018-01-25 06:15:49,623 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:15:49,664 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:15:49,781 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:15:49,798 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:15:49,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:49 WrapperNode [2018-01-25 06:15:49,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:15:49,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:15:49,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:15:49,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:15:49,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:49" (1/1) ... [2018-01-25 06:15:49,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:49" (1/1) ... [2018-01-25 06:15:49,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:49" (1/1) ... [2018-01-25 06:15:49,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:49" (1/1) ... [2018-01-25 06:15:49,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:49" (1/1) ... [2018-01-25 06:15:49,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:49" (1/1) ... [2018-01-25 06:15:49,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:49" (1/1) ... [2018-01-25 06:15:49,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:15:49,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:15:49,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:15:49,847 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:15:49,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:49" (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-25 06:15:49,900 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:15:49,901 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:15:49,901 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-25 06:15:49,901 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:15:49,901 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:15:49,901 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:15:49,901 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:15:49,901 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:15:49,901 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:15:49,901 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:15:49,902 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:15:49,902 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 06:15:49,902 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:15:49,902 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:15:49,902 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-25 06:15:49,902 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:15:49,902 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:15:49,902 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:15:50,204 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:15:50,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:15:50 BoogieIcfgContainer [2018-01-25 06:15:50,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:15:50,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:15:50,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:15:50,209 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:15:50,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:15:49" (1/3) ... [2018-01-25 06:15:50,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abfc07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:15:50, skipping insertion in model container [2018-01-25 06:15:50,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:49" (2/3) ... [2018-01-25 06:15:50,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abfc07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:15:50, skipping insertion in model container [2018-01-25 06:15:50,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:15:50" (3/3) ... [2018-01-25 06:15:50,213 INFO L105 eAbstractionObserver]: Analyzing ICFG list_true-unreach-call_false-valid-memtrack.i [2018-01-25 06:15:50,223 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:15:50,232 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-01-25 06:15:50,285 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:15:50,285 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:15:50,285 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:15:50,286 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:15:50,286 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:15:50,286 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:15:50,286 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:15:50,286 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:15:50,287 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:15:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-25 06:15:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 06:15:50,316 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:50,318 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:50,318 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:50,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1577909781, now seen corresponding path program 1 times [2018-01-25 06:15:50,326 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:50,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:50,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:50,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:50,381 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:50,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:50,462 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-25 06:15:50,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:50,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:15:50,465 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:50,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 06:15:50,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 06:15:50,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 06:15:50,480 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 2 states. [2018-01-25 06:15:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:50,509 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2018-01-25 06:15:50,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 06:15:50,590 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-25 06:15:50,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:50,601 INFO L225 Difference]: With dead ends: 131 [2018-01-25 06:15:50,601 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 06:15:50,605 INFO L525 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-25 06:15:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 06:15:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-25 06:15:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 06:15:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-01-25 06:15:50,645 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 12 [2018-01-25 06:15:50,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:50,646 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-01-25 06:15:50,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 06:15:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-01-25 06:15:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 06:15:50,647 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:50,647 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:50,647 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:50,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1669671355, now seen corresponding path program 1 times [2018-01-25 06:15:50,648 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:50,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:50,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:50,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:50,650 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:50,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:50,777 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-25 06:15:50,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:50,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:15:50,777 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:50,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:15:50,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:15:50,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:15:50,779 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2018-01-25 06:15:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:50,986 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-01-25 06:15:50,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:15:50,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-25 06:15:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:50,989 INFO L225 Difference]: With dead ends: 93 [2018-01-25 06:15:50,989 INFO L226 Difference]: Without dead ends: 81 [2018-01-25 06:15:50,990 INFO L525 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-01-25 06:15:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-25 06:15:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-01-25 06:15:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-25 06:15:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-01-25 06:15:51,001 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 13 [2018-01-25 06:15:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:51,001 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-01-25 06:15:51,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:15:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-01-25 06:15:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 06:15:51,002 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:51,003 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:51,003 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1669671356, now seen corresponding path program 1 times [2018-01-25 06:15:51,003 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:51,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:51,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:51,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:51,005 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:51,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:51,136 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-25 06:15:51,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:51,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:15:51,136 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:51,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:15:51,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:15:51,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:15:51,137 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2018-01-25 06:15:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:51,321 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-01-25 06:15:51,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:15:51,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-25 06:15:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:51,323 INFO L225 Difference]: With dead ends: 114 [2018-01-25 06:15:51,323 INFO L226 Difference]: Without dead ends: 102 [2018-01-25 06:15:51,323 INFO L525 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-01-25 06:15:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-25 06:15:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2018-01-25 06:15:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 06:15:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-01-25 06:15:51,334 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 13 [2018-01-25 06:15:51,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:51,334 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-01-25 06:15:51,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:15:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-01-25 06:15:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 06:15:51,336 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:51,336 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:51,336 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1462598724, now seen corresponding path program 1 times [2018-01-25 06:15:51,337 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:51,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:51,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:51,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:51,338 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:51,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:51,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:51,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:15:51,437 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:51,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:15:51,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:15:51,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:15:51,438 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 7 states. [2018-01-25 06:15:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:51,735 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2018-01-25 06:15:51,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:15:51,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-25 06:15:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:51,737 INFO L225 Difference]: With dead ends: 192 [2018-01-25 06:15:51,737 INFO L226 Difference]: Without dead ends: 189 [2018-01-25 06:15:51,737 INFO L525 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-01-25 06:15:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-25 06:15:51,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 97. [2018-01-25 06:15:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 06:15:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2018-01-25 06:15:51,745 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 23 [2018-01-25 06:15:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:51,746 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-01-25 06:15:51,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:15:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2018-01-25 06:15:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 06:15:51,747 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:51,747 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:51,747 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:51,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1462598725, now seen corresponding path program 1 times [2018-01-25 06:15:51,747 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:51,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:51,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:51,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:51,748 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:51,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:51,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:51,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:15:51,887 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:51,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:15:51,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:15:51,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:15:51,888 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2018-01-25 06:15:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:52,278 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2018-01-25 06:15:52,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:15:52,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-25 06:15:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:52,279 INFO L225 Difference]: With dead ends: 193 [2018-01-25 06:15:52,280 INFO L226 Difference]: Without dead ends: 186 [2018-01-25 06:15:52,280 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:15:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-25 06:15:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 80. [2018-01-25 06:15:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-25 06:15:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-01-25 06:15:52,289 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 23 [2018-01-25 06:15:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:52,290 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-01-25 06:15:52,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:15:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-01-25 06:15:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 06:15:52,291 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:52,291 INFO L322 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] [2018-01-25 06:15:52,291 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:52,292 INFO L82 PathProgramCache]: Analyzing trace with hash 919312261, now seen corresponding path program 1 times [2018-01-25 06:15:52,292 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:52,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:52,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:52,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:52,293 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:52,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:52,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:52,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:15:52,356 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:52,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:15:52,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:15:52,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:15:52,357 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 6 states. [2018-01-25 06:15:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:52,505 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2018-01-25 06:15:52,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:15:52,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 06:15:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:52,506 INFO L225 Difference]: With dead ends: 160 [2018-01-25 06:15:52,506 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 06:15:52,507 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:15:52,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 06:15:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 91. [2018-01-25 06:15:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-25 06:15:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-01-25 06:15:52,515 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2018-01-25 06:15:52,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:52,515 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-01-25 06:15:52,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:15:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-01-25 06:15:52,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:15:52,516 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:52,516 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:52,517 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:52,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1842256062, now seen corresponding path program 1 times [2018-01-25 06:15:52,517 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:52,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:52,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:52,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:52,518 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:52,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:52,585 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-25 06:15:52,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:52,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:15:52,585 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:52,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:15:52,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:15:52,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:15:52,587 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 7 states. [2018-01-25 06:15:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:52,744 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-01-25 06:15:52,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:15:52,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 06:15:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:52,745 INFO L225 Difference]: With dead ends: 127 [2018-01-25 06:15:52,745 INFO L226 Difference]: Without dead ends: 125 [2018-01-25 06:15:52,746 INFO L525 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-01-25 06:15:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-25 06:15:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2018-01-25 06:15:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-25 06:15:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-01-25 06:15:52,755 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 26 [2018-01-25 06:15:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:52,755 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-01-25 06:15:52,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:15:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-01-25 06:15:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:15:52,756 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:52,757 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:52,757 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:52,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1842256063, now seen corresponding path program 1 times [2018-01-25 06:15:52,757 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:52,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:52,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:52,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:52,758 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:52,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:52,885 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-25 06:15:52,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:52,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:15:52,886 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:52,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:15:52,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:15:52,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:15:52,887 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-01-25 06:15:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:53,070 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2018-01-25 06:15:53,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:15:53,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 06:15:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:53,071 INFO L225 Difference]: With dead ends: 124 [2018-01-25 06:15:53,071 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 06:15:53,072 INFO L525 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-01-25 06:15:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 06:15:53,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 75. [2018-01-25 06:15:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 06:15:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-01-25 06:15:53,076 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 26 [2018-01-25 06:15:53,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:53,077 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-01-25 06:15:53,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:15:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-01-25 06:15:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:15:53,078 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:53,078 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:53,078 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:53,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1313779944, now seen corresponding path program 1 times [2018-01-25 06:15:53,078 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:53,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:53,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:53,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:53,079 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 06:15:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 06:15:53,123 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 06:15:53,135 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-25 06:15:53,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:15:53 BoogieIcfgContainer [2018-01-25 06:15:53,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:15:53,149 INFO L168 Benchmark]: Toolchain (without parser) took 3565.10 ms. Allocated memory was 298.3 MB in the beginning and 506.5 MB in the end (delta: 208.1 MB). Free memory was 258.4 MB in the beginning and 442.6 MB in the end (delta: -184.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-01-25 06:15:53,150 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 298.3 MB. Free memory is still 264.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:15:53,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.98 ms. Allocated memory is still 298.3 MB. Free memory was 257.4 MB in the beginning and 246.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:15:53,150 INFO L168 Benchmark]: Boogie Preprocessor took 39.13 ms. Allocated memory is still 298.3 MB. Free memory was 246.3 MB in the beginning and 245.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-25 06:15:53,151 INFO L168 Benchmark]: RCFGBuilder took 358.88 ms. Allocated memory is still 298.3 MB. Free memory was 245.3 MB in the beginning and 221.4 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-01-25 06:15:53,151 INFO L168 Benchmark]: TraceAbstraction took 2942.13 ms. Allocated memory was 298.3 MB in the beginning and 506.5 MB in the end (delta: 208.1 MB). Free memory was 221.4 MB in the beginning and 442.6 MB in the end (delta: -221.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:15:53,152 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 298.3 MB. Free memory is still 264.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.98 ms. Allocated memory is still 298.3 MB. Free memory was 257.4 MB in the beginning and 246.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.13 ms. Allocated memory is still 298.3 MB. Free memory was 246.3 MB in the beginning and 245.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 358.88 ms. Allocated memory is still 298.3 MB. Free memory was 245.3 MB in the beginning and 221.4 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2942.13 ms. Allocated memory was 298.3 MB in the beginning and 506.5 MB in the end (delta: 208.1 MB). Free memory was 221.4 MB in the beginning and 442.6 MB in the end (delta: -221.2 MB). There was no memory consumed. 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))={10:0}] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L628] COND FALSE !(a == 0) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L629] List t; [L630] List p = a; VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L646] p = a VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L647] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L647] COND FALSE !(p->h == 1) [L649] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L649] COND FALSE !(p->h == 2) [L651] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L651] COND FALSE !(p->h != 3) [L653] return 0; VAL [\result=0, a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 81 locations, 25 error locations. UNSAFE Result, 2.8s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 984 SDslu, 997 SDs, 0 SdLazy, 1156 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=4, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 337 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 11512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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/list_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-15-53-157.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-15-53-157.csv Received shutdown request...