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_mostprecise.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 03:10:14,358 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 03:10:14,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 03:10:14,383 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 03:10:14,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 03:10:14,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 03:10:14,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 03:10:14,391 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 03:10:14,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 03:10:14,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 03:10:14,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 03:10:14,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 03:10:14,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 03:10:14,403 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 03:10:14,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 03:10:14,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 03:10:14,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 03:10:14,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 03:10:14,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 03:10:14,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 03:10:14,417 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 03:10:14,417 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 03:10:14,418 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 03:10:14,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 03:10:14,420 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 03:10:14,422 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 03:10:14,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 03:10:14,423 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 03:10:14,423 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 03:10:14,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 03:10:14,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 03:10:14,431 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_mostprecise.epf [2018-01-21 03:10:14,450 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 03:10:14,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 03:10:14,451 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 03:10:14,451 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 03:10:14,451 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 03:10:14,452 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 03:10:14,452 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 03:10:14,452 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 03:10:14,452 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 03:10:14,453 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 03:10:14,453 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 03:10:14,453 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 03:10:14,454 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 03:10:14,454 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 03:10:14,454 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 03:10:14,454 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 03:10:14,454 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 03:10:14,455 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 03:10:14,455 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 03:10:14,455 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 03:10:14,455 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 03:10:14,455 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 03:10:14,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 03:10:14,456 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 03:10:14,456 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 03:10:14,456 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 03:10:14,456 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 03:10:14,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 03:10:14,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 03:10:14,457 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 03:10:14,457 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 03:10:14,457 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 03:10:14,458 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 03:10:14,458 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 03:10:14,458 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 03:10:14,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 03:10:14,458 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 03:10:14,458 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 03:10:14,459 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 03:10:14,460 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 03:10:14,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 03:10:14,542 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 03:10:14,548 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 03:10:14,550 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 03:10:14,551 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 03:10:14,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i [2018-01-21 03:10:14,855 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 03:10:14,862 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 03:10:14,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 03:10:14,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 03:10:14,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 03:10:14,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:10:14" (1/1) ... [2018-01-21 03:10:14,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@353cb897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:10:14, skipping insertion in model container [2018-01-21 03:10:14,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:10:14" (1/1) ... [2018-01-21 03:10:14,903 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:10:14,969 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:10:15,189 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:10:15,224 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:10:15,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:10:15 WrapperNode [2018-01-21 03:10:15,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 03:10:15,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 03:10:15,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 03:10:15,235 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 03:10:15,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:10:15" (1/1) ... [2018-01-21 03:10:15,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:10:15" (1/1) ... [2018-01-21 03:10:15,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:10:15" (1/1) ... [2018-01-21 03:10:15,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:10:15" (1/1) ... [2018-01-21 03:10:15,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:10:15" (1/1) ... [2018-01-21 03:10:15,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:10:15" (1/1) ... [2018-01-21 03:10:15,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:10:15" (1/1) ... [2018-01-21 03:10:15,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 03:10:15,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 03:10:15,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 03:10:15,273 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 03:10:15,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:10:15" (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-21 03:10:15,337 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 03:10:15,337 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 03:10:15,337 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-21 03:10:15,337 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-21 03:10:15,337 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-21 03:10:15,337 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 03:10:15,337 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 03:10:15,337 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 03:10:15,338 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 03:10:15,338 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 03:10:15,338 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 03:10:15,338 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 03:10:15,338 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 03:10:15,338 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 03:10:15,338 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 03:10:15,339 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 03:10:15,339 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-21 03:10:15,339 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-21 03:10:15,339 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-21 03:10:15,339 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 03:10:15,340 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 03:10:15,340 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 03:10:15,745 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 03:10:15,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:10:15 BoogieIcfgContainer [2018-01-21 03:10:15,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 03:10:15,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 03:10:15,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 03:10:15,753 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 03:10:15,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 03:10:14" (1/3) ... [2018-01-21 03:10:15,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67430701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:10:15, skipping insertion in model container [2018-01-21 03:10:15,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:10:15" (2/3) ... [2018-01-21 03:10:15,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67430701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:10:15, skipping insertion in model container [2018-01-21 03:10:15,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:10:15" (3/3) ... [2018-01-21 03:10:15,757 INFO L105 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_true-valid-memsafety.i [2018-01-21 03:10:15,768 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 03:10:15,777 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-21 03:10:15,822 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:10:15,822 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:10:15,822 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:10:15,822 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:10:15,823 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:10:15,823 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:10:15,823 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:10:15,824 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_dataErr0EnsuresViolation======== [2018-01-21 03:10:15,825 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:10:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-21 03:10:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 03:10:15,861 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:10:15,863 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:10:15,863 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0EnsuresViolation]=== [2018-01-21 03:10:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash -870275047, now seen corresponding path program 1 times [2018-01-21 03:10:15,872 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:10:15,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:15,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:10:15,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:15,947 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:10:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:10:16,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:10:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:10:16,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:10:16,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:10:16,306 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:10:16,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:10:16,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:10:16,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:10:16,334 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-01-21 03:10:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:10:16,708 INFO L93 Difference]: Finished difference Result 158 states and 180 transitions. [2018-01-21 03:10:16,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:10:16,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-21 03:10:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:10:16,720 INFO L225 Difference]: With dead ends: 158 [2018-01-21 03:10:16,720 INFO L226 Difference]: Without dead ends: 47 [2018-01-21 03:10:16,723 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-21 03:10:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-21 03:10:16,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-21 03:10:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-21 03:10:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-21 03:10:16,758 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 20 [2018-01-21 03:10:16,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:10:16,758 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-21 03:10:16,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:10:16,759 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-21 03:10:16,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 03:10:16,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:10:16,760 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:10:16,760 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0EnsuresViolation]=== [2018-01-21 03:10:16,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2022582004, now seen corresponding path program 1 times [2018-01-21 03:10:16,761 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:10:16,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:16,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:10:16,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:16,763 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:10:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:10:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:10:16,914 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:10:16,927 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:10:16,931 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:10:16,946 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:10:16,946 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:10:16,946 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:10:16,946 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:10:16,947 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:10:16,947 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:10:16,947 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:10:16,947 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == freeDataErr0EnsuresViolation======== [2018-01-21 03:10:16,947 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:10:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-21 03:10:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 03:10:16,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:10:16,952 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:10:16,952 INFO L371 AbstractCegarLoop]: === Iteration 1 === [freeDataErr0EnsuresViolation]=== [2018-01-21 03:10:16,953 INFO L82 PathProgramCache]: Analyzing trace with hash 18446588, now seen corresponding path program 1 times [2018-01-21 03:10:16,953 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:10:16,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:16,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:10:16,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:16,955 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:10:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:10:16,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:10:16,995 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-21 03:10:16,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:10:16,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:10:16,995 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:10:16,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:10:16,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:10:16,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:10:16,996 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2018-01-21 03:10:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:10:17,005 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2018-01-21 03:10:17,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:10:17,006 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 03:10:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:10:17,007 INFO L225 Difference]: With dead ends: 155 [2018-01-21 03:10:17,008 INFO L226 Difference]: Without dead ends: 70 [2018-01-21 03:10:17,009 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:10:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-21 03:10:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-21 03:10:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-21 03:10:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-21 03:10:17,016 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 21 [2018-01-21 03:10:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:10:17,016 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-21 03:10:17,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:10:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-21 03:10:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 03:10:17,018 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:10:17,018 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:10:17,018 INFO L371 AbstractCegarLoop]: === Iteration 2 === [freeDataErr0EnsuresViolation]=== [2018-01-21 03:10:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1906944541, now seen corresponding path program 1 times [2018-01-21 03:10:17,018 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:10:17,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:10:17,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,019 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:10:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:10:17,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:10:17,128 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-21 03:10:17,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:10:17,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:10:17,129 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:10:17,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:10:17,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:10:17,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:10:17,130 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 3 states. [2018-01-21 03:10:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:10:17,220 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-01-21 03:10:17,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:10:17,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-01-21 03:10:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:10:17,223 INFO L225 Difference]: With dead ends: 74 [2018-01-21 03:10:17,224 INFO L226 Difference]: Without dead ends: 73 [2018-01-21 03:10:17,225 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-21 03:10:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-21 03:10:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-01-21 03:10:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-21 03:10:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-21 03:10:17,236 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 40 [2018-01-21 03:10:17,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:10:17,236 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-21 03:10:17,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:10:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-21 03:10:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-21 03:10:17,238 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:10:17,238 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:10:17,239 INFO L371 AbstractCegarLoop]: === Iteration 3 === [freeDataErr0EnsuresViolation]=== [2018-01-21 03:10:17,239 INFO L82 PathProgramCache]: Analyzing trace with hash 253062134, now seen corresponding path program 1 times [2018-01-21 03:10:17,239 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:10:17,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:10:17,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,241 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:10:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:10:17,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:10:17,395 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-21 03:10:17,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:10:17,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 03:10:17,395 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:10:17,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:10:17,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:10:17,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:10:17,397 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 4 states. [2018-01-21 03:10:17,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:10:17,463 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2018-01-21 03:10:17,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 03:10:17,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-01-21 03:10:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:10:17,465 INFO L225 Difference]: With dead ends: 110 [2018-01-21 03:10:17,465 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:10:17,466 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:10:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:10:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:10:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:10:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:10:17,467 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-01-21 03:10:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:10:17,468 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:10:17,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:10:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:10:17,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:10:17,472 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:10:17,472 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:10:17,473 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:10:17,473 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:10:17,473 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:10:17,473 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:10:17,473 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:10:17,473 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 03:10:17,473 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:10:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-21 03:10:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 03:10:17,476 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:10:17,476 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 03:10:17,476 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 03:10:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash 156161, now seen corresponding path program 1 times [2018-01-21 03:10:17,477 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:10:17,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:10:17,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,478 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:10:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:10:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:10:17,486 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:10:17,487 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:10:17,489 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:10:17,490 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:10:17,490 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:10:17,490 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:10:17,490 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:10:17,490 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:10:17,490 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:10:17,490 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 03:10:17,491 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:10:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-21 03:10:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-21 03:10:17,494 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:10:17,494 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:10:17,494 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:10:17,494 INFO L82 PathProgramCache]: Analyzing trace with hash 456996590, now seen corresponding path program 1 times [2018-01-21 03:10:17,495 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:10:17,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:10:17,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,496 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:10:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:10:17,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:10:17,512 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-21 03:10:17,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:10:17,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:10:17,513 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:10:17,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:10:17,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:10:17,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:10:17,515 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2018-01-21 03:10:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:10:17,534 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2018-01-21 03:10:17,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:10:17,534 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-21 03:10:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:10:17,536 INFO L225 Difference]: With dead ends: 155 [2018-01-21 03:10:17,536 INFO L226 Difference]: Without dead ends: 76 [2018-01-21 03:10:17,546 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:10:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-21 03:10:17,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-21 03:10:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-21 03:10:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-21 03:10:17,558 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 16 [2018-01-21 03:10:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:10:17,559 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-21 03:10:17,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:10:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-21 03:10:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 03:10:17,561 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:10:17,561 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:10:17,561 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:10:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash 943494876, now seen corresponding path program 1 times [2018-01-21 03:10:17,561 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:10:17,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:10:17,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,564 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:10:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:10:17,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:10:17,685 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-21 03:10:17,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:10:17,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 03:10:17,686 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:10:17,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:10:17,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:10:17,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:10:17,687 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 4 states. [2018-01-21 03:10:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:10:17,800 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-01-21 03:10:17,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 03:10:17,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-21 03:10:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:10:17,802 INFO L225 Difference]: With dead ends: 115 [2018-01-21 03:10:17,802 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:10:17,803 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:10:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:10:17,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:10:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:10:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:10:17,805 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-21 03:10:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:10:17,805 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:10:17,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:10:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:10:17,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:10:17,808 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:10:17,808 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:10:17,808 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:10:17,808 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:10:17,808 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:10:17,808 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:10:17,809 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:10:17,809 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 03:10:17,809 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:10:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-21 03:10:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 03:10:17,813 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:10:17,814 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:10:17,814 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 03:10:17,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1077569315, now seen corresponding path program 1 times [2018-01-21 03:10:17,814 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:10:17,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:10:17,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,816 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:10:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:10:17,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:10:17,831 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-21 03:10:17,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:10:17,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:10:17,832 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:10:17,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:10:17,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:10:17,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:10:17,833 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2018-01-21 03:10:17,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:10:17,841 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2018-01-21 03:10:17,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:10:17,842 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-21 03:10:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:10:17,843 INFO L225 Difference]: With dead ends: 155 [2018-01-21 03:10:17,844 INFO L226 Difference]: Without dead ends: 74 [2018-01-21 03:10:17,845 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:10:17,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-21 03:10:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-21 03:10:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-21 03:10:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-21 03:10:17,854 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 14 [2018-01-21 03:10:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:10:17,854 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-21 03:10:17,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:10:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-21 03:10:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 03:10:17,856 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:10:17,856 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:10:17,856 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 03:10:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash -137565551, now seen corresponding path program 1 times [2018-01-21 03:10:17,857 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:10:17,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:10:17,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:17,858 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:10:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:10:17,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:10:18,046 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-21 03:10:18,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:10:18,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 03:10:18,047 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:10:18,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:10:18,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:10:18,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:10:18,050 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2018-01-21 03:10:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:10:18,133 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-01-21 03:10:18,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 03:10:18,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-21 03:10:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:10:18,134 INFO L225 Difference]: With dead ends: 113 [2018-01-21 03:10:18,134 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:10:18,135 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:10:18,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:10:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:10:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:10:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:10:18,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-21 03:10:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:10:18,136 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:10:18,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:10:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:10:18,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:10:18,139 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:10:18,139 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:10:18,139 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:10:18,139 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:10:18,139 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:10:18,139 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:10:18,140 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:10:18,140 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-21 03:10:18,140 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:10:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-21 03:10:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 03:10:18,143 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:10:18,143 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:10:18,143 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-21 03:10:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1501116752, now seen corresponding path program 1 times [2018-01-21 03:10:18,143 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:10:18,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:18,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:10:18,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:10:18,145 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:10:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:10:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:10:18,200 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:10:18,205 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:10:18,207 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:10:18,209 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:10:18,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 03:10:18 BoogieIcfgContainer [2018-01-21 03:10:18,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 03:10:18,215 INFO L168 Benchmark]: Toolchain (without parser) took 3359.52 ms. Allocated memory was 300.9 MB in the beginning and 456.7 MB in the end (delta: 155.7 MB). Free memory was 258.1 MB in the beginning and 321.5 MB in the end (delta: -63.4 MB). Peak memory consumption was 92.3 MB. Max. memory is 5.3 GB. [2018-01-21 03:10:18,217 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 300.9 MB. Free memory is still 264.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:10:18,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.20 ms. Allocated memory is still 300.9 MB. Free memory was 258.1 MB in the beginning and 246.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:10:18,218 INFO L168 Benchmark]: Boogie Preprocessor took 37.97 ms. Allocated memory is still 300.9 MB. Free memory is still 246.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:10:18,218 INFO L168 Benchmark]: RCFGBuilder took 476.19 ms. Allocated memory is still 300.9 MB. Free memory was 246.1 MB in the beginning and 219.2 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. [2018-01-21 03:10:18,218 INFO L168 Benchmark]: TraceAbstraction took 2464.12 ms. Allocated memory was 300.9 MB in the beginning and 456.7 MB in the end (delta: 155.7 MB). Free memory was 219.2 MB in the beginning and 321.5 MB in the end (delta: -102.3 MB). Peak memory consumption was 53.4 MB. Max. memory is 5.3 GB. [2018-01-21 03:10:18,220 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.27 ms. Allocated memory is still 300.9 MB. Free memory is still 264.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 371.20 ms. Allocated memory is still 300.9 MB. Free memory was 258.1 MB in the beginning and 246.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.97 ms. Allocated memory is still 300.9 MB. Free memory is still 246.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 476.19 ms. Allocated memory is still 300.9 MB. Free memory was 246.1 MB in the beginning and 219.2 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2464.12 ms. Allocated memory was 300.9 MB in the beginning and 456.7 MB in the end (delta: 155.7 MB). Free memory was 219.2 MB in the beginning and 321.5 MB in the end (delta: -102.3 MB). Peak memory consumption was 53.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - 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: - CounterExampleResult [Line: 538]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L571] FCALL struct node_t *list = ((void *)0); VAL [list={15:0}] [L572] int dataNotFinished = 0; VAL [dataNotFinished=0, list={15:0}] [L574] CALL append(&list) VAL [pointerToList={15:0}] [L565] EXPR, FCALL malloc(sizeof *node) VAL [malloc(sizeof *node)={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L565] struct node_t *node = malloc(sizeof *node); VAL [malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L566] EXPR, FCALL \read(**pointerToList) VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L566] FCALL node->next = *pointerToList VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L567] CALL create_data() [L539] COND FALSE !(__VERIFIER_nondet_int()) [L542] EXPR, FCALL malloc(sizeof *data) VAL [malloc(sizeof *data)={13:0}] [L542] Data data = malloc(sizeof *data); [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] FCALL data->array = ((void *)0) VAL [data={13:0}, malloc(sizeof *data)={13:0}] [L552] FCALL data->number = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, data={13:0}, malloc(sizeof *data)={13:0}] [L553] return data; VAL [\result={13:0}, data={13:0}, malloc(sizeof *data)={13:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: create_dataErr0EnsuresViolation CFG has 6 procedures, 82 locations, 6 error locations. UNSAFE Result, 1.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 11 SDslu, 46 SDs, 0 SdLazy, 28 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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=82occurred 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.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 475 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 - PositiveResult [Line: 555]: 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: freeDataErr0EnsuresViolation CFG has 6 procedures, 82 locations, 6 error locations. SAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 193 SDtfs, 22 SDslu, 87 SDs, 0 SdLazy, 44 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 5557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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, 82 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=82occurred 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 - PositiveResult [Line: 1]: 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: ULTIMATE.startErr0EnsuresViolation CFG has 6 procedures, 82 locations, 6 error locations. SAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 11 SDslu, 44 SDs, 0 SdLazy, 23 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 2925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 570]: 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, 82 locations, 6 error locations. SAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 11 SDslu, 44 SDs, 0 SdLazy, 23 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 2651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 564]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L571] FCALL struct node_t *list = ((void *)0); VAL [list={15:0}] [L572] int dataNotFinished = 0; VAL [dataNotFinished=0, list={15:0}] [L574] CALL append(&list) VAL [pointerToList={15:0}] [L565] EXPR, FCALL malloc(sizeof *node) VAL [malloc(sizeof *node)={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L565] struct node_t *node = malloc(sizeof *node); VAL [malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L566] EXPR, FCALL \read(**pointerToList) VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L566] FCALL node->next = *pointerToList VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); VAL [\result={0:0}] [L567] EXPR create_data() VAL [create_data()={0:0}, malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L567] FCALL node->data = create_data() VAL [create_data()={0:0}, malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L568] FCALL *pointerToList = node VAL [malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 6 procedures, 82 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=82occurred 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, 25 NumberOfCodeBlocks, 25 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 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_03-10-18-235.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_03-10-18-235.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_03-10-18-235.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_03-10-18-235.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_03-10-18-235.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_03-10-18-235.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_03-10-18-235.csv Received shutdown request...