java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:31:58,762 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:31:58,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:31:58,781 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:31:58,781 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:31:58,782 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:31:58,784 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:31:58,787 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:31:58,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:31:58,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:31:58,792 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:31:58,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:31:58,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:31:58,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:31:58,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:31:58,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:31:58,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:31:58,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:31:58,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:31:58,816 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:31:58,818 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:31:58,819 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:31:58,819 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:31:58,820 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:31:58,821 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:31:58,822 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:31:58,822 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:31:58,823 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:31:58,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:31:58,825 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:31:58,826 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:31:58,826 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:31:58,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:31:58,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:31:58,843 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:31:58,843 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:31:58,844 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:31:58,844 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:31:58,844 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:31:58,844 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:31:58,845 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:31:58,845 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:31:58,845 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:31:58,846 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:31:58,846 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:31:58,846 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:31:58,846 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:31:58,846 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:31:58,846 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:31:58,847 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:31:58,847 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:31:58,847 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:31:58,848 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:31:58,848 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:31:58,848 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:31:58,848 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:31:58,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:31:58,849 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:31:58,849 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:31:58,849 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:31:58,849 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:31:58,850 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:31:58,850 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:31:58,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:31:58,850 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:31:58,850 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:31:58,853 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:31:58,853 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:31:58,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:31:58,932 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:31:58,939 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:31:58,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:31:58,942 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:31:58,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-01-24 17:31:59,141 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:31:59,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:31:59,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:31:59,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:31:59,159 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:31:59,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:31:59" (1/1) ... [2018-01-24 17:31:59,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b029a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:59, skipping insertion in model container [2018-01-24 17:31:59,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:31:59" (1/1) ... [2018-01-24 17:31:59,181 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:31:59,235 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:31:59,366 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:31:59,393 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:31:59,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:59 WrapperNode [2018-01-24 17:31:59,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:31:59,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:31:59,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:31:59,403 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:31:59,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:59" (1/1) ... [2018-01-24 17:31:59,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:59" (1/1) ... [2018-01-24 17:31:59,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:59" (1/1) ... [2018-01-24 17:31:59,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:59" (1/1) ... [2018-01-24 17:31:59,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:59" (1/1) ... [2018-01-24 17:31:59,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:59" (1/1) ... [2018-01-24 17:31:59,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:59" (1/1) ... [2018-01-24 17:31:59,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:31:59,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:31:59,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:31:59,445 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:31:59,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:59" (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-24 17:31:59,508 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:31:59,509 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:31:59,509 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-24 17:31:59,509 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:31:59,509 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:31:59,509 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:31:59,509 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 17:31:59,510 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 17:31:59,510 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:31:59,510 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:31:59,510 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:31:59,510 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 17:31:59,510 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:31:59,511 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:31:59,511 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-24 17:31:59,511 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:31:59,511 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:31:59,511 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:31:59,745 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:31:59,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:31:59 BoogieIcfgContainer [2018-01-24 17:31:59,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:31:59,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:31:59,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:31:59,748 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:31:59,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:31:59" (1/3) ... [2018-01-24 17:31:59,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebca8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:31:59, skipping insertion in model container [2018-01-24 17:31:59,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:31:59" (2/3) ... [2018-01-24 17:31:59,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebca8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:31:59, skipping insertion in model container [2018-01-24 17:31:59,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:31:59" (3/3) ... [2018-01-24 17:31:59,751 INFO L105 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2018-01-24 17:31:59,759 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:31:59,765 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 17:31:59,817 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:31:59,817 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:31:59,817 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:31:59,817 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:31:59,817 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:31:59,818 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:31:59,818 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:31:59,818 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:31:59,819 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:31:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-01-24 17:31:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 17:31:59,853 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:31:59,855 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:31:59,855 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 17:31:59,859 INFO L82 PathProgramCache]: Analyzing trace with hash 33713669, now seen corresponding path program 1 times [2018-01-24 17:31:59,861 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:31:59,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:59,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:31:59,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:31:59,902 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:31:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:31:59,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:31:59,999 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-24 17:32:00,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:00,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:32:00,002 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:00,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 17:32:00,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 17:32:00,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 17:32:00,021 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-01-24 17:32:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:00,051 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-01-24 17:32:00,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 17:32:00,052 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-24 17:32:00,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:00,060 INFO L225 Difference]: With dead ends: 77 [2018-01-24 17:32:00,060 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 17:32:00,064 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-24 17:32:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 17:32:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 17:32:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 17:32:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-01-24 17:32:00,214 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 11 [2018-01-24 17:32:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:00,214 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-01-24 17:32:00,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 17:32:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-01-24 17:32:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 17:32:00,216 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:00,216 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:32:00,216 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 17:32:00,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1961763874, now seen corresponding path program 1 times [2018-01-24 17:32:00,217 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:00,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:00,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:00,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:00,219 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:00,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:00,356 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-24 17:32:00,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:00,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:32:00,357 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:00,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:00,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:00,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:00,360 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 5 states. [2018-01-24 17:32:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:00,678 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-01-24 17:32:00,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:32:00,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 17:32:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:00,680 INFO L225 Difference]: With dead ends: 62 [2018-01-24 17:32:00,680 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 17:32:00,681 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:32:00,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 17:32:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-01-24 17:32:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 17:32:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-24 17:32:00,689 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 13 [2018-01-24 17:32:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:00,689 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-24 17:32:00,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:00,690 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-24 17:32:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 17:32:00,690 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:00,690 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:32:00,690 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 17:32:00,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1961763873, now seen corresponding path program 1 times [2018-01-24 17:32:00,691 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:00,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:00,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:00,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:00,692 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:00,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:00,899 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-24 17:32:00,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:00,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:32:00,899 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:00,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:00,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:00,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:00,901 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 5 states. [2018-01-24 17:32:01,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:01,104 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-01-24 17:32:01,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:32:01,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 17:32:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:01,107 INFO L225 Difference]: With dead ends: 70 [2018-01-24 17:32:01,108 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 17:32:01,108 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:32:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 17:32:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-01-24 17:32:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 17:32:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-24 17:32:01,119 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 13 [2018-01-24 17:32:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:01,119 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-24 17:32:01,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-24 17:32:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:32:01,121 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:01,121 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-24 17:32:01,121 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 17:32:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash 722281926, now seen corresponding path program 1 times [2018-01-24 17:32:01,122 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:01,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:01,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:01,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:01,123 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:01,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:01,181 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-24 17:32:01,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:01,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:32:01,182 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:01,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:32:01,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:32:01,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:32:01,183 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2018-01-24 17:32:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:01,409 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-01-24 17:32:01,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:32:01,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 17:32:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:01,411 INFO L225 Difference]: With dead ends: 63 [2018-01-24 17:32:01,411 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 17:32:01,411 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:32:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 17:32:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-01-24 17:32:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 17:32:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-24 17:32:01,421 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 19 [2018-01-24 17:32:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:01,421 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-24 17:32:01,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:32:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-24 17:32:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:32:01,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:01,423 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:32:01,423 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 17:32:01,423 INFO L82 PathProgramCache]: Analyzing trace with hash 587467943, now seen corresponding path program 1 times [2018-01-24 17:32:01,424 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:01,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:01,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:01,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:01,425 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:01,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:32:01,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:01,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:32:01,628 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:01,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:32:01,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:32:01,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:32:01,629 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 7 states. [2018-01-24 17:32:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:01,970 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-01-24 17:32:01,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:32:01,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 17:32:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:01,975 INFO L225 Difference]: With dead ends: 75 [2018-01-24 17:32:01,975 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 17:32:01,975 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:32:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 17:32:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2018-01-24 17:32:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 17:32:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-01-24 17:32:01,983 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 23 [2018-01-24 17:32:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:01,984 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-01-24 17:32:01,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:32:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-01-24 17:32:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:32:01,985 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:01,985 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:32:01,986 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 17:32:01,986 INFO L82 PathProgramCache]: Analyzing trace with hash 587467944, now seen corresponding path program 1 times [2018-01-24 17:32:01,986 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:01,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:01,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:01,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:01,988 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:02,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:32:02,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:32:02,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:32:02,195 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:32:02,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:32:02,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:32:02,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:32:02,197 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 7 states. [2018-01-24 17:32:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:02,692 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-01-24 17:32:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:32:02,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 17:32:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:02,694 INFO L225 Difference]: With dead ends: 74 [2018-01-24 17:32:02,694 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 17:32:02,695 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:32:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 17:32:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2018-01-24 17:32:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 17:32:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-01-24 17:32:02,702 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 23 [2018-01-24 17:32:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:02,702 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-01-24 17:32:02,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:32:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-01-24 17:32:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 17:32:02,703 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:02,703 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:32:02,703 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 17:32:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash 857300197, now seen corresponding path program 1 times [2018-01-24 17:32:02,704 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:02,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:02,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:02,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:02,705 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:02,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:32:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:32:03,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:32:03,154 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:32:03,155 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 17:32:03,160 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [9], [13], [15], [18], [43], [46], [49], [53], [59], [60], [61], [69], [71], [74], [85], [86], [94], [95], [96] [2018-01-24 17:32:03,203 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:32:03,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:32:03,555 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:32:03,556 INFO L268 AbstractInterpreter]: Visited 22 different actions 36 times. Merged at 7 different actions 13 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-24 17:32:03,609 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:32:03,609 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:32:03,610 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-24 17:32:03,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:03,624 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:32:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:03,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:32:03,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:32:03,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:32:03,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:03,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:03,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:32:03,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:32:03,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:03,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:03,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:03,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-24 17:32:03,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 17:32:03,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 17:32:03,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:03,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:03,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 17:32:03,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 17:32:03,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:03,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:03,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:03,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-01-24 17:32:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:32:03,886 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:32:04,074 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 34 DAG size of output 30 [2018-01-24 17:32:04,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 17 [2018-01-24 17:32:04,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-01-24 17:32:04,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:04,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:04,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 17:32:04,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-01-24 17:32:04,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:04,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:04,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 17:32:04,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-01-24 17:32:04,256 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:04,260 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:04,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 17 [2018-01-24 17:32:04,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-01-24 17:32:04,265 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:04,269 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:04,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 17:32:04,292 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:53, output treesize:24 [2018-01-24 17:32:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:32:04,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:32:04,471 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:32:04,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:04,476 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:32:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:32:05,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:32:05,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 17:32:05,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 17:32:05,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 17:32:05,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 17:32:05,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,543 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:10 [2018-01-24 17:32:05,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:32:05,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:32:05,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:32:05,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:32:05,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-24 17:32:05,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 17:32:05,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 17:32:05,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 17:32:05,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 17:32:05,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-01-24 17:32:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:32:05,634 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:32:05,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-01-24 17:32:05,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-24 17:32:05,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 42 [2018-01-24 17:32:05,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-24 17:32:05,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2018-01-24 17:32:05,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-24 17:32:05,822 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,825 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 26 [2018-01-24 17:32:05,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-24 17:32:05,829 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,831 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 13 treesize of output 11 [2018-01-24 17:32:05,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-01-24 17:32:05,859 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,860 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 17:32:05,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-01-24 17:32:05,863 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,864 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:32:05,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:32:05,881 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:105, output treesize:7 [2018-01-24 17:32:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:32:05,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:32:05,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11, 9, 8] total 21 [2018-01-24 17:32:05,898 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:32:05,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 17:32:05,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 17:32:05,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:32:05,899 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-01-24 17:32:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:32:06,082 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-01-24 17:32:06,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:32:06,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-01-24 17:32:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:32:06,083 INFO L225 Difference]: With dead ends: 76 [2018-01-24 17:32:06,084 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 17:32:06,084 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2018-01-24 17:32:06,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 17:32:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-01-24 17:32:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 17:32:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-24 17:32:06,089 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-01-24 17:32:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:32:06,090 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-24 17:32:06,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 17:32:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-24 17:32:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 17:32:06,090 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:32:06,090 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:32:06,090 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 17:32:06,091 INFO L82 PathProgramCache]: Analyzing trace with hash 806501016, now seen corresponding path program 1 times [2018-01-24 17:32:06,091 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:32:06,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:06,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:32:06,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:32:06,092 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:32:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 17:32:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 17:32:06,139 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 17:32:06,153 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 17:32:06,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:32:06 BoogieIcfgContainer [2018-01-24 17:32:06,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:32:06,169 INFO L168 Benchmark]: Toolchain (without parser) took 7028.10 ms. Allocated memory was 303.6 MB in the beginning and 502.3 MB in the end (delta: 198.7 MB). Free memory was 260.3 MB in the beginning and 322.4 MB in the end (delta: -62.1 MB). Peak memory consumption was 136.7 MB. Max. memory is 5.3 GB. [2018-01-24 17:32:06,170 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 303.6 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:32:06,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.69 ms. Allocated memory is still 303.6 MB. Free memory was 260.3 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:32:06,170 INFO L168 Benchmark]: Boogie Preprocessor took 41.84 ms. Allocated memory is still 303.6 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:32:06,171 INFO L168 Benchmark]: RCFGBuilder took 300.55 ms. Allocated memory is still 303.6 MB. Free memory was 248.3 MB in the beginning and 227.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:32:06,171 INFO L168 Benchmark]: TraceAbstraction took 6422.50 ms. Allocated memory was 303.6 MB in the beginning and 502.3 MB in the end (delta: 198.7 MB). Free memory was 227.3 MB in the beginning and 322.4 MB in the end (delta: -95.0 MB). Peak memory consumption was 103.7 MB. Max. memory is 5.3 GB. [2018-01-24 17:32:06,173 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 303.6 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 250.69 ms. Allocated memory is still 303.6 MB. Free memory was 260.3 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.84 ms. Allocated memory is still 303.6 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 300.55 ms. Allocated memory is still 303.6 MB. Free memory was 248.3 MB in the beginning and 227.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6422.50 ms. Allocated memory was 303.6 MB in the beginning and 502.3 MB in the end (delta: 198.7 MB). Free memory was 227.3 MB in the beginning and 322.4 MB in the end (delta: -95.0 MB). Peak memory consumption was 103.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 215 LocStat_NO_SUPPORTING_DISEQUALITIES : 67 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.436717 RENAME_VARIABLES(MILLISECONDS) : 6.612838 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.351745 PROJECTAWAY(MILLISECONDS) : 0.780441 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001594 DISJOIN(MILLISECONDS) : 2.218472 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 6.698102 ADD_EQUALITY(MILLISECONDS) : 0.031813 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.065784 #CONJOIN_DISJUNCTIVE : 63 #RENAME_VARIABLES : 108 #UNFREEZE : 0 #CONJOIN : 107 #PROJECTAWAY : 80 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 103 #ADD_EQUALITY : 52 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={10:0}] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L628] COND FALSE !(a == 0) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L629] List t; [L630] List p = a; VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] FCALL p->h = 1 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L639] FCALL p->n = 0 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L640] p = a VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L641] COND TRUE p!=0 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L642] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=1] [L642] COND FALSE !(p->h != 1) [L645] EXPR, FCALL p->n VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->n={0:0}] [L645] p = p->n [L641] COND FALSE !(p!=0) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={0:0}] [L647] return 0; VAL [\result=0, a={10:0}, malloc(sizeof(struct node))={10:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 15 error locations. UNSAFE Result, 6.3s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 226 SDtfs, 687 SDslu, 418 SDs, 0 SdLazy, 505 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 86 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 74 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 211 ConstructedInterpolants, 1 QuantifiedInterpolants, 32803 SizeOfPredicates, 28 NumberOfNonLiveVariables, 190 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 11/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-32-06-183.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-32-06-183.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-32-06-183.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-32-06-183.csv Received shutdown request...