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_smtcomp.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:22:44,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:22:44,030 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:22:44,045 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:22:44,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:22:44,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:22:44,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:22:44,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:22:44,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:22:44,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:22:44,053 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:22:44,053 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:22:44,054 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:22:44,055 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:22:44,056 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:22:44,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:22:44,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:22:44,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:22:44,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:22:44,065 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:22:44,068 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:22:44,068 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:22:44,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:22:44,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:22:44,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:22:44,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:22:44,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:22:44,072 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:22:44,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:22:44,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:22:44,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:22:44,073 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_smtcomp.epf [2018-01-25 06:22:44,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:22:44,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:22:44,083 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:22:44,083 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:22:44,083 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:22:44,083 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:22:44,083 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:22:44,083 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:22:44,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:22:44,084 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:22:44,084 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:22:44,084 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:22:44,084 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:22:44,084 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:22:44,085 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:22:44,085 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:22:44,085 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:22:44,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:22:44,085 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:22:44,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:22:44,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:22:44,086 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:22:44,086 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:22:44,086 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:22:44,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:22:44,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:22:44,087 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:22:44,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:22:44,087 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:22:44,087 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:22:44,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:22:44,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:22:44,087 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:22:44,087 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:22:44,088 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:22:44,088 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:22:44,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:22:44,131 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:22:44,134 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:22:44,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:22:44,136 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:22:44,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:22:44,293 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:22:44,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:22:44,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:22:44,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:22:44,303 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:22:44,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:22:44" (1/1) ... [2018-01-25 06:22:44,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ea857c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:22:44, skipping insertion in model container [2018-01-25 06:22:44,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:22:44" (1/1) ... [2018-01-25 06:22:44,319 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:22:44,359 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:22:44,481 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:22:44,504 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:22:44,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:22:44 WrapperNode [2018-01-25 06:22:44,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:22:44,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:22:44,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:22:44,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:22:44,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:22:44" (1/1) ... [2018-01-25 06:22:44,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:22:44" (1/1) ... [2018-01-25 06:22:44,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:22:44" (1/1) ... [2018-01-25 06:22:44,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:22:44" (1/1) ... [2018-01-25 06:22:44,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:22:44" (1/1) ... [2018-01-25 06:22:44,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:22:44" (1/1) ... [2018-01-25 06:22:44,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:22:44" (1/1) ... [2018-01-25 06:22:44,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:22:44,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:22:44,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:22:44,562 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:22:44,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:22:44" (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-25 06:22:44,615 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:22:44,616 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:22:44,616 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:22:44,616 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:22:44,616 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:22:44,616 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:22:44,616 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:22:44,617 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:22:44,617 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:22:44,617 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:22:44,617 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:22:44,617 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:22:44,617 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:22:44,618 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 06:22:44,618 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:22:44,618 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:22:44,618 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:22:45,133 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:22:45,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:22:45 BoogieIcfgContainer [2018-01-25 06:22:45,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:22:45,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:22:45,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:22:45,137 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:22:45,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:22:44" (1/3) ... [2018-01-25 06:22:45,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e217f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:22:45, skipping insertion in model container [2018-01-25 06:22:45,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:22:44" (2/3) ... [2018-01-25 06:22:45,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e217f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:22:45, skipping insertion in model container [2018-01-25 06:22:45,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:22:45" (3/3) ... [2018-01-25 06:22:45,140 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:22:45,147 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:22:45,153 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-01-25 06:22:45,199 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:22:45,199 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:22:45,199 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:22:45,199 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:22:45,200 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:22:45,200 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:22:45,200 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:22:45,200 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:22:45,200 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:22:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-25 06:22:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:22:45,229 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:45,230 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:45,230 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:45,236 INFO L82 PathProgramCache]: Analyzing trace with hash 437540254, now seen corresponding path program 1 times [2018-01-25 06:22:45,238 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:45,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:45,289 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:45,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:45,289 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:45,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:45,391 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-25 06:22:45,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:45,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:22:45,393 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:45,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:22:45,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:22:45,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:22:45,409 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 4 states. [2018-01-25 06:22:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:45,741 INFO L93 Difference]: Finished difference Result 227 states and 260 transitions. [2018-01-25 06:22:45,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:22:45,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:22:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:45,754 INFO L225 Difference]: With dead ends: 227 [2018-01-25 06:22:45,755 INFO L226 Difference]: Without dead ends: 154 [2018-01-25 06:22:45,758 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-25 06:22:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-25 06:22:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2018-01-25 06:22:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 06:22:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2018-01-25 06:22:45,799 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 8 [2018-01-25 06:22:45,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:45,800 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2018-01-25 06:22:45,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:22:45,800 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2018-01-25 06:22:45,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:22:45,800 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:45,801 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:45,801 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:45,801 INFO L82 PathProgramCache]: Analyzing trace with hash 437540255, now seen corresponding path program 1 times [2018-01-25 06:22:45,801 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:45,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:45,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:45,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:45,803 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:45,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:45,900 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-25 06:22:45,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:45,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:22:45,901 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:45,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:22:45,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:22:45,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:22:45,903 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand 4 states. [2018-01-25 06:22:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:46,154 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2018-01-25 06:22:46,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:22:46,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:22:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:46,156 INFO L225 Difference]: With dead ends: 138 [2018-01-25 06:22:46,156 INFO L226 Difference]: Without dead ends: 130 [2018-01-25 06:22:46,157 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-25 06:22:46,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-25 06:22:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-01-25 06:22:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 06:22:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2018-01-25 06:22:46,166 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 8 [2018-01-25 06:22:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:46,166 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2018-01-25 06:22:46,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:22:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2018-01-25 06:22:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 06:22:46,166 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:46,167 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:46,167 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:46,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1223362610, now seen corresponding path program 1 times [2018-01-25 06:22:46,167 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:46,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:46,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:46,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:46,168 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:46,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:46,234 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-25 06:22:46,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:46,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:22:46,234 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:46,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:22:46,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:22:46,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:22:46,235 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand 5 states. [2018-01-25 06:22:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:46,591 INFO L93 Difference]: Finished difference Result 271 states and 295 transitions. [2018-01-25 06:22:46,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:22:46,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 06:22:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:46,594 INFO L225 Difference]: With dead ends: 271 [2018-01-25 06:22:46,594 INFO L226 Difference]: Without dead ends: 270 [2018-01-25 06:22:46,595 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:22:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-01-25 06:22:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 124. [2018-01-25 06:22:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 06:22:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-01-25 06:22:46,609 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 15 [2018-01-25 06:22:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:46,609 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-01-25 06:22:46,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:22:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-01-25 06:22:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 06:22:46,610 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:46,610 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:46,610 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:46,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1223362609, now seen corresponding path program 1 times [2018-01-25 06:22:46,611 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:46,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:46,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:46,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:46,612 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:46,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:46,722 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-25 06:22:46,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:46,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:22:46,723 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:46,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:22:46,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:22:46,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:22:46,724 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 5 states. [2018-01-25 06:22:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:47,023 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2018-01-25 06:22:47,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:22:47,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 06:22:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:47,025 INFO L225 Difference]: With dead ends: 226 [2018-01-25 06:22:47,025 INFO L226 Difference]: Without dead ends: 225 [2018-01-25 06:22:47,026 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:22:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-25 06:22:47,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 123. [2018-01-25 06:22:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 06:22:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-01-25 06:22:47,038 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 15 [2018-01-25 06:22:47,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:47,038 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-01-25 06:22:47,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:22:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-01-25 06:22:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:22:47,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:47,040 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-25 06:22:47,040 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1355242881, now seen corresponding path program 1 times [2018-01-25 06:22:47,040 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:47,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:47,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:47,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:47,041 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:47,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:47,109 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-25 06:22:47,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:47,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:22:47,110 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:47,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:22:47,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:22:47,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:22:47,111 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 4 states. [2018-01-25 06:22:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:47,244 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-01-25 06:22:47,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:22:47,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-25 06:22:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:47,246 INFO L225 Difference]: With dead ends: 143 [2018-01-25 06:22:47,246 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 06:22:47,246 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-25 06:22:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 06:22:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-01-25 06:22:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 06:22:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2018-01-25 06:22:47,257 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 19 [2018-01-25 06:22:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:47,257 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2018-01-25 06:22:47,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:22:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2018-01-25 06:22:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:22:47,258 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:47,258 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-25 06:22:47,258 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:47,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1355242882, now seen corresponding path program 1 times [2018-01-25 06:22:47,259 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:47,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:47,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:47,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:47,260 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:47,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:47,337 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-25 06:22:47,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:47,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:22:47,338 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:47,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:22:47,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:22:47,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:22:47,338 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 5 states. [2018-01-25 06:22:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:47,491 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-01-25 06:22:47,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:22:47,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-25 06:22:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:47,492 INFO L225 Difference]: With dead ends: 175 [2018-01-25 06:22:47,492 INFO L226 Difference]: Without dead ends: 164 [2018-01-25 06:22:47,492 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:22:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-25 06:22:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2018-01-25 06:22:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-25 06:22:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2018-01-25 06:22:47,503 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 19 [2018-01-25 06:22:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:47,503 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2018-01-25 06:22:47,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:22:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2018-01-25 06:22:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:22:47,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:47,504 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:47,505 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:47,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1348114365, now seen corresponding path program 1 times [2018-01-25 06:22:47,505 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:47,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:47,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:47,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:47,506 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:47,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:47,589 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-25 06:22:47,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:47,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:22:47,589 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:47,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:22:47,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:22:47,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:22:47,590 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand 6 states. [2018-01-25 06:22:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:47,840 INFO L93 Difference]: Finished difference Result 212 states and 246 transitions. [2018-01-25 06:22:47,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:22:47,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 06:22:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:47,841 INFO L225 Difference]: With dead ends: 212 [2018-01-25 06:22:47,841 INFO L226 Difference]: Without dead ends: 211 [2018-01-25 06:22:47,842 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-25 06:22:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-25 06:22:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 146. [2018-01-25 06:22:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-25 06:22:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2018-01-25 06:22:47,848 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 22 [2018-01-25 06:22:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:47,849 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2018-01-25 06:22:47,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:22:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2018-01-25 06:22:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:22:47,849 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:47,849 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:47,850 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:47,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1348114366, now seen corresponding path program 1 times [2018-01-25 06:22:47,850 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:47,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:47,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:47,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:47,851 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:47,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:47,948 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-25 06:22:47,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:47,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:22:47,949 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:47,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:22:47,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:22:47,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:22:47,949 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand 6 states. [2018-01-25 06:22:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:48,611 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2018-01-25 06:22:48,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:22:48,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 06:22:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:48,613 INFO L225 Difference]: With dead ends: 232 [2018-01-25 06:22:48,613 INFO L226 Difference]: Without dead ends: 222 [2018-01-25 06:22:48,614 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:22:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-25 06:22:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 130. [2018-01-25 06:22:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-25 06:22:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2018-01-25 06:22:48,624 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 22 [2018-01-25 06:22:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:48,624 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2018-01-25 06:22:48,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:22:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2018-01-25 06:22:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 06:22:48,625 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:48,625 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:48,625 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1821397366, now seen corresponding path program 1 times [2018-01-25 06:22:48,626 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:48,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:48,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:48,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:48,627 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:48,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:48,665 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-25 06:22:48,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:48,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:22:48,666 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:48,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:22:48,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:22:48,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:22:48,667 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 5 states. [2018-01-25 06:22:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:48,801 INFO L93 Difference]: Finished difference Result 183 states and 209 transitions. [2018-01-25 06:22:48,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:22:48,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-25 06:22:48,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:48,802 INFO L225 Difference]: With dead ends: 183 [2018-01-25 06:22:48,802 INFO L226 Difference]: Without dead ends: 148 [2018-01-25 06:22:48,804 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-25 06:22:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-25 06:22:48,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2018-01-25 06:22:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-25 06:22:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2018-01-25 06:22:48,815 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 25 [2018-01-25 06:22:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:48,815 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2018-01-25 06:22:48,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:22:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2018-01-25 06:22:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:22:48,817 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:48,817 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-25 06:22:48,817 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:48,817 INFO L82 PathProgramCache]: Analyzing trace with hash 203248485, now seen corresponding path program 1 times [2018-01-25 06:22:48,817 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:48,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:48,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:48,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:48,821 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:48,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:48,875 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-25 06:22:48,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:48,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:22:48,875 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:48,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:22:48,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:22:48,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:22:48,876 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand 4 states. [2018-01-25 06:22:48,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:48,903 INFO L93 Difference]: Finished difference Result 230 states and 269 transitions. [2018-01-25 06:22:48,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:22:48,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-25 06:22:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:48,904 INFO L225 Difference]: With dead ends: 230 [2018-01-25 06:22:48,904 INFO L226 Difference]: Without dead ends: 156 [2018-01-25 06:22:48,905 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 06:22:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-25 06:22:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2018-01-25 06:22:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-25 06:22:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2018-01-25 06:22:48,915 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 28 [2018-01-25 06:22:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:48,916 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2018-01-25 06:22:48,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:22:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2018-01-25 06:22:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 06:22:48,917 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:48,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, 1] [2018-01-25 06:22:48,917 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:48,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1370430932, now seen corresponding path program 1 times [2018-01-25 06:22:48,918 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:48,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:48,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:48,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:48,919 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:48,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:48,977 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-25 06:22:48,977 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:48,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:22:48,978 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:48,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:22:48,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:22:48,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:22:48,979 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand 5 states. [2018-01-25 06:22:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:49,241 INFO L93 Difference]: Finished difference Result 233 states and 268 transitions. [2018-01-25 06:22:49,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:22:49,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-25 06:22:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:49,243 INFO L225 Difference]: With dead ends: 233 [2018-01-25 06:22:49,244 INFO L226 Difference]: Without dead ends: 232 [2018-01-25 06:22:49,244 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:22:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-25 06:22:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 133. [2018-01-25 06:22:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 06:22:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2018-01-25 06:22:49,257 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 29 [2018-01-25 06:22:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:49,257 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2018-01-25 06:22:49,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:22:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2018-01-25 06:22:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 06:22:49,258 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:49,259 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-25 06:22:49,259 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1370430931, now seen corresponding path program 1 times [2018-01-25 06:22:49,259 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:49,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:49,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:49,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:49,261 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:49,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:49,355 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-25 06:22:49,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:49,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:22:49,356 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:49,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:22:49,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:22:49,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:22:49,357 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 5 states. [2018-01-25 06:22:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:49,671 INFO L93 Difference]: Finished difference Result 239 states and 277 transitions. [2018-01-25 06:22:49,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:22:49,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-25 06:22:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:49,674 INFO L225 Difference]: With dead ends: 239 [2018-01-25 06:22:49,674 INFO L226 Difference]: Without dead ends: 238 [2018-01-25 06:22:49,674 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:22:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-25 06:22:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 132. [2018-01-25 06:22:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-25 06:22:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2018-01-25 06:22:49,687 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 29 [2018-01-25 06:22:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:49,687 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2018-01-25 06:22:49,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:22:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2018-01-25 06:22:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 06:22:49,689 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:49,689 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:49,689 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:49,690 INFO L82 PathProgramCache]: Analyzing trace with hash 811222786, now seen corresponding path program 1 times [2018-01-25 06:22:49,690 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:49,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:49,691 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:49,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:49,691 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:49,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:49,909 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-25 06:22:49,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:49,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:22:49,910 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:49,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:22:49,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:22:49,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:22:49,911 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand 10 states. [2018-01-25 06:22:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:50,368 INFO L93 Difference]: Finished difference Result 240 states and 274 transitions. [2018-01-25 06:22:50,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:22:50,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-01-25 06:22:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:50,370 INFO L225 Difference]: With dead ends: 240 [2018-01-25 06:22:50,370 INFO L226 Difference]: Without dead ends: 239 [2018-01-25 06:22:50,370 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-01-25 06:22:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-01-25 06:22:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 149. [2018-01-25 06:22:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-25 06:22:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2018-01-25 06:22:50,379 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 30 [2018-01-25 06:22:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:50,380 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2018-01-25 06:22:50,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:22:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2018-01-25 06:22:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 06:22:50,380 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:50,381 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:50,381 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:50,381 INFO L82 PathProgramCache]: Analyzing trace with hash 811222787, now seen corresponding path program 1 times [2018-01-25 06:22:50,381 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:50,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:50,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:50,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:50,382 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:50,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:50,623 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-25 06:22:50,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:50,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:22:50,623 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:50,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:22:50,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:22:50,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:22:50,625 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 9 states. [2018-01-25 06:22:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:51,005 INFO L93 Difference]: Finished difference Result 294 states and 336 transitions. [2018-01-25 06:22:51,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:22:51,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-25 06:22:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:51,006 INFO L225 Difference]: With dead ends: 294 [2018-01-25 06:22:51,006 INFO L226 Difference]: Without dead ends: 218 [2018-01-25 06:22:51,007 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2018-01-25 06:22:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-25 06:22:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 145. [2018-01-25 06:22:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-25 06:22:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2018-01-25 06:22:51,020 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 30 [2018-01-25 06:22:51,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:51,020 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2018-01-25 06:22:51,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:22:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2018-01-25 06:22:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 06:22:51,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:51,021 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:51,022 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:51,022 INFO L82 PathProgramCache]: Analyzing trace with hash -518752177, now seen corresponding path program 1 times [2018-01-25 06:22:51,022 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:51,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:51,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:51,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:51,023 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:51,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:51,150 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-25 06:22:51,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:51,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:22:51,150 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:51,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:22:51,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:22:51,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:22:51,151 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 9 states. [2018-01-25 06:22:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:51,737 INFO L93 Difference]: Finished difference Result 399 states and 455 transitions. [2018-01-25 06:22:51,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 06:22:51,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-01-25 06:22:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:51,740 INFO L225 Difference]: With dead ends: 399 [2018-01-25 06:22:51,740 INFO L226 Difference]: Without dead ends: 398 [2018-01-25 06:22:51,741 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-01-25 06:22:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-01-25 06:22:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 161. [2018-01-25 06:22:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-25 06:22:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2018-01-25 06:22:51,759 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 33 [2018-01-25 06:22:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:51,760 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2018-01-25 06:22:51,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:22:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2018-01-25 06:22:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 06:22:51,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:51,760 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:51,761 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:51,761 INFO L82 PathProgramCache]: Analyzing trace with hash -518752176, now seen corresponding path program 1 times [2018-01-25 06:22:51,761 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:51,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:51,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:51,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:51,762 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:51,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:51,948 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-25 06:22:51,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:51,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:22:51,949 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:51,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:22:51,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:22:51,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:22:51,951 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 9 states. [2018-01-25 06:22:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:52,720 INFO L93 Difference]: Finished difference Result 312 states and 355 transitions. [2018-01-25 06:22:52,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 06:22:52,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-01-25 06:22:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:52,722 INFO L225 Difference]: With dead ends: 312 [2018-01-25 06:22:52,722 INFO L226 Difference]: Without dead ends: 311 [2018-01-25 06:22:52,723 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-25 06:22:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-01-25 06:22:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 161. [2018-01-25 06:22:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-25 06:22:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2018-01-25 06:22:52,740 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 33 [2018-01-25 06:22:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:52,741 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2018-01-25 06:22:52,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:22:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2018-01-25 06:22:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:22:52,741 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:52,742 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:52,742 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:52,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1613392636, now seen corresponding path program 1 times [2018-01-25 06:22:52,742 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:52,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:52,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:52,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:52,743 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:52,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:22:52,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:22:52,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:22:52,773 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:22:52,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:22:52,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:22:52,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:22:52,774 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 4 states. [2018-01-25 06:22:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:22:52,811 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2018-01-25 06:22:52,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:22:52,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-25 06:22:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:22:52,812 INFO L225 Difference]: With dead ends: 241 [2018-01-25 06:22:52,813 INFO L226 Difference]: Without dead ends: 172 [2018-01-25 06:22:52,813 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 06:22:52,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-25 06:22:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2018-01-25 06:22:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-25 06:22:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2018-01-25 06:22:52,829 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 36 [2018-01-25 06:22:52,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:22:52,830 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2018-01-25 06:22:52,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:22:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2018-01-25 06:22:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 06:22:52,831 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:22:52,831 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:22:52,831 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:22:52,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1298991553, now seen corresponding path program 1 times [2018-01-25 06:22:52,831 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:22:52,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:52,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:22:52,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:22:52,832 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:22:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:22:52,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:22:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:22:52,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:22:52,981 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:22:52,982 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-25 06:22:52,984 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [24], [35], [36], [39], [43], [47], [49], [52], [107], [111], [117], [121], [122], [123], [125], [134], [136], [148], [150], [155], [156], [159], [165], [169], [175], [178], [222], [223], [227], [228], [229] [2018-01-25 06:22:53,034 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:22:53,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 06:23:41,750 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 06:23:41,751 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 06:23:41,751 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:23:41,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:23:41,752 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-25 06:23:41,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:23:41,758 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:23:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:23:41,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:23:41,804 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:23:41,805 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:23:41,811 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:23:41,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:23:41 BoogieIcfgContainer [2018-01-25 06:23:41,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:23:41,812 INFO L168 Benchmark]: Toolchain (without parser) took 57518.54 ms. Allocated memory was 296.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 256.8 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 188.7 MB. Max. memory is 5.3 GB. [2018-01-25 06:23:41,813 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 296.7 MB. Free memory is still 262.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:23:41,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.71 ms. Allocated memory is still 296.7 MB. Free memory was 255.8 MB in the beginning and 243.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:23:41,814 INFO L168 Benchmark]: Boogie Preprocessor took 45.77 ms. Allocated memory is still 296.7 MB. Free memory was 243.7 MB in the beginning and 241.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:23:41,814 INFO L168 Benchmark]: RCFGBuilder took 572.77 ms. Allocated memory is still 296.7 MB. Free memory was 241.7 MB in the beginning and 205.1 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 5.3 GB. [2018-01-25 06:23:41,814 INFO L168 Benchmark]: TraceAbstraction took 56676.23 ms. Allocated memory was 296.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 205.1 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 137.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:23:41,816 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.12 ms. Allocated memory is still 296.7 MB. Free memory is still 262.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.71 ms. Allocated memory is still 296.7 MB. Free memory was 255.8 MB in the beginning and 243.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.77 ms. Allocated memory is still 296.7 MB. Free memory was 243.7 MB in the beginning and 241.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 572.77 ms. Allocated memory is still 296.7 MB. Free memory was 241.7 MB in the beginning and 205.1 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56676.23 ms. Allocated memory was 296.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 205.1 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 137.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 63 error locations. TIMEOUT Result, 56.6s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1839 SDtfs, 3613 SDslu, 4060 SDs, 0 SdLazy, 4130 SolverSat, 267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 48.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1258 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 57112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-23-41-825.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-23-41-825.csv Completed graceful shutdown