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/forester-heap/sll-queue_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:37:48,680 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:37:48,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:37:48,695 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:37:48,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:37:48,696 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:37:48,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:37:48,699 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:37:48,701 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:37:48,702 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:37:48,703 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:37:48,703 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:37:48,704 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:37:48,706 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:37:48,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:37:48,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:37:48,712 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:37:48,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:37:48,715 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:37:48,716 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:37:48,718 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:37:48,719 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:37:48,719 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:37:48,720 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:37:48,721 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:37:48,722 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:37:48,722 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:37:48,723 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:37:48,723 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:37:48,723 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:37:48,724 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:37:48,724 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:37:48,734 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:37:48,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:37:48,735 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:37:48,735 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:37:48,736 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:37:48,736 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:37:48,736 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:37:48,736 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:37:48,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:37:48,737 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:37:48,737 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:37:48,737 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:37:48,738 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:37:48,738 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:37:48,738 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:37:48,738 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:37:48,738 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:37:48,739 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:37:48,739 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:37:48,739 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:37:48,739 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:37:48,739 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:37:48,740 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:37:48,740 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:37:48,740 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:37:48,740 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:37:48,741 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:37:48,741 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:37:48,741 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:37:48,741 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:37:48,741 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:37:48,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:37:48,742 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:37:48,742 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:37:48,743 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:37:48,743 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:37:48,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:37:48,790 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:37:48,794 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:37:48,796 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:37:48,796 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:37:48,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-queue_true-unreach-call_true-valid-memsafety.i [2018-01-24 17:37:48,965 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:37:48,972 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:37:48,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:37:48,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:37:48,979 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:37:48,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:37:48" (1/1) ... [2018-01-24 17:37:48,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a45686f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:37:48, skipping insertion in model container [2018-01-24 17:37:48,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:37:48" (1/1) ... [2018-01-24 17:37:48,996 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:37:49,039 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:37:49,171 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:37:49,199 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:37:49,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:37:49 WrapperNode [2018-01-24 17:37:49,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:37:49,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:37:49,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:37:49,213 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:37:49,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:37:49" (1/1) ... [2018-01-24 17:37:49,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:37:49" (1/1) ... [2018-01-24 17:37:49,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:37:49" (1/1) ... [2018-01-24 17:37:49,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:37:49" (1/1) ... [2018-01-24 17:37:49,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:37:49" (1/1) ... [2018-01-24 17:37:49,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:37:49" (1/1) ... [2018-01-24 17:37:49,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:37:49" (1/1) ... [2018-01-24 17:37:49,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:37:49,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:37:49,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:37:49,258 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:37:49,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:37:49" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:37:49,309 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:37:49,309 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:37:49,309 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:37:49,309 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:37:49,309 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:37:49,309 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 17:37:49,309 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 17:37:49,309 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:37:49,310 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:37:49,310 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:37:49,310 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:37:49,310 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:37:49,310 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:37:49,310 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 17:37:49,310 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:37:49,310 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:37:49,310 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:37:49,908 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:37:49,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:37:49 BoogieIcfgContainer [2018-01-24 17:37:49,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:37:49,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:37:49,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:37:49,912 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:37:49,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:37:48" (1/3) ... [2018-01-24 17:37:49,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a346697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:37:49, skipping insertion in model container [2018-01-24 17:37:49,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:37:49" (2/3) ... [2018-01-24 17:37:49,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a346697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:37:49, skipping insertion in model container [2018-01-24 17:37:49,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:37:49" (3/3) ... [2018-01-24 17:37:49,917 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-queue_true-unreach-call_true-valid-memsafety.i [2018-01-24 17:37:49,923 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:37:49,931 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-24 17:37:49,974 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:37:49,975 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:37:49,975 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:37:49,975 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:37:49,975 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:37:49,975 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:37:49,975 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:37:49,975 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:37:49,976 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:37:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2018-01-24 17:37:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 17:37:50,004 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:37:50,005 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:37:50,006 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:37:50,010 INFO L82 PathProgramCache]: Analyzing trace with hash 865717012, now seen corresponding path program 1 times [2018-01-24 17:37:50,012 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:37:50,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:50,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:37:50,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:50,056 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:37:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:37:50,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:37:50,182 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:37:50,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:37:50,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:37:50,185 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:37:50,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:37:50,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:37:50,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:37:50,202 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 4 states. [2018-01-24 17:37:50,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:37:50,514 INFO L93 Difference]: Finished difference Result 314 states and 435 transitions. [2018-01-24 17:37:50,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:37:50,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 17:37:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:37:50,529 INFO L225 Difference]: With dead ends: 314 [2018-01-24 17:37:50,529 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 17:37:50,533 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:37:50,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 17:37:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2018-01-24 17:37:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-24 17:37:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2018-01-24 17:37:50,582 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 8 [2018-01-24 17:37:50,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:37:50,582 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-01-24 17:37:50,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:37:50,582 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2018-01-24 17:37:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 17:37:50,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:37:50,583 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:37:50,583 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:37:50,584 INFO L82 PathProgramCache]: Analyzing trace with hash 865717013, now seen corresponding path program 1 times [2018-01-24 17:37:50,584 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:37:50,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:50,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:37:50,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:50,585 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:37:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:37:50,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:37:50,706 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:37:50,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:37:50,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:37:50,707 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:37:50,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:37:50,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:37:50,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:37:50,709 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 4 states. [2018-01-24 17:37:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:37:50,883 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2018-01-24 17:37:50,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:37:50,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 17:37:50,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:37:50,886 INFO L225 Difference]: With dead ends: 157 [2018-01-24 17:37:50,886 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 17:37:50,889 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:37:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 17:37:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2018-01-24 17:37:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 17:37:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-01-24 17:37:50,902 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 8 [2018-01-24 17:37:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:37:50,902 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-01-24 17:37:50,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:37:50,903 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-01-24 17:37:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 17:37:50,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:37:50,904 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:37:50,904 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:37:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1721247779, now seen corresponding path program 1 times [2018-01-24 17:37:50,905 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:37:50,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:50,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:37:50,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:50,907 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:37:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:37:50,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:37:51,013 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:37:51,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:37:51,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:37:51,013 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:37:51,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:37:51,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:37:51,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:37:51,014 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 4 states. [2018-01-24 17:37:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:37:51,111 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2018-01-24 17:37:51,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:37:51,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 17:37:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:37:51,112 INFO L225 Difference]: With dead ends: 154 [2018-01-24 17:37:51,113 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 17:37:51,113 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:37:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 17:37:51,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 142. [2018-01-24 17:37:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 17:37:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2018-01-24 17:37:51,126 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 15 [2018-01-24 17:37:51,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:37:51,126 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2018-01-24 17:37:51,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:37:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2018-01-24 17:37:51,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 17:37:51,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:37:51,128 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:37:51,128 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:37:51,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1721247778, now seen corresponding path program 1 times [2018-01-24 17:37:51,128 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:37:51,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:51,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:37:51,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:51,130 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:37:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:37:51,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:37:51,259 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:37:51,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:37:51,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:37:51,260 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:37:51,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:37:51,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:37:51,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:37:51,261 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand 7 states. [2018-01-24 17:37:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:37:51,609 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2018-01-24 17:37:51,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:37:51,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-24 17:37:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:37:51,611 INFO L225 Difference]: With dead ends: 226 [2018-01-24 17:37:51,611 INFO L226 Difference]: Without dead ends: 223 [2018-01-24 17:37:51,612 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:37:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-24 17:37:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 148. [2018-01-24 17:37:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-24 17:37:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2018-01-24 17:37:51,626 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 15 [2018-01-24 17:37:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:37:51,627 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2018-01-24 17:37:51,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:37:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2018-01-24 17:37:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 17:37:51,628 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:37:51,628 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:37:51,628 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:37:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash -78043106, now seen corresponding path program 1 times [2018-01-24 17:37:51,629 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:37:51,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:51,630 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:37:51,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:51,630 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:37:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:37:51,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:37:51,691 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:37:51,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:37:51,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:37:51,692 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:37:51,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:37:51,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:37:51,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:37:51,693 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 6 states. [2018-01-24 17:37:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:37:52,043 INFO L93 Difference]: Finished difference Result 243 states and 261 transitions. [2018-01-24 17:37:52,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:37:52,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 17:37:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:37:52,046 INFO L225 Difference]: With dead ends: 243 [2018-01-24 17:37:52,046 INFO L226 Difference]: Without dead ends: 242 [2018-01-24 17:37:52,046 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:37:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-24 17:37:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 147. [2018-01-24 17:37:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-24 17:37:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 160 transitions. [2018-01-24 17:37:52,057 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 160 transitions. Word has length 18 [2018-01-24 17:37:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:37:52,057 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 160 transitions. [2018-01-24 17:37:52,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:37:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2018-01-24 17:37:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 17:37:52,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:37:52,058 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:37:52,058 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:37:52,058 INFO L82 PathProgramCache]: Analyzing trace with hash -78043105, now seen corresponding path program 1 times [2018-01-24 17:37:52,058 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:37:52,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:52,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:37:52,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:52,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:37:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:37:52,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:37:52,192 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:37:52,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:37:52,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:37:52,192 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:37:52,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:37:52,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:37:52,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:37:52,193 INFO L87 Difference]: Start difference. First operand 147 states and 160 transitions. Second operand 6 states. [2018-01-24 17:37:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:37:52,456 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2018-01-24 17:37:52,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:37:52,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 17:37:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:37:52,458 INFO L225 Difference]: With dead ends: 250 [2018-01-24 17:37:52,458 INFO L226 Difference]: Without dead ends: 244 [2018-01-24 17:37:52,458 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:37:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-24 17:37:52,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 135. [2018-01-24 17:37:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 17:37:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2018-01-24 17:37:52,468 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 18 [2018-01-24 17:37:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:37:52,468 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-01-24 17:37:52,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:37:52,469 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2018-01-24 17:37:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:37:52,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:37:52,470 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] [2018-01-24 17:37:52,470 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:37:52,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1676211553, now seen corresponding path program 1 times [2018-01-24 17:37:52,471 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:37:52,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:52,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:37:52,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:52,472 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:37:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:37:52,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:37:52,602 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:37:52,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:37:52,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:37:52,603 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:37:52,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:37:52,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:37:52,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:37:52,604 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 6 states. [2018-01-24 17:37:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:37:52,902 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2018-01-24 17:37:52,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:37:52,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 17:37:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:37:52,904 INFO L225 Difference]: With dead ends: 254 [2018-01-24 17:37:52,904 INFO L226 Difference]: Without dead ends: 218 [2018-01-24 17:37:52,905 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:37:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-24 17:37:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 194. [2018-01-24 17:37:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-24 17:37:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 224 transitions. [2018-01-24 17:37:52,915 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 224 transitions. Word has length 28 [2018-01-24 17:37:52,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:37:52,915 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 224 transitions. [2018-01-24 17:37:52,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:37:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 224 transitions. [2018-01-24 17:37:52,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:37:52,917 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:37:52,917 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] [2018-01-24 17:37:52,917 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:37:52,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1668173361, now seen corresponding path program 1 times [2018-01-24 17:37:52,918 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:37:52,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:52,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:37:52,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:52,919 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:37:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:37:52,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:37:52,953 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:37:52,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:37:52,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:37:52,953 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:37:52,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:37:52,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:37:52,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:37:52,954 INFO L87 Difference]: Start difference. First operand 194 states and 224 transitions. Second operand 3 states. [2018-01-24 17:37:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:37:53,034 INFO L93 Difference]: Finished difference Result 351 states and 397 transitions. [2018-01-24 17:37:53,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:37:53,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 17:37:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:37:53,035 INFO L225 Difference]: With dead ends: 351 [2018-01-24 17:37:53,035 INFO L226 Difference]: Without dead ends: 174 [2018-01-24 17:37:53,036 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 17:37:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-24 17:37:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 156. [2018-01-24 17:37:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-24 17:37:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2018-01-24 17:37:53,044 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 28 [2018-01-24 17:37:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:37:53,044 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2018-01-24 17:37:53,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:37:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2018-01-24 17:37:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:37:53,046 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:37:53,046 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] [2018-01-24 17:37:53,046 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:37:53,046 INFO L82 PathProgramCache]: Analyzing trace with hash -366492937, now seen corresponding path program 1 times [2018-01-24 17:37:53,047 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:37:53,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:53,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:37:53,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:53,048 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:37:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:37:53,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:37:53,116 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:37:53,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:37:53,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:37:53,117 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:37:53,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:37:53,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:37:53,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:37:53,117 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand 4 states. [2018-01-24 17:37:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:37:53,293 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2018-01-24 17:37:53,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:37:53,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-24 17:37:53,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:37:53,295 INFO L225 Difference]: With dead ends: 159 [2018-01-24 17:37:53,295 INFO L226 Difference]: Without dead ends: 156 [2018-01-24 17:37:53,295 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:37:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-24 17:37:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-24 17:37:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-24 17:37:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2018-01-24 17:37:53,301 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 29 [2018-01-24 17:37:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:37:53,302 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2018-01-24 17:37:53,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:37:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2018-01-24 17:37:53,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 17:37:53,303 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:37:53,303 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:37:53,303 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:37:53,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1827708399, now seen corresponding path program 1 times [2018-01-24 17:37:53,304 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:37:53,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:53,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:37:53,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:37:53,305 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:37:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:37:53,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:37:53,383 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:37:53,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:37:53,384 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:37:53,385 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-24 17:37:53,386 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [12], [14], [17], [98], [103], [107], [155], [222], [344], [346], [349], [353], [355], [360], [364], [404], [410], [411], [412], [414], [415], [424], [425], [429], [430], [431] [2018-01-24 17:37:53,427 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:37:53,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:37:53,657 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 17:37:53,658 INFO L268 AbstractInterpreter]: Visited 31 different actions 33 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 17:37:53,673 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 17:37:53,905 INFO L232 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 65.08% of their original sizes. [2018-01-24 17:37:53,905 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 17:37:54,230 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 17:37:54,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:37:54,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [8] total 26 [2018-01-24 17:37:54,231 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:37:54,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 17:37:54,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 17:37:54,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-01-24 17:37:54,232 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 20 states. [2018-01-24 17:37:56,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 17:37:56,100 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCongruenceClosure.(WeqCongruenceClosure.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.copyWeqCc(WeqCcManager.java:1327) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.isStrongerThan(WeqCcManager.java:582) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.isStrongerThan(EqConstraint.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.isSubsetOf(EqState.java:199) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.isSubsetOf(EqState.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.getMaximalElements(DisjunctiveAbstractState.java:565) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.crossProduct(DisjunctiveAbstractState.java:407) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.intersect(DisjunctiveAbstractState.java:291) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntPredicateUnifier.lambda$3(CegarAbsIntRunner.java:684) at java.util.stream.ReduceOps$2ReducingSink.accept(ReduceOps.java:123) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.reduce(ReferencePipeline.java:479) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntPredicateUnifier.getOrConstructPredicateForConjunction(CegarAbsIntRunner.java:684) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1054) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:956) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:185) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:552) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:522) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 17:37:56,104 INFO L168 Benchmark]: Toolchain (without parser) took 7138.62 ms. Allocated memory was 305.7 MB in the beginning and 553.6 MB in the end (delta: 248.0 MB). Free memory was 264.6 MB in the beginning and 359.9 MB in the end (delta: -95.3 MB). Peak memory consumption was 152.7 MB. Max. memory is 5.3 GB. [2018-01-24 17:37:56,105 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:37:56,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.23 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 252.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:37:56,106 INFO L168 Benchmark]: Boogie Preprocessor took 45.12 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 248.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:37:56,106 INFO L168 Benchmark]: RCFGBuilder took 651.28 ms. Allocated memory is still 305.7 MB. Free memory was 248.6 MB in the beginning and 209.7 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 5.3 GB. [2018-01-24 17:37:56,107 INFO L168 Benchmark]: TraceAbstraction took 6193.28 ms. Allocated memory was 305.7 MB in the beginning and 553.6 MB in the end (delta: 248.0 MB). Free memory was 209.7 MB in the beginning and 359.9 MB in the end (delta: -150.2 MB). Peak memory consumption was 97.8 MB. Max. memory is 5.3 GB. [2018-01-24 17:37:56,108 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 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 239.23 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 252.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.12 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 248.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 651.28 ms. Allocated memory is still 305.7 MB. Free memory was 248.6 MB in the beginning and 209.7 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6193.28 ms. Allocated memory was 305.7 MB in the beginning and 553.6 MB in the end (delta: 248.0 MB). Free memory was 209.7 MB in the beginning and 359.9 MB in the end (delta: -150.2 MB). Peak memory consumption was 97.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 350 LocStat_NO_SUPPORTING_DISEQUALITIES : 107 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.301537 RENAME_VARIABLES(MILLISECONDS) : 0.566612 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.620739 PROJECTAWAY(MILLISECONDS) : 0.467576 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001719 DISJOIN(MILLISECONDS) : 1.562876 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.619978 ADD_EQUALITY(MILLISECONDS) : 0.054468 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019963 #CONJOIN_DISJUNCTIVE : 56 #RENAME_VARIABLES : 90 #UNFREEZE : 0 #CONJOIN : 134 #PROJECTAWAY : 80 #ADD_WEAK_EQUALITY : 16 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 81 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCongruenceClosure.(WeqCongruenceClosure.java:157) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-37-56-119.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-37-56-119.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-37-56-119.csv Received shutdown request...