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_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:34:33,698 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:34:33,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:34:33,712 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:34:33,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:34:33,714 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:34:33,715 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:34:33,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:34:33,719 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:34:33,719 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:34:33,720 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:34:33,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:34:33,721 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:34:33,722 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:34:33,723 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:34:33,725 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:34:33,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:34:33,730 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:34:33,731 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:34:33,732 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:34:33,734 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:34:33,735 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:34:33,735 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:34:33,736 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:34:33,737 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:34:33,738 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:34:33,738 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:34:33,739 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:34:33,739 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:34:33,739 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:34:33,740 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:34:33,740 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_imprecise.epf [2018-01-21 00:34:33,750 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:34:33,751 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:34:33,752 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:34:33,752 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:34:33,752 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:34:33,752 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:34:33,752 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:34:33,753 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:34:33,753 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:34:33,754 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:34:33,754 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:34:33,754 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:34:33,754 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:34:33,754 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:34:33,755 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:34:33,755 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:34:33,755 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:34:33,755 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:34:33,755 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:34:33,755 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:34:33,756 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:34:33,756 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:34:33,756 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:34:33,756 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:34:33,756 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:34:33,757 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:34:33,757 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:34:33,757 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:34:33,757 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:34:33,758 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:34:33,758 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:34:33,758 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:34:33,758 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:34:33,758 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:34:33,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:34:33,759 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:34:33,759 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:34:33,760 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:34:33,760 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:34:33,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:34:33,808 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:34:33,813 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:34:33,814 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:34:33,815 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:34:33,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i [2018-01-21 00:34:33,990 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:34:33,995 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:34:33,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:34:33,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:34:34,001 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:34:34,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:34:33" (1/1) ... [2018-01-21 00:34:34,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6225bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:34:34, skipping insertion in model container [2018-01-21 00:34:34,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:34:33" (1/1) ... [2018-01-21 00:34:34,024 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:34:34,066 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:34:34,197 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:34:34,222 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:34:34,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:34:34 WrapperNode [2018-01-21 00:34:34,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:34:34,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:34:34,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:34:34,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:34:34,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:34:34" (1/1) ... [2018-01-21 00:34:34,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:34:34" (1/1) ... [2018-01-21 00:34:34,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:34:34" (1/1) ... [2018-01-21 00:34:34,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:34:34" (1/1) ... [2018-01-21 00:34:34,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:34:34" (1/1) ... [2018-01-21 00:34:34,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:34:34" (1/1) ... [2018-01-21 00:34:34,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:34:34" (1/1) ... [2018-01-21 00:34:34,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:34:34,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:34:34,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:34:34,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:34:34,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:34:34" (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 00:34:34,325 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:34:34,326 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:34:34,326 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-21 00:34:34,326 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-21 00:34:34,326 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-21 00:34:34,326 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-21 00:34:34,326 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-21 00:34:34,326 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-21 00:34:34,326 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-21 00:34:34,326 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-21 00:34:34,327 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:34:34,327 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:34:34,327 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:34:34,327 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:34:34,327 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:34:34,327 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:34:34,327 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:34:34,327 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:34:34,327 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:34:34,328 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-21 00:34:34,328 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:34:34,328 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-21 00:34:34,328 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-21 00:34:34,328 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-21 00:34:34,328 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-21 00:34:34,328 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-21 00:34:34,328 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-21 00:34:34,328 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-21 00:34:34,328 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-21 00:34:34,328 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:34:34,329 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:34:34,329 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:34:34,688 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:34:34,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:34:34 BoogieIcfgContainer [2018-01-21 00:34:34,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:34:34,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:34:34,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:34:34,691 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:34:34,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:34:33" (1/3) ... [2018-01-21 00:34:34,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db19dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:34:34, skipping insertion in model container [2018-01-21 00:34:34,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:34:34" (2/3) ... [2018-01-21 00:34:34,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db19dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:34:34, skipping insertion in model container [2018-01-21 00:34:34,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:34:34" (3/3) ... [2018-01-21 00:34:34,695 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_true-valid-memsafety.i [2018-01-21 00:34:34,701 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:34:34,707 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-21 00:34:34,753 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:34:34,753 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:34:34,753 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:34:34,753 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:34:34,753 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:34:34,753 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:34:34,753 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:34:34,753 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == __list_addErr0EnsuresViolation======== [2018-01-21 00:34:34,754 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:34:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-21 00:34:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:34:34,779 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:34,780 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 00:34:34,781 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr0EnsuresViolation]=== [2018-01-21 00:34:34,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1421895685, now seen corresponding path program 1 times [2018-01-21 00:34:34,786 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:34,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:34,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:34,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:34,829 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:34,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:34,968 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 00:34:34,971 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:34:34,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:34:34,971 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:34,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:34:34,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:34:34,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:34:34,995 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-21 00:34:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:34:35,104 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-21 00:34:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:34:35,106 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-01-21 00:34:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:34:35,112 INFO L225 Difference]: With dead ends: 183 [2018-01-21 00:34:35,113 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:34:35,118 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 00:34:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:34:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:34:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:34:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:34:35,138 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-21 00:34:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:34:35,138 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:34:35,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:34:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:34:35,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:34:35,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 00:34:35,236 INFO L401 ceAbstractionStarter]: For program point L627'(line 627) no Hoare annotation was computed. [2018-01-21 00:34:35,236 INFO L401 ceAbstractionStarter]: For program point __list_addErr0EnsuresViolation(lines 623 631) no Hoare annotation was computed. [2018-01-21 00:34:35,236 INFO L401 ceAbstractionStarter]: For program point __list_addEXIT(lines 623 631) no Hoare annotation was computed. [2018-01-21 00:34:35,236 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-21 00:34:35,237 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-21 00:34:35,237 INFO L401 ceAbstractionStarter]: For program point L627(line 627) no Hoare annotation was computed. [2018-01-21 00:34:35,237 INFO L404 ceAbstractionStarter]: At program point __list_addENTRY(lines 623 631) the Hoare annotation is: true [2018-01-21 00:34:35,237 INFO L401 ceAbstractionStarter]: For program point __list_addFINAL(lines 623 631) no Hoare annotation was computed. [2018-01-21 00:34:35,237 INFO L404 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: true [2018-01-21 00:34:35,237 INFO L401 ceAbstractionStarter]: For program point insert_subFINAL(lines 665 672) no Hoare annotation was computed. [2018-01-21 00:34:35,237 INFO L401 ceAbstractionStarter]: For program point L667(line 667) no Hoare annotation was computed. [2018-01-21 00:34:35,238 INFO L401 ceAbstractionStarter]: For program point insert_subErr0EnsuresViolation(lines 665 672) no Hoare annotation was computed. [2018-01-21 00:34:35,238 INFO L401 ceAbstractionStarter]: For program point L668''(lines 668 669) no Hoare annotation was computed. [2018-01-21 00:34:35,238 INFO L401 ceAbstractionStarter]: For program point L668(lines 668 669) no Hoare annotation was computed. [2018-01-21 00:34:35,238 INFO L401 ceAbstractionStarter]: For program point insert_subEXIT(lines 665 672) no Hoare annotation was computed. [2018-01-21 00:34:35,238 INFO L401 ceAbstractionStarter]: For program point L667'(line 667) no Hoare annotation was computed. [2018-01-21 00:34:35,238 INFO L404 ceAbstractionStarter]: At program point insert_subENTRY(lines 665 672) the Hoare annotation is: true [2018-01-21 00:34:35,238 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 702) no Hoare annotation was computed. [2018-01-21 00:34:35,238 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 702) no Hoare annotation was computed. [2018-01-21 00:34:35,238 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 702) the Hoare annotation is: true [2018-01-21 00:34:35,238 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 702) no Hoare annotation was computed. [2018-01-21 00:34:35,239 INFO L401 ceAbstractionStarter]: For program point L692(lines 692 694) no Hoare annotation was computed. [2018-01-21 00:34:35,239 INFO L404 ceAbstractionStarter]: At program point L692''(lines 692 694) the Hoare annotation is: true [2018-01-21 00:34:35,239 INFO L401 ceAbstractionStarter]: For program point create_topErr0EnsuresViolation(lines 690 695) no Hoare annotation was computed. [2018-01-21 00:34:35,239 INFO L404 ceAbstractionStarter]: At program point L693(line 693) the Hoare annotation is: true [2018-01-21 00:34:35,239 INFO L404 ceAbstractionStarter]: At program point create_topENTRY(lines 690 695) the Hoare annotation is: true [2018-01-21 00:34:35,239 INFO L401 ceAbstractionStarter]: For program point create_topEXIT(lines 690 695) no Hoare annotation was computed. [2018-01-21 00:34:35,239 INFO L401 ceAbstractionStarter]: For program point L693'(line 693) no Hoare annotation was computed. [2018-01-21 00:34:35,240 INFO L401 ceAbstractionStarter]: For program point L692'''(lines 692 694) no Hoare annotation was computed. [2018-01-21 00:34:35,240 INFO L401 ceAbstractionStarter]: For program point insert_topErr0EnsuresViolation(lines 681 689) no Hoare annotation was computed. [2018-01-21 00:34:35,240 INFO L401 ceAbstractionStarter]: For program point L684(lines 684 685) no Hoare annotation was computed. [2018-01-21 00:34:35,240 INFO L404 ceAbstractionStarter]: At program point L684''(lines 684 685) the Hoare annotation is: true [2018-01-21 00:34:35,240 INFO L401 ceAbstractionStarter]: For program point L683(line 683) no Hoare annotation was computed. [2018-01-21 00:34:35,240 INFO L401 ceAbstractionStarter]: For program point L683'(line 683) no Hoare annotation was computed. [2018-01-21 00:34:35,240 INFO L404 ceAbstractionStarter]: At program point L687(line 687) the Hoare annotation is: true [2018-01-21 00:34:35,240 INFO L404 ceAbstractionStarter]: At program point L686(line 686) the Hoare annotation is: true [2018-01-21 00:34:35,240 INFO L404 ceAbstractionStarter]: At program point insert_topENTRY(lines 681 689) the Hoare annotation is: true [2018-01-21 00:34:35,241 INFO L401 ceAbstractionStarter]: For program point insert_topEXIT(lines 681 689) no Hoare annotation was computed. [2018-01-21 00:34:35,241 INFO L401 ceAbstractionStarter]: For program point insert_topFINAL(lines 681 689) no Hoare annotation was computed. [2018-01-21 00:34:35,241 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-21 00:34:35,241 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-21 00:34:35,241 INFO L401 ceAbstractionStarter]: For program point destroy_subErr0EnsuresViolation(lines 645 653) no Hoare annotation was computed. [2018-01-21 00:34:35,241 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-21 00:34:35,241 INFO L401 ceAbstractionStarter]: For program point L648(lines 648 652) no Hoare annotation was computed. [2018-01-21 00:34:35,242 INFO L404 ceAbstractionStarter]: At program point destroy_subENTRY(lines 645 653) the Hoare annotation is: true [2018-01-21 00:34:35,242 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-21 00:34:35,242 INFO L404 ceAbstractionStarter]: At program point L648''(lines 648 652) the Hoare annotation is: true [2018-01-21 00:34:35,242 INFO L401 ceAbstractionStarter]: For program point L648'''(lines 648 652) no Hoare annotation was computed. [2018-01-21 00:34:35,242 INFO L401 ceAbstractionStarter]: For program point L649'(line 649) no Hoare annotation was computed. [2018-01-21 00:34:35,242 INFO L401 ceAbstractionStarter]: For program point L647'(line 647) no Hoare annotation was computed. [2018-01-21 00:34:35,242 INFO L401 ceAbstractionStarter]: For program point destroy_subEXIT(lines 645 653) no Hoare annotation was computed. [2018-01-21 00:34:35,242 INFO L401 ceAbstractionStarter]: For program point L677'''(lines 677 679) no Hoare annotation was computed. [2018-01-21 00:34:35,242 INFO L404 ceAbstractionStarter]: At program point L678(line 678) the Hoare annotation is: true [2018-01-21 00:34:35,243 INFO L401 ceAbstractionStarter]: For program point L677(lines 677 679) no Hoare annotation was computed. [2018-01-21 00:34:35,243 INFO L404 ceAbstractionStarter]: At program point L677''(lines 677 679) the Hoare annotation is: true [2018-01-21 00:34:35,243 INFO L401 ceAbstractionStarter]: For program point L675(line 675) no Hoare annotation was computed. [2018-01-21 00:34:35,243 INFO L401 ceAbstractionStarter]: For program point create_sub_listEXIT(lines 673 680) no Hoare annotation was computed. [2018-01-21 00:34:35,243 INFO L404 ceAbstractionStarter]: At program point create_sub_listENTRY(lines 673 680) the Hoare annotation is: true [2018-01-21 00:34:35,243 INFO L401 ceAbstractionStarter]: For program point create_sub_listErr0EnsuresViolation(lines 673 680) no Hoare annotation was computed. [2018-01-21 00:34:35,243 INFO L401 ceAbstractionStarter]: For program point L678'(line 678) no Hoare annotation was computed. [2018-01-21 00:34:35,244 INFO L401 ceAbstractionStarter]: For program point L675'(line 675) no Hoare annotation was computed. [2018-01-21 00:34:35,244 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 702) the Hoare annotation is: true [2018-01-21 00:34:35,244 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 702) no Hoare annotation was computed. [2018-01-21 00:34:35,244 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 702) the Hoare annotation is: true [2018-01-21 00:34:35,244 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 702) no Hoare annotation was computed. [2018-01-21 00:34:35,244 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 702) no Hoare annotation was computed. [2018-01-21 00:34:35,244 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 696 702) the Hoare annotation is: true [2018-01-21 00:34:35,244 INFO L401 ceAbstractionStarter]: For program point L698'''(line 698) no Hoare annotation was computed. [2018-01-21 00:34:35,245 INFO L401 ceAbstractionStarter]: For program point L698'(line 698) no Hoare annotation was computed. [2018-01-21 00:34:35,245 INFO L401 ceAbstractionStarter]: For program point L700(line 700) no Hoare annotation was computed. [2018-01-21 00:34:35,245 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 696 702) no Hoare annotation was computed. [2018-01-21 00:34:35,245 INFO L404 ceAbstractionStarter]: At program point L699(line 699) the Hoare annotation is: true [2018-01-21 00:34:35,245 INFO L401 ceAbstractionStarter]: For program point L698(line 698) no Hoare annotation was computed. [2018-01-21 00:34:35,245 INFO L401 ceAbstractionStarter]: For program point L698''''(line 698) no Hoare annotation was computed. [2018-01-21 00:34:35,245 INFO L404 ceAbstractionStarter]: At program point L698''(line 698) the Hoare annotation is: true [2018-01-21 00:34:35,246 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 696 702) no Hoare annotation was computed. [2018-01-21 00:34:35,246 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 696 702) no Hoare annotation was computed. [2018-01-21 00:34:35,246 INFO L401 ceAbstractionStarter]: For program point list_add_tailEXIT(lines 632 635) no Hoare annotation was computed. [2018-01-21 00:34:35,246 INFO L404 ceAbstractionStarter]: At program point L634'(line 634) the Hoare annotation is: true [2018-01-21 00:34:35,246 INFO L401 ceAbstractionStarter]: For program point list_add_tailFINAL(lines 632 635) no Hoare annotation was computed. [2018-01-21 00:34:35,246 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-21 00:34:35,246 INFO L401 ceAbstractionStarter]: For program point L634''(line 634) no Hoare annotation was computed. [2018-01-21 00:34:35,246 INFO L404 ceAbstractionStarter]: At program point list_add_tailENTRY(lines 632 635) the Hoare annotation is: true [2018-01-21 00:34:35,247 INFO L401 ceAbstractionStarter]: For program point list_add_tailErr0EnsuresViolation(lines 632 635) no Hoare annotation was computed. [2018-01-21 00:34:35,247 INFO L401 ceAbstractionStarter]: For program point destroy_topErr0EnsuresViolation(lines 654 664) no Hoare annotation was computed. [2018-01-21 00:34:35,247 INFO L401 ceAbstractionStarter]: For program point L661(line 661) no Hoare annotation was computed. [2018-01-21 00:34:35,247 INFO L401 ceAbstractionStarter]: For program point L660(line 660) no Hoare annotation was computed. [2018-01-21 00:34:35,247 INFO L401 ceAbstractionStarter]: For program point L656(line 656) no Hoare annotation was computed. [2018-01-21 00:34:35,247 INFO L404 ceAbstractionStarter]: At program point L659(line 659) the Hoare annotation is: true [2018-01-21 00:34:35,247 INFO L401 ceAbstractionStarter]: For program point L658(line 658) no Hoare annotation was computed. [2018-01-21 00:34:35,248 INFO L404 ceAbstractionStarter]: At program point L657''(lines 657 663) the Hoare annotation is: true [2018-01-21 00:34:35,248 INFO L401 ceAbstractionStarter]: For program point L657(lines 657 663) no Hoare annotation was computed. [2018-01-21 00:34:35,248 INFO L404 ceAbstractionStarter]: At program point L659'(line 659) the Hoare annotation is: true [2018-01-21 00:34:35,248 INFO L401 ceAbstractionStarter]: For program point L658'(line 658) no Hoare annotation was computed. [2018-01-21 00:34:35,248 INFO L401 ceAbstractionStarter]: For program point L656'(line 656) no Hoare annotation was computed. [2018-01-21 00:34:35,248 INFO L401 ceAbstractionStarter]: For program point L657'''(lines 657 663) no Hoare annotation was computed. [2018-01-21 00:34:35,248 INFO L404 ceAbstractionStarter]: At program point destroy_topENTRY(lines 654 664) the Hoare annotation is: true [2018-01-21 00:34:35,248 INFO L401 ceAbstractionStarter]: For program point destroy_topEXIT(lines 654 664) no Hoare annotation was computed. [2018-01-21 00:34:35,253 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:34:35,253 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:34:35,253 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:34:35,253 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:34:35,253 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:34:35,253 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:34:35,253 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:34:35,254 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == insert_subErr0EnsuresViolation======== [2018-01-21 00:34:35,254 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:34:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-21 00:34:35,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 00:34:35,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:35,260 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] [2018-01-21 00:34:35,260 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insert_subErr0EnsuresViolation]=== [2018-01-21 00:34:35,260 INFO L82 PathProgramCache]: Analyzing trace with hash 712574584, now seen corresponding path program 1 times [2018-01-21 00:34:35,260 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:35,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:35,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:35,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:35,262 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:35,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:35,325 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 00:34:35,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:34:35,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:34:35,325 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:35,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:34:35,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:34:35,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:34:35,326 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-21 00:34:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:34:35,341 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-21 00:34:35,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:34:35,341 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 42 [2018-01-21 00:34:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:34:35,345 INFO L225 Difference]: With dead ends: 183 [2018-01-21 00:34:35,345 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 00:34:35,347 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 00:34:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 00:34:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 00:34:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 00:34:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-21 00:34:35,365 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 42 [2018-01-21 00:34:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:34:35,365 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-21 00:34:35,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:34:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-21 00:34:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 00:34:35,368 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:35,368 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] [2018-01-21 00:34:35,368 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insert_subErr0EnsuresViolation]=== [2018-01-21 00:34:35,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1047454716, now seen corresponding path program 1 times [2018-01-21 00:34:35,369 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:35,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:35,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:35,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:35,370 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:34:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:34:35,510 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:34:35,522 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:34:35,528 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:34:35,528 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:34:35,529 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:34:35,540 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:34:35,540 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:34:35,540 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:34:35,541 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:34:35,541 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:34:35,541 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:34:35,541 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:34:35,541 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:34:35,541 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:34:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-21 00:34:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:34:35,543 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:35,544 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:34:35,544 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:34:35,544 INFO L82 PathProgramCache]: Analyzing trace with hash 189700, now seen corresponding path program 1 times [2018-01-21 00:34:35,544 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:35,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:35,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:35,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:35,546 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:34:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:34:35,553 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:34:35,554 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:34:35,556 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:34:35,557 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:34:35,557 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:34:35,557 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:34:35,557 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:34:35,557 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:34:35,557 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:34:35,557 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_topErr0EnsuresViolation======== [2018-01-21 00:34:35,557 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:34:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-21 00:34:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-21 00:34:35,560 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:35,560 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:34:35,560 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_topErr0EnsuresViolation]=== [2018-01-21 00:34:35,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1605295434, now seen corresponding path program 1 times [2018-01-21 00:34:35,561 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:35,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:35,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:35,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:35,562 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:35,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:35,579 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 00:34:35,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:34:35,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:34:35,579 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:35,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:34:35,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:34:35,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:34:35,580 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-21 00:34:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:34:35,592 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-21 00:34:35,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:34:35,592 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-21 00:34:35,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:34:35,594 INFO L225 Difference]: With dead ends: 183 [2018-01-21 00:34:35,594 INFO L226 Difference]: Without dead ends: 55 [2018-01-21 00:34:35,595 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 00:34:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-21 00:34:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-21 00:34:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-21 00:34:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-21 00:34:35,603 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 12 [2018-01-21 00:34:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:34:35,603 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-21 00:34:35,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:34:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-21 00:34:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-21 00:34:35,606 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:35,606 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:34:35,607 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_topErr0EnsuresViolation]=== [2018-01-21 00:34:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash -817398474, now seen corresponding path program 1 times [2018-01-21 00:34:35,607 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:35,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:35,608 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:35,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:35,608 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:35,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:34:35,750 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:34:35,750 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:34:35,751 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-01-21 00:34:35,754 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [72], [73], [75], [76], [102], [103], [105], [109], [112], [115], [122], [123], [124], [125], [130], [135], [141], [142], [143], [144], [145], [149], [150], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165] [2018-01-21 00:34:35,798 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:34:35,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:34:36,331 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:34:36,333 INFO L268 AbstractInterpreter]: Visited 56 different actions 97 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-21 00:34:36,353 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:34:36,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:34:36,354 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:34:36,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:36,366 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:34:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:36,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:34:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-21 00:34:36,497 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:34:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-21 00:34:36,796 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:34:36,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [4] total 4 [2018-01-21 00:34:36,796 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:36,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:34:36,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:34:36,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:34:36,798 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 3 states. [2018-01-21 00:34:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:34:36,912 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-01-21 00:34:36,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:34:36,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-01-21 00:34:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:34:36,914 INFO L225 Difference]: With dead ends: 55 [2018-01-21 00:34:36,914 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:34:36,915 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 195 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 00:34:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:34:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:34:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:34:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:34:36,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2018-01-21 00:34:36,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:34:36,916 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:34:36,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:34:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:34:36,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:34:36,918 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:34:36,919 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:34:36,919 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:34:36,920 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:34:36,920 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:34:36,920 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:34:36,920 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:34:36,921 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == insert_topErr0EnsuresViolation======== [2018-01-21 00:34:36,921 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:34:36,922 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-21 00:34:36,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-21 00:34:36,923 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:36,923 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:34:36,923 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insert_topErr0EnsuresViolation]=== [2018-01-21 00:34:36,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1794587042, now seen corresponding path program 1 times [2018-01-21 00:34:36,923 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:36,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:36,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:36,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:36,924 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:36,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 00:34:36,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:34:36,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:34:36,961 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:36,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:34:36,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:34:36,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:34:36,962 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-21 00:34:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:34:36,972 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-21 00:34:36,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:34:36,973 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2018-01-21 00:34:36,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:34:36,974 INFO L225 Difference]: With dead ends: 183 [2018-01-21 00:34:36,975 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 00:34:36,975 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 00:34:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 00:34:36,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 00:34:36,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 00:34:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-21 00:34:36,983 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 45 [2018-01-21 00:34:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:34:36,983 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-21 00:34:36,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:34:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-21 00:34:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-21 00:34:36,985 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:36,986 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:34:36,986 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insert_topErr0EnsuresViolation]=== [2018-01-21 00:34:36,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1017096708, now seen corresponding path program 1 times [2018-01-21 00:34:36,986 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:36,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:36,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:36,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:36,988 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:37,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:34:37,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:34:37,091 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:34:37,091 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2018-01-21 00:34:37,092 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [72], [73], [75], [76], [102], [103], [105], [109], [123], [124], [125], [130], [136], [141], [142], [143], [144], [145], [149], [150], [155], [157], [158], [159], [160], [161], [162], [163], [164], [165] [2018-01-21 00:34:37,094 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:34:37,094 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:34:37,338 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:34:37,338 INFO L268 AbstractInterpreter]: Visited 52 different actions 93 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-21 00:34:37,345 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:34:37,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:34:37,345 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:34:37,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:37,356 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:34:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:37,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:34:37,458 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-21 00:34:37,477 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:34:37,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-21 00:34:37,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:34:37,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:34:37,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-21 00:34:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-21 00:34:37,577 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:34:37,729 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_insert_sub_#t~malloc9.base_33| Int)) (or (< 0 (select |c_#valid| |v_insert_sub_#t~malloc9.base_33|)) (not (= |c_old(#valid)| (store |c_#valid| |v_insert_sub_#t~malloc9.base_33| 1))))) is different from false [2018-01-21 00:34:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:34:37,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-21 00:34:37,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4] total 8 [2018-01-21 00:34:37,767 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:37,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:34:37,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:34:37,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=20, Unknown=3, NotChecked=18, Total=56 [2018-01-21 00:34:37,768 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-01-21 00:34:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:34:37,846 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-01-21 00:34:37,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:34:37,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-01-21 00:34:37,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:34:37,847 INFO L225 Difference]: With dead ends: 86 [2018-01-21 00:34:37,847 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:34:37,848 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2018-01-21 00:34:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:34:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:34:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:34:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:34:37,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2018-01-21 00:34:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:34:37,848 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:34:37,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:34:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:34:37,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:34:37,850 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:34:37,850 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:34:37,850 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:34:37,850 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:34:37,850 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:34:37,850 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:34:37,851 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:34:37,851 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == destroy_subErr0EnsuresViolation======== [2018-01-21 00:34:37,851 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:34:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-21 00:34:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:34:37,853 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:37,853 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 00:34:37,853 INFO L371 AbstractCegarLoop]: === Iteration 1 === [destroy_subErr0EnsuresViolation]=== [2018-01-21 00:34:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash 781950497, now seen corresponding path program 1 times [2018-01-21 00:34:37,854 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:37,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:37,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:37,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:37,855 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:37,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:37,873 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 00:34:37,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:34:37,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:34:37,873 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:37,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:34:37,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:34:37,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:34:37,874 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-21 00:34:37,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:34:37,883 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-21 00:34:37,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:34:37,883 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-21 00:34:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:34:37,885 INFO L225 Difference]: With dead ends: 183 [2018-01-21 00:34:37,885 INFO L226 Difference]: Without dead ends: 79 [2018-01-21 00:34:37,885 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 00:34:37,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-21 00:34:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-21 00:34:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-21 00:34:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-21 00:34:37,894 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 27 [2018-01-21 00:34:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:34:37,894 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-21 00:34:37,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:34:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-21 00:34:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-21 00:34:37,897 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:37,897 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:34:37,897 INFO L371 AbstractCegarLoop]: === Iteration 2 === [destroy_subErr0EnsuresViolation]=== [2018-01-21 00:34:37,897 INFO L82 PathProgramCache]: Analyzing trace with hash 885609031, now seen corresponding path program 1 times [2018-01-21 00:34:37,897 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:37,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:37,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:37,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:37,899 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:37,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:34:38,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:34:38,013 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:34:38,013 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2018-01-21 00:34:38,014 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [20], [21], [22], [26], [30], [41], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [72], [73], [75], [76], [78], [79], [80], [84], [90], [91], [92], [102], [103], [105], [109], [112], [115], [121], [123], [124], [125], [130], [135], [141], [142], [143], [144], [145], [146], [147], [149], [150], [151], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165] [2018-01-21 00:34:38,016 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:34:38,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:34:38,351 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 00:34:38,351 INFO L268 AbstractInterpreter]: Visited 72 different actions 113 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-21 00:34:38,353 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 00:34:38,779 INFO L232 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 66.66% of their original sizes. [2018-01-21 00:34:38,779 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 00:34:40,896 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 00:34:40,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:34:40,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [67] imperfect sequences [4] total 70 [2018-01-21 00:34:40,897 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:40,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-01-21 00:34:40,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-01-21 00:34:40,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=4280, Unknown=0, NotChecked=0, Total=4556 [2018-01-21 00:34:40,899 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 68 states. [2018-01-21 00:34:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:34:58,330 INFO L93 Difference]: Finished difference Result 221 states and 251 transitions. [2018-01-21 00:34:58,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-01-21 00:34:58,330 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 113 [2018-01-21 00:34:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:34:58,334 INFO L225 Difference]: With dead ends: 221 [2018-01-21 00:34:58,335 INFO L226 Difference]: Without dead ends: 220 [2018-01-21 00:34:58,338 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1069, Invalid=14431, Unknown=0, NotChecked=0, Total=15500 [2018-01-21 00:34:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-21 00:34:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 115. [2018-01-21 00:34:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-21 00:34:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2018-01-21 00:34:58,363 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 113 [2018-01-21 00:34:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:34:58,364 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2018-01-21 00:34:58,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-01-21 00:34:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2018-01-21 00:34:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-21 00:34:58,365 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:58,365 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:34:58,366 INFO L371 AbstractCegarLoop]: === Iteration 3 === [destroy_subErr0EnsuresViolation]=== [2018-01-21 00:34:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1989050561, now seen corresponding path program 1 times [2018-01-21 00:34:58,366 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:58,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:58,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:58,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:58,367 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:58,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-21 00:34:58,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:34:58,429 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:34:58,429 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2018-01-21 00:34:58,429 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [20], [21], [22], [26], [30], [32], [33], [34], [35], [36], [41], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [72], [73], [75], [76], [78], [79], [80], [84], [90], [91], [92], [102], [103], [105], [109], [112], [115], [121], [123], [124], [125], [130], [135], [141], [142], [143], [144], [145], [146], [147], [149], [150], [151], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165] [2018-01-21 00:34:58,432 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:34:58,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:34:58,626 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:34:58,626 INFO L268 AbstractInterpreter]: Visited 77 different actions 126 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-21 00:34:58,636 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:34:58,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:34:58,636 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:34:58,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:58,648 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:34:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:58,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:34:58,738 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-21 00:34:58,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:34:58,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-21 00:34:58,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:34:58,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:34:58,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-21 00:34:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-21 00:34:58,831 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:34:58,997 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_insert_sub_#t~malloc9.base_58| Int)) (or (not (= (store |c_#valid| |v_insert_sub_#t~malloc9.base_58| 1) |c_old(#valid)|)) (< 0 (select |c_#valid| |v_insert_sub_#t~malloc9.base_58|)))) is different from false [2018-01-21 00:34:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-21 00:34:59,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-21 00:34:59,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4] total 8 [2018-01-21 00:34:59,051 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:59,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:34:59,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:34:59,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=19, Unknown=4, NotChecked=18, Total=56 [2018-01-21 00:34:59,052 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 6 states. [2018-01-21 00:34:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:34:59,127 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-21 00:34:59,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:34:59,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-01-21 00:34:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:34:59,128 INFO L225 Difference]: With dead ends: 140 [2018-01-21 00:34:59,128 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:34:59,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=27, Unknown=4, NotChecked=22, Total=72 [2018-01-21 00:34:59,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:34:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:34:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:34:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:34:59,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2018-01-21 00:34:59,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:34:59,130 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:34:59,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:34:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:34:59,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:34:59,131 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:34:59,131 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:34:59,131 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:34:59,132 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:34:59,132 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:34:59,132 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:34:59,132 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:34:59,132 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_sub_listErr0EnsuresViolation======== [2018-01-21 00:34:59,132 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:34:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-21 00:34:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 00:34:59,133 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:59,134 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] [2018-01-21 00:34:59,134 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_sub_listErr0EnsuresViolation]=== [2018-01-21 00:34:59,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1195581130, now seen corresponding path program 1 times [2018-01-21 00:34:59,134 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:59,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:59,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:59,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:59,135 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:59,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:59,144 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 00:34:59,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:34:59,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:34:59,144 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:59,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:34:59,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:34:59,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:34:59,145 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-21 00:34:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:34:59,150 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-21 00:34:59,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:34:59,151 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-21 00:34:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:34:59,152 INFO L225 Difference]: With dead ends: 183 [2018-01-21 00:34:59,152 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 00:34:59,152 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 00:34:59,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 00:34:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 00:34:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 00:34:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-21 00:34:59,157 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 22 [2018-01-21 00:34:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:34:59,158 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-21 00:34:59,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:34:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-21 00:34:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 00:34:59,159 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:59,159 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, 1, 1, 1] [2018-01-21 00:34:59,159 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_sub_listErr0EnsuresViolation]=== [2018-01-21 00:34:59,159 INFO L82 PathProgramCache]: Analyzing trace with hash -463951323, now seen corresponding path program 1 times [2018-01-21 00:34:59,159 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:59,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:59,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:59,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:59,160 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:59,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:59,194 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 00:34:59,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:34:59,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:34:59,194 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:59,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:34:59,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:34:59,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:34:59,195 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 3 states. [2018-01-21 00:34:59,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:34:59,400 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-01-21 00:34:59,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:34:59,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-01-21 00:34:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:34:59,416 INFO L225 Difference]: With dead ends: 54 [2018-01-21 00:34:59,416 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:34:59,417 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-21 00:34:59,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:34:59,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:34:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:34:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:34:59,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-21 00:34:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:34:59,417 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:34:59,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:34:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:34:59,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:34:59,418 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:34:59,418 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:34:59,418 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:34:59,419 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:34:59,419 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:34:59,419 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:34:59,419 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:34:59,419 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:34:59,419 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:34:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-21 00:34:59,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:34:59,420 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:59,420 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] [2018-01-21 00:34:59,420 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:34:59,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1280962335, now seen corresponding path program 1 times [2018-01-21 00:34:59,421 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:59,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:59,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:59,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:59,422 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:59,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:59,429 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 00:34:59,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:34:59,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:34:59,429 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:59,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:34:59,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:34:59,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:34:59,430 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-21 00:34:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:34:59,436 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-21 00:34:59,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:34:59,436 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-21 00:34:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:34:59,437 INFO L225 Difference]: With dead ends: 183 [2018-01-21 00:34:59,437 INFO L226 Difference]: Without dead ends: 87 [2018-01-21 00:34:59,438 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 00:34:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-21 00:34:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-21 00:34:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-21 00:34:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-01-21 00:34:59,445 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 26 [2018-01-21 00:34:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:34:59,445 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-01-21 00:34:59,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:34:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-01-21 00:34:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-21 00:34:59,446 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:34:59,446 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:34:59,446 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:34:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash 167217557, now seen corresponding path program 1 times [2018-01-21 00:34:59,446 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:34:59,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:59,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:59,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:34:59,447 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:34:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:59,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:34:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:34:59,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:34:59,499 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:34:59,500 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2018-01-21 00:34:59,500 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [67], [68], [69], [70], [72], [73], [75], [76], [78], [79], [80], [84], [88], [100], [102], [103], [105], [109], [112], [115], [121], [123], [124], [125], [130], [135], [140], [141], [142], [143], [144], [145], [146], [147], [148], [149], [150], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165], [166] [2018-01-21 00:34:59,501 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:34:59,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:34:59,653 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:34:59,653 INFO L268 AbstractInterpreter]: Visited 71 different actions 112 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-21 00:34:59,655 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:34:59,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:34:59,655 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:34:59,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:34:59,670 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:34:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:34:59,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:34:59,768 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-21 00:34:59,778 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:34:59,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-21 00:34:59,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:34:59,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:34:59,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-21 00:34:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-21 00:34:59,818 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:34:59,940 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_insert_sub_#t~malloc9.base_89| Int)) (or (< 0 (select |c_#valid| |v_insert_sub_#t~malloc9.base_89|)) (not (= |c_old(#valid)| (store |c_#valid| |v_insert_sub_#t~malloc9.base_89| 1))))) is different from false [2018-01-21 00:34:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:34:59,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-21 00:34:59,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4] total 8 [2018-01-21 00:34:59,967 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:34:59,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:34:59,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:34:59,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=20, Unknown=3, NotChecked=18, Total=56 [2018-01-21 00:34:59,968 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 6 states. [2018-01-21 00:35:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:00,033 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-01-21 00:35:00,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:35:00,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-01-21 00:35:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:00,034 INFO L225 Difference]: With dead ends: 119 [2018-01-21 00:35:00,034 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:35:00,034 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2018-01-21 00:35:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:35:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:35:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:35:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:35:00,035 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2018-01-21 00:35:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:00,035 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:35:00,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:35:00,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:35:00,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:35:00,037 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:35:00,037 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:35:00,037 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:35:00,037 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:35:00,037 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:35:00,037 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:35:00,037 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:35:00,037 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:35:00,037 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:35:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-21 00:35:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 00:35:00,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:00,039 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] [2018-01-21 00:35:00,039 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:35:00,039 INFO L82 PathProgramCache]: Analyzing trace with hash 870174460, now seen corresponding path program 1 times [2018-01-21 00:35:00,040 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:00,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:00,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:00,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:00,041 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:00,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:35:00,050 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 00:35:00,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:35:00,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:35:00,051 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:35:00,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:35:00,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:35:00,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:35:00,051 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-21 00:35:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:00,057 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-21 00:35:00,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:35:00,057 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 00:35:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:00,058 INFO L225 Difference]: With dead ends: 183 [2018-01-21 00:35:00,059 INFO L226 Difference]: Without dead ends: 85 [2018-01-21 00:35:00,059 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 00:35:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-21 00:35:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-21 00:35:00,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-21 00:35:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-21 00:35:00,065 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 24 [2018-01-21 00:35:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:00,066 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-21 00:35:00,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:35:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-21 00:35:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-21 00:35:00,067 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:00,067 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:35:00,067 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:35:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash 165536944, now seen corresponding path program 1 times [2018-01-21 00:35:00,068 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:00,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:00,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:00,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:00,069 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:00,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:35:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:35:00,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:35:00,132 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:35:00,133 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2018-01-21 00:35:00,133 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [67], [68], [69], [71], [72], [73], [75], [76], [78], [79], [80], [84], [88], [100], [102], [103], [105], [109], [112], [115], [121], [123], [124], [125], [130], [135], [141], [142], [143], [144], [145], [146], [147], [148], [149], [150], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165] [2018-01-21 00:35:00,135 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:35:00,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:35:00,315 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:35:00,316 INFO L268 AbstractInterpreter]: Visited 69 different actions 110 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-21 00:35:00,322 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:35:00,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:35:00,322 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:35:00,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:00,327 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:35:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:00,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:35:00,381 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-21 00:35:00,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:35:00,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-21 00:35:00,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:35:00,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:35:00,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-21 00:35:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-21 00:35:00,420 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:35:00,504 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_insert_sub_#t~malloc9.base_114| Int)) (or (< 0 (select |c_#valid| |v_insert_sub_#t~malloc9.base_114|)) (not (= (store |c_#valid| |v_insert_sub_#t~malloc9.base_114| 1) |c_old(#valid)|)))) is different from false [2018-01-21 00:35:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:35:00,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-21 00:35:00,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4] total 8 [2018-01-21 00:35:00,532 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:35:00,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:35:00,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:35:00,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=19, Unknown=4, NotChecked=18, Total=56 [2018-01-21 00:35:00,532 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 6 states. [2018-01-21 00:35:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:00,584 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-01-21 00:35:00,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:35:00,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-01-21 00:35:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:00,585 INFO L225 Difference]: With dead ends: 117 [2018-01-21 00:35:00,585 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:35:00,585 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=27, Unknown=4, NotChecked=22, Total=72 [2018-01-21 00:35:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:35:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:35:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:35:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:35:00,586 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2018-01-21 00:35:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:00,586 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:35:00,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:35:00,587 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:35:00,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:35:00,588 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:35:00,588 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:35:00,588 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:35:00,588 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:35:00,588 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:35:00,588 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:35:00,588 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:35:00,588 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == list_add_tailErr0EnsuresViolation======== [2018-01-21 00:35:00,588 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:35:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-21 00:35:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-21 00:35:00,590 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:00,591 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:35:00,591 INFO L371 AbstractCegarLoop]: === Iteration 1 === [list_add_tailErr0EnsuresViolation]=== [2018-01-21 00:35:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash -176168903, now seen corresponding path program 1 times [2018-01-21 00:35:00,591 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:00,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:00,592 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:00,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:00,592 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:00,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:35:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 00:35:00,608 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:35:00,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:35:00,608 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:35:00,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:35:00,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:35:00,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:35:00,609 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-21 00:35:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:00,615 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-21 00:35:00,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:35:00,615 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 43 [2018-01-21 00:35:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:00,615 INFO L225 Difference]: With dead ends: 183 [2018-01-21 00:35:00,615 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:35:00,616 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 00:35:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:35:00,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:35:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:35:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:35:00,617 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-01-21 00:35:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:00,617 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:35:00,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:35:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:35:00,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:35:00,618 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:35:00,618 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:35:00,618 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:35:00,618 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:35:00,619 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:35:00,619 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:35:00,619 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:35:00,619 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == destroy_topErr0EnsuresViolation======== [2018-01-21 00:35:00,619 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:35:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-21 00:35:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 00:35:00,620 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:00,621 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:35:00,621 INFO L371 AbstractCegarLoop]: === Iteration 1 === [destroy_topErr0EnsuresViolation]=== [2018-01-21 00:35:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash 391106876, now seen corresponding path program 1 times [2018-01-21 00:35:00,621 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:00,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:00,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:00,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:00,622 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:00,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:35:00,629 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 00:35:00,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:35:00,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:35:00,630 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:35:00,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:35:00,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:35:00,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:35:00,630 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-21 00:35:00,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:00,634 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-21 00:35:00,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:35:00,634 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 00:35:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:00,635 INFO L225 Difference]: With dead ends: 183 [2018-01-21 00:35:00,635 INFO L226 Difference]: Without dead ends: 80 [2018-01-21 00:35:00,635 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 00:35:00,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-21 00:35:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-21 00:35:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-21 00:35:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-01-21 00:35:00,641 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 19 [2018-01-21 00:35:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:00,641 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-01-21 00:35:00,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:35:00,642 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-01-21 00:35:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-21 00:35:00,643 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:00,643 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:35:00,643 INFO L371 AbstractCegarLoop]: === Iteration 2 === [destroy_topErr0EnsuresViolation]=== [2018-01-21 00:35:00,643 INFO L82 PathProgramCache]: Analyzing trace with hash -589432056, now seen corresponding path program 1 times [2018-01-21 00:35:00,643 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:00,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:00,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:00,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:00,644 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:00,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:35:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:35:00,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:35:00,694 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:35:00,694 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2018-01-21 00:35:00,694 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [72], [73], [75], [76], [78], [79], [80], [84], [88], [101], [102], [103], [105], [109], [112], [115], [121], [123], [124], [125], [130], [135], [141], [142], [143], [144], [145], [146], [147], [149], [150], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165] [2018-01-21 00:35:00,695 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:35:00,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:35:00,827 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 00:35:00,827 INFO L268 AbstractInterpreter]: Visited 64 different actions 105 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-21 00:35:00,833 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 00:35:01,077 INFO L232 lantSequenceWeakener]: Weakened 104 states. On average, predicates are now at 67.55% of their original sizes. [2018-01-21 00:35:01,078 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 00:35:02,703 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 00:35:02,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:35:02,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [4] total 68 [2018-01-21 00:35:02,703 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:35:02,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-01-21 00:35:02,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-01-21 00:35:02,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=4027, Unknown=0, NotChecked=0, Total=4290 [2018-01-21 00:35:02,705 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 66 states. [2018-01-21 00:35:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:12,891 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2018-01-21 00:35:12,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-01-21 00:35:12,892 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 105 [2018-01-21 00:35:12,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:12,893 INFO L225 Difference]: With dead ends: 225 [2018-01-21 00:35:12,893 INFO L226 Difference]: Without dead ends: 222 [2018-01-21 00:35:12,897 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3694 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=995, Invalid=13285, Unknown=0, NotChecked=0, Total=14280 [2018-01-21 00:35:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-21 00:35:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 115. [2018-01-21 00:35:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-21 00:35:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-01-21 00:35:12,914 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 105 [2018-01-21 00:35:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:12,914 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-01-21 00:35:12,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-01-21 00:35:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-01-21 00:35:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-01-21 00:35:12,916 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:35:12,916 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:35:12,917 INFO L371 AbstractCegarLoop]: === Iteration 3 === [destroy_topErr0EnsuresViolation]=== [2018-01-21 00:35:12,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2105836572, now seen corresponding path program 1 times [2018-01-21 00:35:12,917 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:35:12,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:12,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:12,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:35:12,918 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:35:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:12,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:35:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-21 00:35:12,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:35:12,976 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:35:12,977 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-01-21 00:35:12,977 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [20], [21], [22], [26], [30], [40], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [72], [73], [75], [76], [78], [79], [80], [84], [88], [90], [91], [92], [95], [96], [101], [102], [103], [105], [109], [112], [115], [121], [123], [124], [125], [130], [135], [141], [142], [143], [144], [145], [146], [147], [149], [150], [151], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165] [2018-01-21 00:35:12,978 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:35:12,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:35:13,191 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:35:13,191 INFO L268 AbstractInterpreter]: Visited 79 different actions 150 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-21 00:35:13,202 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:35:13,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:35:13,202 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:35:13,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:35:13,218 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:35:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:35:13,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:35:13,294 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-21 00:35:13,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:35:13,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-21 00:35:13,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:35:13,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:35:13,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-21 00:35:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-21 00:35:13,345 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:35:13,424 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_insert_sub_#t~malloc9.base_139| Int)) (or (not (= (store |c_#valid| |v_insert_sub_#t~malloc9.base_139| 1) |c_old(#valid)|)) (< 0 (select |c_#valid| |v_insert_sub_#t~malloc9.base_139|)))) is different from false [2018-01-21 00:35:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-21 00:35:13,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-21 00:35:13,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4] total 8 [2018-01-21 00:35:13,452 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:35:13,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:35:13,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:35:13,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=19, Unknown=4, NotChecked=18, Total=56 [2018-01-21 00:35:13,453 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 6 states. [2018-01-21 00:35:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:35:13,507 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-21 00:35:13,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:35:13,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-01-21 00:35:13,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:35:13,507 INFO L225 Difference]: With dead ends: 140 [2018-01-21 00:35:13,508 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:35:13,508 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=27, Unknown=4, NotChecked=22, Total=72 [2018-01-21 00:35:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:35:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:35:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:35:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:35:13,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2018-01-21 00:35:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:35:13,509 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:35:13,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:35:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:35:13,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:35:13,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:35:13 BoogieIcfgContainer [2018-01-21 00:35:13,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:35:13,512 INFO L168 Benchmark]: Toolchain (without parser) took 39522.12 ms. Allocated memory was 304.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 262.9 MB in the beginning and 982.8 MB in the end (delta: -719.8 MB). Peak memory consumption was 458.3 MB. Max. memory is 5.3 GB. [2018-01-21 00:35:13,513 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:35:13,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.10 ms. Allocated memory is still 304.6 MB. Free memory was 262.0 MB in the beginning and 251.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:35:13,514 INFO L168 Benchmark]: Boogie Preprocessor took 43.58 ms. Allocated memory is still 304.6 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:35:13,514 INFO L168 Benchmark]: RCFGBuilder took 411.43 ms. Allocated memory is still 304.6 MB. Free memory was 249.0 MB in the beginning and 221.2 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-01-21 00:35:13,514 INFO L168 Benchmark]: TraceAbstraction took 38822.16 ms. Allocated memory was 304.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 221.2 MB in the beginning and 982.8 MB in the end (delta: -761.6 MB). Peak memory consumption was 416.5 MB. Max. memory is 5.3 GB. [2018-01-21 00:35:13,516 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.20 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 237.10 ms. Allocated memory is still 304.6 MB. Free memory was 262.0 MB in the beginning and 251.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.58 ms. Allocated memory is still 304.6 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 411.43 ms. Allocated memory is still 304.6 MB. Free memory was 249.0 MB in the beginning and 221.2 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 38822.16 ms. Allocated memory was 304.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 221.2 MB in the beginning and 982.8 MB in the end (delta: -761.6 MB). Peak memory consumption was 416.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 54 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 557 LocStat_NO_SUPPORTING_DISEQUALITIES : 205 LocStat_NO_DISJUNCTIONS : -108 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 72 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 154 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 74 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.224862 RENAME_VARIABLES(MILLISECONDS) : 0.144743 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.178147 PROJECTAWAY(MILLISECONDS) : 0.084399 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000791 DISJOIN(MILLISECONDS) : 0.275073 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.173696 ADD_EQUALITY(MILLISECONDS) : 0.044449 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013941 #CONJOIN_DISJUNCTIVE : 145 #RENAME_VARIABLES : 261 #UNFREEZE : 0 #CONJOIN : 320 #PROJECTAWAY : 230 #ADD_WEAK_EQUALITY : 61 #DISJOIN : 43 #RENAME_VARIABLES_DISJUNCTIVE : 258 #ADD_EQUALITY : 191 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 50 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 532 LocStat_NO_SUPPORTING_DISEQUALITIES : 193 LocStat_NO_DISJUNCTIONS : -100 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 68 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 152 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 70 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.207986 RENAME_VARIABLES(MILLISECONDS) : 0.107483 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.181246 PROJECTAWAY(MILLISECONDS) : 0.058875 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001030 DISJOIN(MILLISECONDS) : 0.155898 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.127382 ADD_EQUALITY(MILLISECONDS) : 0.010308 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009776 #CONJOIN_DISJUNCTIVE : 140 #RENAME_VARIABLES : 250 #UNFREEZE : 0 #CONJOIN : 311 #PROJECTAWAY : 218 #ADD_WEAK_EQUALITY : 61 #DISJOIN : 43 #RENAME_VARIABLES_DISJUNCTIVE : 247 #ADD_EQUALITY : 189 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 69 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 619 LocStat_NO_SUPPORTING_DISEQUALITIES : 243 LocStat_NO_DISJUNCTIONS : -138 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 92 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 181 TransStat_NO_SUPPORTING_DISEQUALITIES : 19 TransStat_NO_DISJUNCTIONS : 95 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.292459 RENAME_VARIABLES(MILLISECONDS) : 0.198856 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.259894 PROJECTAWAY(MILLISECONDS) : 0.016587 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001231 DISJOIN(MILLISECONDS) : 0.190093 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.227907 ADD_EQUALITY(MILLISECONDS) : 0.016134 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010947 #CONJOIN_DISJUNCTIVE : 175 #RENAME_VARIABLES : 309 #UNFREEZE : 0 #CONJOIN : 361 #PROJECTAWAY : 277 #ADD_WEAK_EQUALITY : 61 #DISJOIN : 46 #RENAME_VARIABLES_DISJUNCTIVE : 305 #ADD_EQUALITY : 218 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 74 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 706 LocStat_NO_SUPPORTING_DISEQUALITIES : 254 LocStat_NO_DISJUNCTIONS : -148 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 97 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 201 TransStat_NO_SUPPORTING_DISEQUALITIES : 23 TransStat_NO_DISJUNCTIONS : 104 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.147903 RENAME_VARIABLES(MILLISECONDS) : 0.192616 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.133610 PROJECTAWAY(MILLISECONDS) : 0.210754 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001683 DISJOIN(MILLISECONDS) : 0.116825 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.210529 ADD_EQUALITY(MILLISECONDS) : 0.006094 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006900 #CONJOIN_DISJUNCTIVE : 203 #RENAME_VARIABLES : 371 #UNFREEZE : 0 #CONJOIN : 426 #PROJECTAWAY : 324 #ADD_WEAK_EQUALITY : 62 #DISJOIN : 54 #RENAME_VARIABLES_DISJUNCTIVE : 353 #ADD_EQUALITY : 230 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 13 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 69 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 672 LocStat_NO_SUPPORTING_DISEQUALITIES : 246 LocStat_NO_DISJUNCTIONS : -138 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 89 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 172 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 91 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.072676 RENAME_VARIABLES(MILLISECONDS) : 0.036078 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.051232 PROJECTAWAY(MILLISECONDS) : 0.015424 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001873 DISJOIN(MILLISECONDS) : 0.120075 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.046715 ADD_EQUALITY(MILLISECONDS) : 0.011207 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006559 #CONJOIN_DISJUNCTIVE : 165 #RENAME_VARIABLES : 302 #UNFREEZE : 0 #CONJOIN : 354 #PROJECTAWAY : 277 #ADD_WEAK_EQUALITY : 62 #DISJOIN : 43 #RENAME_VARIABLES_DISJUNCTIVE : 299 #ADD_EQUALITY : 209 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 67 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 683 LocStat_NO_SUPPORTING_DISEQUALITIES : 244 LocStat_NO_DISJUNCTIONS : -134 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 87 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 170 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 89 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.044570 RENAME_VARIABLES(MILLISECONDS) : 0.023015 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.032851 PROJECTAWAY(MILLISECONDS) : 0.013883 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000518 DISJOIN(MILLISECONDS) : 0.106801 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.031873 ADD_EQUALITY(MILLISECONDS) : 0.013743 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006741 #CONJOIN_DISJUNCTIVE : 163 #RENAME_VARIABLES : 295 #UNFREEZE : 0 #CONJOIN : 348 #PROJECTAWAY : 267 #ADD_WEAK_EQUALITY : 62 #DISJOIN : 43 #RENAME_VARIABLES_DISJUNCTIVE : 292 #ADD_EQUALITY : 207 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 61 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 564 LocStat_NO_SUPPORTING_DISEQUALITIES : 226 LocStat_NO_DISJUNCTIONS : -122 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 82 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 167 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 84 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.120131 RENAME_VARIABLES(MILLISECONDS) : 0.099220 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.106170 PROJECTAWAY(MILLISECONDS) : 0.011468 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000132 DISJOIN(MILLISECONDS) : 0.122738 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.111041 ADD_EQUALITY(MILLISECONDS) : 0.006388 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006706 #CONJOIN_DISJUNCTIVE : 158 #RENAME_VARIABLES : 282 #UNFREEZE : 0 #CONJOIN : 339 #PROJECTAWAY : 252 #ADD_WEAK_EQUALITY : 61 #DISJOIN : 43 #RENAME_VARIABLES_DISJUNCTIVE : 279 #ADD_EQUALITY : 204 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 75 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 714 LocStat_NO_SUPPORTING_DISEQUALITIES : 245 LocStat_NO_DISJUNCTIONS : -150 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 99 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 202 TransStat_NO_SUPPORTING_DISEQUALITIES : 21 TransStat_NO_DISJUNCTIONS : 105 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.239443 RENAME_VARIABLES(MILLISECONDS) : 0.269973 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.224819 PROJECTAWAY(MILLISECONDS) : 0.158258 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000616 DISJOIN(MILLISECONDS) : 0.429568 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.288865 ADD_EQUALITY(MILLISECONDS) : 0.007236 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009181 #CONJOIN_DISJUNCTIVE : 230 #RENAME_VARIABLES : 460 #UNFREEZE : 0 #CONJOIN : 496 #PROJECTAWAY : 381 #ADD_WEAK_EQUALITY : 62 #DISJOIN : 72 #RENAME_VARIABLES_DISJUNCTIVE : 443 #ADD_EQUALITY : 231 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 * 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 623]: 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: __list_addErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 59 PreInvPairs, 73 NumberOfFragments, 27 HoareAnnotationTreeSize, 59 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 1296 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: 665]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L698] FCALL struct list_head top = { &(top), &(top) }; VAL [top={33:0}] [L699] CALL create_top(&top) VAL [top={33:0}] [L693] CALL insert_top(top) VAL [head={33:0}] [L683] EXPR, FCALL malloc(sizeof(*top)) VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}] [L683] struct top_list *top = malloc(sizeof(*top)); VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}, top={38:0}] [L684] COND FALSE !(!top) VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}, top={38:0}] [L686] CALL create_sub_list(&top->sub1) VAL [sub={38:8}] [L675] FCALL sub->prev = sub VAL [sub={38:8}, sub={38:8}] [L676] FCALL sub->next = sub VAL [sub={38:8}, sub={38:8}] [L678] CALL insert_sub(sub) VAL [head={38:8}] [L667] EXPR, FCALL malloc(sizeof(*sub)) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}] [L667] struct sub_list *sub = malloc(sizeof(*sub)); VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L668] COND FALSE !(!sub) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L670] FCALL sub->number = 0 VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L671] CALL list_add_tail(&sub->link, head) VAL [head={38:8}, new={35:4}] [L634] EXPR, FCALL head->prev VAL [head={38:8}, head={38:8}, head->prev={38:8}, new={35:4}, new={35:4}] [L634] CALL __list_add(new, head->prev, head) VAL [new={35:4}, next={38:8}, prev={38:8}] [L627] FCALL next->prev = new VAL [new={35:4}, new={35:4}, next={38:8}, next={38:8}, prev={38:8}, prev={38:8}] [L628] FCALL new->next = next VAL [new={35:4}, new={35:4}, next={38:8}, next={38:8}, prev={38:8}, prev={38:8}] [L629] FCALL new->prev = prev VAL [new={35:4}, new={35:4}, next={38:8}, next={38:8}, prev={38:8}, prev={38:8}] [L630] RET, FCALL prev->next = new VAL [new={35:4}, new={35:4}, next={38:8}, next={38:8}, prev={38:8}, prev={38:8}] [L634] RET __list_add(new, head->prev, head) VAL [head={38:8}, head={38:8}, head->prev={38:8}, new={35:4}, new={35:4}] [L671] list_add_tail(&sub->link, head) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: insert_subErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 1681 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 11 procedures, 98 locations, 11 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=98occurred 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: 690]: 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: create_topErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 1.3s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 21 SDslu, 7 SDs, 0 SdLazy, 17 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 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.4s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 32281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 156/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 681]: 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: insert_topErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.9s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 32 SDslu, 15 SDs, 0 SdLazy, 31 SolverSat, 17 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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, 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.4s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 320 ConstructedInterpolants, 20 QuantifiedInterpolants, 44716 SizeOfPredicates, 3 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 150/174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 645]: 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: destroy_subErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 21.2s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 17.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 617 SDslu, 840 SDs, 0 SdLazy, 3806 SolverSat, 326 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 420 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9224475206749367 AbsIntWeakeningRatio, 1.1785714285714286 AbsIntAvgWeakeningVarsNumRemoved, 8.410714285714286 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 105 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 492 ConstructedInterpolants, 20 QuantifiedInterpolants, 79422 SizeOfPredicates, 3 NumberOfNonLiveVariables, 523 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 194/230 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 673]: 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: create_sub_listErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 18 SDslu, 7 SDs, 0 SdLazy, 17 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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=98occurred 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.0s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 3276 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: 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 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.6s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 39 SDslu, 17 SDs, 0 SdLazy, 30 SolverSat, 20 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 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.2s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 358 ConstructedInterpolants, 20 QuantifiedInterpolants, 58567 SizeOfPredicates, 3 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 144/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 696]: 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 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 39 SDslu, 17 SDs, 0 SdLazy, 31 SolverSat, 20 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 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, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 350 ConstructedInterpolants, 20 QuantifiedInterpolants, 56773 SizeOfPredicates, 3 NumberOfNonLiveVariables, 482 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 144/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 632]: 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: list_add_tailErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 654]: 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: destroy_topErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 12.8s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 177 SDtfs, 609 SDslu, 616 SDs, 0 SdLazy, 2427 SolverSat, 265 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 425 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3695 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9251586852689795 AbsIntWeakeningRatio, 1.1538461538461537 AbsIntAvgWeakeningVarsNumRemoved, 8.884615384615385 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 107 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 500 ConstructedInterpolants, 20 QuantifiedInterpolants, 84558 SizeOfPredicates, 3 NumberOfNonLiveVariables, 545 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 215/251 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 648]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 677]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 657]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 692]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-6-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-6-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-7-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-7-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-9-2018-01-21_00-35-13-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-10-2018-01-21_00-35-13-536.csv Received shutdown request...