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/mempurity-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:57:35,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:57:35,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:57:35,469 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:57:35,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:57:35,470 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:57:35,471 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:57:35,473 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:57:35,475 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:57:35,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:57:35,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:57:35,477 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:57:35,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:57:35,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:57:35,480 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:57:35,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:57:35,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:57:35,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:57:35,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:57:35,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:57:35,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:57:35,491 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:57:35,491 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:57:35,492 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:57:35,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:57:35,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:57:35,495 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:57:35,495 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:57:35,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:57:35,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:57:35,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:57:35,496 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-20 23:57:35,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:57:35,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:57:35,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:57:35,507 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:57:35,507 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:57:35,508 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:57:35,508 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:57:35,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:57:35,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:57:35,509 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:57:35,509 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:57:35,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:57:35,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:57:35,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:57:35,510 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:57:35,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:57:35,510 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:57:35,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:57:35,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:57:35,510 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:57:35,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:57:35,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:57:35,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:57:35,511 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:57:35,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:57:35,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:57:35,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:57:35,512 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:57:35,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:57:35,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:57:35,513 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:57:35,513 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:57:35,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:57:35,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:57:35,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:57:35,514 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:57:35,514 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:57:35,515 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:57:35,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:57:35,561 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:57:35,564 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:57:35,566 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:57:35,566 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:57:35,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_false-valid-memtrack_true-termination.i [2018-01-20 23:57:35,781 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:57:35,786 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:57:35,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:57:35,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:57:35,792 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:57:35,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:57:35" (1/1) ... [2018-01-20 23:57:35,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4b3da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:57:35, skipping insertion in model container [2018-01-20 23:57:35,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:57:35" (1/1) ... [2018-01-20 23:57:35,818 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:57:35,870 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:57:35,980 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:57:35,996 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:57:36,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:57:36 WrapperNode [2018-01-20 23:57:36,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:57:36,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:57:36,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:57:36,005 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:57:36,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:57:36" (1/1) ... [2018-01-20 23:57:36,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:57:36" (1/1) ... [2018-01-20 23:57:36,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:57:36" (1/1) ... [2018-01-20 23:57:36,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:57:36" (1/1) ... [2018-01-20 23:57:36,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:57:36" (1/1) ... [2018-01-20 23:57:36,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:57:36" (1/1) ... [2018-01-20 23:57:36,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:57:36" (1/1) ... [2018-01-20 23:57:36,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:57:36,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:57:36,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:57:36,040 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:57:36,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:57:36" (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-20 23:57:36,089 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:57:36,089 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:57:36,089 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-20 23:57:36,089 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_10 [2018-01-20 23:57:36,089 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-20 23:57:36,089 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:57:36,089 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 23:57:36,089 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 23:57:36,090 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:57:36,090 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:57:36,090 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:57:36,090 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:57:36,090 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:57:36,090 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:57:36,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-20 23:57:36,090 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_10 [2018-01-20 23:57:36,091 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-20 23:57:36,091 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:57:36,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:57:36,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:57:36,312 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:57:36,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:57:36 BoogieIcfgContainer [2018-01-20 23:57:36,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:57:36,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:57:36,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:57:36,315 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:57:36,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:57:35" (1/3) ... [2018-01-20 23:57:36,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b14da15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:57:36, skipping insertion in model container [2018-01-20 23:57:36,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:57:36" (2/3) ... [2018-01-20 23:57:36,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b14da15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:57:36, skipping insertion in model container [2018-01-20 23:57:36,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:57:36" (3/3) ... [2018-01-20 23:57:36,318 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test10_false-valid-memtrack_true-termination.i [2018-01-20 23:57:36,325 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:57:36,331 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-20 23:57:36,375 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:57:36,375 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:57:36,375 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:57:36,375 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:57:36,375 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:57:36,375 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:57:36,376 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:57:36,376 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_10Err0EnsuresViolation======== [2018-01-20 23:57:36,377 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:57:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 23:57:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-20 23:57:36,405 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:57:36,406 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-01-20 23:57:36,406 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_10Err0EnsuresViolation]=== [2018-01-20 23:57:36,410 INFO L82 PathProgramCache]: Analyzing trace with hash 380727270, now seen corresponding path program 1 times [2018-01-20 23:57:36,412 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:57:36,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:36,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:57:36,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:36,459 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:57:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:57:36,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:57:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-20 23:57:36,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:57:36,719 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:57:36,720 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-01-20 23:57:36,722 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [4], [5], [7], [11], [17], [18], [20], [21], [28], [32], [34], [35], [36], [41], [42], [44], [45], [46], [47], [52], [66], [67], [68], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80] [2018-01-20 23:57:36,851 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:57:36,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:57:36,973 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-20 23:57:36,974 INFO L268 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-20 23:57:36,991 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-20 23:57:37,094 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 55.83% of their original sizes. [2018-01-20 23:57:37,094 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-20 23:57:37,205 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-20 23:57:37,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 23:57:37,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 13 [2018-01-20 23:57:37,207 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:57:37,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 23:57:37,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 23:57:37,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-20 23:57:37,218 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 10 states. [2018-01-20 23:57:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:57:38,921 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2018-01-20 23:57:38,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 23:57:38,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-20 23:57:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:57:38,930 INFO L225 Difference]: With dead ends: 109 [2018-01-20 23:57:38,930 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:57:38,934 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-01-20 23:57:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:57:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:57:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:57:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:57:38,963 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-01-20 23:57:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:57:38,964 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:57:38,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 23:57:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:57:38,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:57:38,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 23:57:39,170 INFO L401 ceAbstractionStarter]: For program point L1447''''(line 1447) no Hoare annotation was computed. [2018-01-20 23:57:39,171 INFO L401 ceAbstractionStarter]: For program point L1447(line 1447) no Hoare annotation was computed. [2018-01-20 23:57:39,171 INFO L397 ceAbstractionStarter]: At program point alloc_10ENTRY(lines 1446 1448) the Hoare annotation is: (or (not (= 0 (select |old(#valid)| 0))) (= |#valid| |old(#valid)|)) [2018-01-20 23:57:39,171 INFO L401 ceAbstractionStarter]: For program point alloc_10FINAL(lines 1446 1448) no Hoare annotation was computed. [2018-01-20 23:57:39,172 INFO L401 ceAbstractionStarter]: For program point alloc_10Err0EnsuresViolation(lines 1446 1448) no Hoare annotation was computed. [2018-01-20 23:57:39,172 INFO L401 ceAbstractionStarter]: For program point L1447'''(line 1447) no Hoare annotation was computed. [2018-01-20 23:57:39,172 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-20 23:57:39,172 INFO L397 ceAbstractionStarter]: At program point L1447''(line 1447) the Hoare annotation is: (or (not (= 0 (select |old(#valid)| 0))) (= |#valid| |old(#valid)|)) [2018-01-20 23:57:39,172 INFO L401 ceAbstractionStarter]: For program point alloc_10EXIT(lines 1446 1448) no Hoare annotation was computed. [2018-01-20 23:57:39,172 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (or (= |#valid| |old(#valid)|) (not (= 0 (select |old(#valid)| 0))) (not (= 4 |ldv_malloc_#in~size|))) [2018-01-20 23:57:39,173 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-20 23:57:39,173 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-20 23:57:39,173 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:57:39,173 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:57:39,173 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:57:39,173 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-20 23:57:39,173 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1474) no Hoare annotation was computed. [2018-01-20 23:57:39,173 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1474) no Hoare annotation was computed. [2018-01-20 23:57:39,174 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1474) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 23:57:39,174 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1474) no Hoare annotation was computed. [2018-01-20 23:57:39,174 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1474) the Hoare annotation is: true [2018-01-20 23:57:39,175 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1474) no Hoare annotation was computed. [2018-01-20 23:57:39,175 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1474) the Hoare annotation is: (= 0 (select |#valid| 0)) [2018-01-20 23:57:39,175 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1474) no Hoare annotation was computed. [2018-01-20 23:57:39,175 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1474) no Hoare annotation was computed. [2018-01-20 23:57:39,175 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1472 1474) the Hoare annotation is: (or (not (= 0 (select |old(#valid)| 0))) (= |#valid| |old(#valid)|)) [2018-01-20 23:57:39,175 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1472 1474) no Hoare annotation was computed. [2018-01-20 23:57:39,175 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1472 1474) no Hoare annotation was computed. [2018-01-20 23:57:39,175 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1472 1474) no Hoare annotation was computed. [2018-01-20 23:57:39,176 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-20 23:57:39,176 INFO L401 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-01-20 23:57:39,176 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1454 1470) no Hoare annotation was computed. [2018-01-20 23:57:39,176 INFO L401 ceAbstractionStarter]: For program point L1467'(line 1467) no Hoare annotation was computed. [2018-01-20 23:57:39,176 INFO L401 ceAbstractionStarter]: For program point L1457'(line 1457) no Hoare annotation was computed. [2018-01-20 23:57:39,176 INFO L397 ceAbstractionStarter]: At program point L1459'(line 1459) the Hoare annotation is: (or (not (= 0 (select |old(#valid)| 0))) (= |#valid| |old(#valid)|)) [2018-01-20 23:57:39,176 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1454 1470) the Hoare annotation is: (or (not (= 0 (select |old(#valid)| 0))) (= |#valid| |old(#valid)|)) [2018-01-20 23:57:39,177 INFO L401 ceAbstractionStarter]: For program point L1458(line 1458) no Hoare annotation was computed. [2018-01-20 23:57:39,177 INFO L401 ceAbstractionStarter]: For program point L1459(line 1459) no Hoare annotation was computed. [2018-01-20 23:57:39,177 INFO L401 ceAbstractionStarter]: For program point L1456(line 1456) no Hoare annotation was computed. [2018-01-20 23:57:39,177 INFO L397 ceAbstractionStarter]: At program point L1457(line 1457) the Hoare annotation is: (or (not (= 0 (select |old(#valid)| 0))) (= |#valid| |old(#valid)|)) [2018-01-20 23:57:39,177 INFO L401 ceAbstractionStarter]: For program point L1457''(line 1457) no Hoare annotation was computed. [2018-01-20 23:57:39,177 INFO L401 ceAbstractionStarter]: For program point L1459''(line 1459) no Hoare annotation was computed. [2018-01-20 23:57:39,177 INFO L401 ceAbstractionStarter]: For program point L1465''(line 1465) no Hoare annotation was computed. [2018-01-20 23:57:39,178 INFO L401 ceAbstractionStarter]: For program point L1460''(line 1460) no Hoare annotation was computed. [2018-01-20 23:57:39,178 INFO L401 ceAbstractionStarter]: For program point L1460'(line 1460) no Hoare annotation was computed. [2018-01-20 23:57:39,178 INFO L401 ceAbstractionStarter]: For program point L1462'(line 1462) no Hoare annotation was computed. [2018-01-20 23:57:39,178 INFO L401 ceAbstractionStarter]: For program point L1465(line 1465) no Hoare annotation was computed. [2018-01-20 23:57:39,178 INFO L397 ceAbstractionStarter]: At program point L1466(lines 1466 1467) the Hoare annotation is: (or (not (= 0 (select |old(#valid)| 0))) (= 0 (select |#valid| 0))) [2018-01-20 23:57:39,178 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1454 1470) no Hoare annotation was computed. [2018-01-20 23:57:39,178 INFO L397 ceAbstractionStarter]: At program point L1462(line 1462) the Hoare annotation is: (or (not (= 0 (select |old(#valid)| 0))) (= |#valid| |old(#valid)|)) [2018-01-20 23:57:39,179 INFO L401 ceAbstractionStarter]: For program point L1458'(line 1458) no Hoare annotation was computed. [2018-01-20 23:57:39,179 INFO L401 ceAbstractionStarter]: For program point L1460(line 1460) no Hoare annotation was computed. [2018-01-20 23:57:39,179 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1454 1470) no Hoare annotation was computed. [2018-01-20 23:57:39,179 INFO L401 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2018-01-20 23:57:39,179 INFO L397 ceAbstractionStarter]: At program point L1468(lines 1468 1469) the Hoare annotation is: (or (not (= 0 (select |old(#valid)| 0))) (= 0 (select |#valid| 0))) [2018-01-20 23:57:39,179 INFO L401 ceAbstractionStarter]: For program point L1459'''(line 1459) no Hoare annotation was computed. [2018-01-20 23:57:39,182 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:57:39,182 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:57:39,182 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:57:39,182 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:57:39,182 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:57:39,183 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:57:39,183 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:57:39,183 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-20 23:57:39,183 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:57:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 23:57:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-20 23:57:39,185 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:57:39,185 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:57:39,185 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:57:39,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1503501184, now seen corresponding path program 1 times [2018-01-20 23:57:39,186 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:57:39,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:57:39,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,188 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:57:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:57:39,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:57:39,225 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-20 23:57:39,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:57:39,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:57:39,226 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:57:39,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:57:39,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:57:39,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:57:39,230 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-01-20 23:57:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:57:39,333 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-01-20 23:57:39,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:57:39,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-20 23:57:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:57:39,337 INFO L225 Difference]: With dead ends: 63 [2018-01-20 23:57:39,337 INFO L226 Difference]: Without dead ends: 34 [2018-01-20 23:57:39,338 INFO L525 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-20 23:57:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-20 23:57:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-20 23:57:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-20 23:57:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-01-20 23:57:39,355 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 10 [2018-01-20 23:57:39,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:57:39,355 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-01-20 23:57:39,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:57:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-01-20 23:57:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-20 23:57:39,357 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:57:39,357 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:57:39,357 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:57:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1755719070, now seen corresponding path program 1 times [2018-01-20 23:57:39,357 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:57:39,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:57:39,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,359 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:57:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:57:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:57:39,411 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:57:39,418 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:57:39,420 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:57:39,430 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:57:39,431 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:57:39,431 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:57:39,431 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:57:39,431 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:57:39,431 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:57:39,431 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:57:39,431 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:57:39,431 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:57:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 23:57:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:57:39,433 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:57:39,433 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:57:39,433 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:57:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash 97703, now seen corresponding path program 1 times [2018-01-20 23:57:39,434 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:57:39,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:57:39,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,436 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:57:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:57:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:57:39,443 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:57:39,444 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:57:39,446 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:57:39,446 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:57:39,446 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:57:39,446 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:57:39,447 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:57:39,447 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:57:39,447 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:57:39,447 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:57:39,447 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:57:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 23:57:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 23:57:39,449 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:57:39,450 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:57:39,450 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:57:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash -563889722, now seen corresponding path program 1 times [2018-01-20 23:57:39,450 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:57:39,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:57:39,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,452 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:57:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:57:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:57:39,475 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:57:39,477 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:57:39,478 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:57:39,478 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:57:39,479 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:57:39,479 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:57:39,481 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:57:39,481 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:57:39,481 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:57:39,482 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:57:39,482 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:57:39,482 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:57:39,482 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:57:39,482 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:57:39,482 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:57:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 23:57:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-20 23:57:39,484 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:57:39,484 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:57:39,485 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:57:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2083266026, now seen corresponding path program 1 times [2018-01-20 23:57:39,485 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:57:39,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:57:39,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,487 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:57:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:57:39,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:57:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:57:39,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:57:39,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:57:39,537 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:57:39,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:57:39,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:57:39,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:57:39,538 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-01-20 23:57:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:57:39,605 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-01-20 23:57:39,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:57:39,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-20 23:57:39,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:57:39,606 INFO L225 Difference]: With dead ends: 63 [2018-01-20 23:57:39,606 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:57:39,607 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-20 23:57:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:57:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:57:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:57:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:57:39,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-01-20 23:57:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:57:39,608 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:57:39,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:57:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:57:39,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:57:39,610 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:57:39,610 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:57:39,610 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:57:39,610 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:57:39,610 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:57:39,610 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:57:39,610 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:57:39,610 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-20 23:57:39,610 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:57:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 23:57:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-20 23:57:39,612 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:57:39,613 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:57:39,613 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 23:57:39,613 INFO L82 PathProgramCache]: Analyzing trace with hash 766546418, now seen corresponding path program 1 times [2018-01-20 23:57:39,613 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:57:39,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:57:39,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,615 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:57:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:57:39,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:57:39,649 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-20 23:57:39,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:57:39,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:57:39,650 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:57:39,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:57:39,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:57:39,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:57:39,651 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-01-20 23:57:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:57:39,748 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-01-20 23:57:39,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:57:39,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-20 23:57:39,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:57:39,750 INFO L225 Difference]: With dead ends: 63 [2018-01-20 23:57:39,750 INFO L226 Difference]: Without dead ends: 50 [2018-01-20 23:57:39,751 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-20 23:57:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-20 23:57:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-01-20 23:57:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-20 23:57:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-01-20 23:57:39,759 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 14 [2018-01-20 23:57:39,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:57:39,760 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-01-20 23:57:39,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:57:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-01-20 23:57:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 23:57:39,761 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:57:39,762 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, 1] [2018-01-20 23:57:39,762 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 23:57:39,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1399900195, now seen corresponding path program 1 times [2018-01-20 23:57:39,762 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:57:39,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:57:39,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:39,764 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:57:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:57:39,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:57:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 23:57:39,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:57:39,824 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:57:39,824 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-20 23:57:39,824 INFO L201 CegarAbsIntRunner]: [11], [17], [18], [20], [21], [28], [32], [34], [35], [36], [39], [63], [65], [68], [70], [71], [72], [74], [75], [76], [77] [2018-01-20 23:57:39,826 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:57:39,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:57:39,859 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-20 23:57:39,860 INFO L268 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Never found a fixpoint. Largest state had 18 variables. [2018-01-20 23:57:39,861 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-20 23:57:39,903 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 55.83% of their original sizes. [2018-01-20 23:57:39,903 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-20 23:57:39,977 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-20 23:57:39,977 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 23:57:39,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 13 [2018-01-20 23:57:39,977 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:57:39,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 23:57:39,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 23:57:39,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-20 23:57:39,978 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 10 states. [2018-01-20 23:57:40,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:57:40,806 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2018-01-20 23:57:40,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 23:57:40,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-01-20 23:57:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:57:40,809 INFO L225 Difference]: With dead ends: 90 [2018-01-20 23:57:40,809 INFO L226 Difference]: Without dead ends: 51 [2018-01-20 23:57:40,810 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-01-20 23:57:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-20 23:57:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-01-20 23:57:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-20 23:57:40,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-01-20 23:57:40,827 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 24 [2018-01-20 23:57:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:57:40,827 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-01-20 23:57:40,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 23:57:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-01-20 23:57:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 23:57:40,828 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:57:40,828 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-20 23:57:40,828 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 23:57:40,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1667975813, now seen corresponding path program 1 times [2018-01-20 23:57:40,829 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:57:40,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:40,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:57:40,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:57:40,830 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:57:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:57:40,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:57:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:57:40,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:57:40,868 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:57:40,869 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-20 23:57:40,869 INFO L201 CegarAbsIntRunner]: [11], [14], [15], [16], [17], [18], [20], [21], [28], [32], [34], [35], [36], [39], [63], [65], [68], [70], [71], [72], [74], [75], [76], [77] [2018-01-20 23:57:40,870 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:57:40,870 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:57:40,923 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-20 23:57:40,923 INFO L268 AbstractInterpreter]: Visited 16 different actions 17 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-20 23:57:40,926 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-20 23:57:40,998 INFO L232 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 60.15% of their original sizes. [2018-01-20 23:57:40,999 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-20 23:57:41,131 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-20 23:57:41,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 23:57:41,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 15 [2018-01-20 23:57:41,132 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:57:41,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-20 23:57:41,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-20 23:57:41,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-01-20 23:57:41,133 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 13 states. [2018-01-20 23:57:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 23:57:41,582 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCongruenceClosure.(WeqCongruenceClosure.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.copyWeqCc(WeqCcManager.java:1327) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.isStrongerThan(WeqCcManager.java:582) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.isStrongerThan(EqConstraint.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.isSubsetOf(EqState.java:192) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.isSubsetOf(EqState.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.getMaximalElements(DisjunctiveAbstractState.java:564) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.crossProduct(DisjunctiveAbstractState.java:407) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.intersect(DisjunctiveAbstractState.java:291) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntPredicateUnifier.lambda$3(CegarAbsIntRunner.java:684) at java.util.stream.ReduceOps$2ReducingSink.accept(ReduceOps.java:123) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.reduce(ReferencePipeline.java:479) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntPredicateUnifier.getOrConstructPredicateForConjunction(CegarAbsIntRunner.java:684) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1054) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:956) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:185) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:552) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:522) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-20 23:57:41,585 INFO L168 Benchmark]: Toolchain (without parser) took 5803.83 ms. Allocated memory was 306.2 MB in the beginning and 564.7 MB in the end (delta: 258.5 MB). Free memory was 263.5 MB in the beginning and 350.2 MB in the end (delta: -86.7 MB). Peak memory consumption was 171.8 MB. Max. memory is 5.3 GB. [2018-01-20 23:57:41,586 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:57:41,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.36 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 250.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:57:41,586 INFO L168 Benchmark]: Boogie Preprocessor took 34.94 ms. Allocated memory is still 306.2 MB. Free memory was 250.5 MB in the beginning and 248.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:57:41,587 INFO L168 Benchmark]: RCFGBuilder took 272.54 ms. Allocated memory is still 306.2 MB. Free memory was 248.6 MB in the beginning and 228.9 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-20 23:57:41,587 INFO L168 Benchmark]: TraceAbstraction took 5271.11 ms. Allocated memory was 306.2 MB in the beginning and 564.7 MB in the end (delta: 258.5 MB). Free memory was 228.9 MB in the beginning and 350.2 MB in the end (delta: -121.3 MB). Peak memory consumption was 137.2 MB. Max. memory is 5.3 GB. [2018-01-20 23:57:41,589 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.36 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 250.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.94 ms. Allocated memory is still 306.2 MB. Free memory was 250.5 MB in the beginning and 248.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 272.54 ms. Allocated memory is still 306.2 MB. Free memory was 248.6 MB in the beginning and 228.9 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5271.11 ms. Allocated memory was 306.2 MB in the beginning and 564.7 MB in the end (delta: 258.5 MB). Free memory was 228.9 MB in the beginning and 350.2 MB in the end (delta: -121.3 MB). Peak memory consumption was 137.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 12 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 62 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -24 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 21 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 34 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 22 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.678586 RENAME_VARIABLES(MILLISECONDS) : 0.146687 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.250349 PROJECTAWAY(MILLISECONDS) : 0.020000 ADD_WEAK_EQUALITY(MILLISECONDS) : 3.223014 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.182357 ADD_EQUALITY(MILLISECONDS) : 0.029876 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012273 #CONJOIN_DISJUNCTIVE : 24 #RENAME_VARIABLES : 41 #UNFREEZE : 0 #CONJOIN : 50 #PROJECTAWAY : 42 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 40 #ADD_EQUALITY : 34 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 12 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 62 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -24 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 21 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 34 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 22 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.361352 RENAME_VARIABLES(MILLISECONDS) : 0.064322 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.122132 PROJECTAWAY(MILLISECONDS) : 0.014740 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.414209 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.085057 ADD_EQUALITY(MILLISECONDS) : 0.018104 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008696 #CONJOIN_DISJUNCTIVE : 24 #RENAME_VARIABLES : 41 #UNFREEZE : 0 #CONJOIN : 50 #PROJECTAWAY : 42 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 40 #ADD_EQUALITY : 34 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 14 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 81 LocStat_NO_SUPPORTING_DISEQUALITIES : 2 LocStat_NO_DISJUNCTIONS : -28 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 46 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.252756 RENAME_VARIABLES(MILLISECONDS) : 0.048367 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.077811 PROJECTAWAY(MILLISECONDS) : 0.011710 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.059974 DISJOIN(MILLISECONDS) : 3.254823 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.068797 ADD_EQUALITY(MILLISECONDS) : 0.015119 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007184 #CONJOIN_DISJUNCTIVE : 33 #RENAME_VARIABLES : 51 #UNFREEZE : 0 #CONJOIN : 66 #PROJECTAWAY : 49 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 50 #ADD_EQUALITY : 46 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1446]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: alloc_10Err0EnsuresViolation CFG has 6 procedures, 56 locations, 6 error locations. SAFE Result, 2.8s OverallTime, 1 OverallIterations, 4 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 96 SDslu, 104 SDs, 0 SdLazy, 51 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9696158008658007 AbsIntWeakeningRatio, 1.3181818181818181 AbsIntAvgWeakeningVarsNumRemoved, 0.7727272727272727 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 21 PreInvPairs, 28 NumberOfFragments, 117 HoareAnnotationTreeSize, 21 FomulaSimplifications, 20 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 51 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 2992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 0 PerfectInterpolantSequences, 18/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1473] CALL entry_point() [L1455] CALL ldv_malloc(sizeof(struct A10)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={6:0}, size=4] [L1074] return malloc(size); VAL [\old(size)=4, \result={6:0}, malloc(size)={6:0}, size=4] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 6 procedures, 56 locations, 6 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 45 SDtfs, 28 SDslu, 4 SDs, 0 SdLazy, 26 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 6 procedures, 56 locations, 6 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) VAL [\old(size)=4] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=4, \result={0:0}, size=4] [L1455] EXPR ldv_malloc(sizeof(struct A10)) VAL [ldv_malloc(sizeof(struct A10))={0:0}] [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND TRUE, RET !a10 VAL [a10={0:0}] [L1473] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 6 procedures, 56 locations, 6 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1472]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 6 procedures, 56 locations, 6 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 45 SDtfs, 24 SDslu, 4 SDs, 0 SdLazy, 26 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCongruenceClosure.(WeqCongruenceClosure.java:157) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-57-41-604.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-20_23-57-41-604.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-20_23-57-41-604.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-20_23-57-41-604.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-20_23-57-41-604.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-20_23-57-41-604.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-20_23-57-41-604.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-57-41-604.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-57-41-604.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-57-41-604.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-57-41-604.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_23-57-41-604.csv Received shutdown request...