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_preciseopt.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:49:29,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:49:29,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:49:29,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:49:29,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:49:29,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:49:29,220 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:49:29,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:49:29,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:49:29,223 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:49:29,224 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:49:29,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:49:29,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:49:29,225 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:49:29,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:49:29,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:49:29,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:49:29,232 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:49:29,233 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:49:29,234 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:49:29,237 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:49:29,237 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:49:29,237 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:49:29,238 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:49:29,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:49:29,240 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:49:29,240 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:49:29,240 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:49:29,241 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:49:29,241 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:49:29,241 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:49:29,242 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_preciseopt.epf [2018-01-25 03:49:29,251 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:49:29,251 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:49:29,252 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:49:29,252 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:49:29,252 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:49:29,253 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:49:29,253 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:49:29,253 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:49:29,253 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:49:29,254 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:49:29,254 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:49:29,254 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:49:29,254 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:49:29,255 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:49:29,255 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:49:29,255 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:49:29,255 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:49:29,255 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:49:29,256 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:49:29,256 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:49:29,256 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:49:29,256 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:49:29,256 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:49:29,257 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:49:29,257 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:49:29,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:49:29,257 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:49:29,257 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:49:29,258 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:49:29,258 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:49:29,258 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:49:29,258 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:49:29,258 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:49:29,259 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:49:29,259 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:49:29,259 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:49:29,260 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:49:29,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:49:29,304 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:49:29,308 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:49:29,310 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:49:29,310 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:49:29,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-25 03:49:29,506 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:49:29,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:49:29,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:49:29,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:49:29,516 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:49:29,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:49:29" (1/1) ... [2018-01-25 03:49:29,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be6e797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:49:29, skipping insertion in model container [2018-01-25 03:49:29,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:49:29" (1/1) ... [2018-01-25 03:49:29,533 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:49:29,572 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:49:29,697 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:49:29,721 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:49:29,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:49:29 WrapperNode [2018-01-25 03:49:29,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:49:29,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:49:29,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:49:29,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:49:29,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:49:29" (1/1) ... [2018-01-25 03:49:29,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:49:29" (1/1) ... [2018-01-25 03:49:29,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:49:29" (1/1) ... [2018-01-25 03:49:29,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:49:29" (1/1) ... [2018-01-25 03:49:29,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:49:29" (1/1) ... [2018-01-25 03:49:29,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:49:29" (1/1) ... [2018-01-25 03:49:29,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:49:29" (1/1) ... [2018-01-25 03:49:29,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:49:29,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:49:29,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:49:29,773 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:49:29,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:49:29" (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 03:49:29,818 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:49:29,818 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:49:29,819 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:49:29,820 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:49:29,820 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 03:49:29,820 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:49:29,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:49:29,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:49:30,215 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:49:30,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:49:30 BoogieIcfgContainer [2018-01-25 03:49:30,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:49:30,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:49:30,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:49:30,219 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:49:30,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:49:29" (1/3) ... [2018-01-25 03:49:30,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7201a789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:49:30, skipping insertion in model container [2018-01-25 03:49:30,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:49:29" (2/3) ... [2018-01-25 03:49:30,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7201a789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:49:30, skipping insertion in model container [2018-01-25 03:49:30,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:49:30" (3/3) ... [2018-01-25 03:49:30,223 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-25 03:49:30,230 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:49:30,237 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-01-25 03:49:30,277 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:49:30,277 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:49:30,277 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:49:30,277 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:49:30,277 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:49:30,277 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:49:30,277 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:49:30,278 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:49:30,278 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:49:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-01-25 03:49:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 03:49:30,304 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:30,305 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:49:30,305 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:30,309 INFO L82 PathProgramCache]: Analyzing trace with hash -414871971, now seen corresponding path program 1 times [2018-01-25 03:49:30,311 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:30,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:30,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:30,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:30,355 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:30,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:30,467 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 03:49:30,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:30,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:49:30,469 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:30,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:49:30,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:49:30,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:49:30,484 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2018-01-25 03:49:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:30,853 INFO L93 Difference]: Finished difference Result 205 states and 245 transitions. [2018-01-25 03:49:30,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:49:30,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 03:49:30,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:30,864 INFO L225 Difference]: With dead ends: 205 [2018-01-25 03:49:30,865 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 03:49:30,868 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 03:49:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 03:49:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2018-01-25 03:49:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 03:49:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-01-25 03:49:30,909 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 8 [2018-01-25 03:49:30,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:30,909 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-01-25 03:49:30,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:49:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-01-25 03:49:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 03:49:30,910 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:30,910 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:49:30,911 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash -414871970, now seen corresponding path program 1 times [2018-01-25 03:49:30,911 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:30,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:30,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:30,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:30,912 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:30,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:31,040 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 03:49:31,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:31,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:49:31,040 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:31,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:49:31,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:49:31,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:49:31,042 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 4 states. [2018-01-25 03:49:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:31,193 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-01-25 03:49:31,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:49:31,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 03:49:31,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:31,196 INFO L225 Difference]: With dead ends: 107 [2018-01-25 03:49:31,196 INFO L226 Difference]: Without dead ends: 103 [2018-01-25 03:49:31,197 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 03:49:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-25 03:49:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2018-01-25 03:49:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-25 03:49:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-01-25 03:49:31,208 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 8 [2018-01-25 03:49:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:31,208 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-01-25 03:49:31,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:49:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-01-25 03:49:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:49:31,209 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:31,209 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:49:31,210 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:31,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1612643290, now seen corresponding path program 1 times [2018-01-25 03:49:31,210 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:31,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:31,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:31,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:31,212 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:31,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:31,279 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 03:49:31,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:31,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:49:31,294 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:31,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:49:31,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:49:31,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:49:31,295 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 4 states. [2018-01-25 03:49:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:31,457 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-01-25 03:49:31,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:49:31,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 03:49:31,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:31,458 INFO L225 Difference]: With dead ends: 99 [2018-01-25 03:49:31,459 INFO L226 Difference]: Without dead ends: 88 [2018-01-25 03:49:31,459 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 03:49:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-25 03:49:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-01-25 03:49:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-25 03:49:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-25 03:49:31,470 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 14 [2018-01-25 03:49:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:31,471 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-25 03:49:31,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:49:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-25 03:49:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:49:31,472 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:31,472 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:49:31,472 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:31,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1612643291, now seen corresponding path program 1 times [2018-01-25 03:49:31,472 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:31,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:31,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:31,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:31,474 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:31,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:31,582 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 03:49:31,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:31,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:49:31,582 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:31,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:49:31,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:49:31,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:49:31,583 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 5 states. [2018-01-25 03:49:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:31,705 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-01-25 03:49:31,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:49:31,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 03:49:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:31,707 INFO L225 Difference]: With dead ends: 104 [2018-01-25 03:49:31,707 INFO L226 Difference]: Without dead ends: 101 [2018-01-25 03:49:31,707 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 03:49:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-25 03:49:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 88. [2018-01-25 03:49:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-25 03:49:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-01-25 03:49:31,717 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 14 [2018-01-25 03:49:31,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:31,718 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-01-25 03:49:31,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:49:31,718 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-01-25 03:49:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 03:49:31,719 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:31,719 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:49:31,719 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:31,719 INFO L82 PathProgramCache]: Analyzing trace with hash -22797273, now seen corresponding path program 1 times [2018-01-25 03:49:31,720 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:31,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:31,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:31,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:31,721 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:31,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:31,801 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 03:49:31,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:31,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:49:31,802 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:31,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:49:31,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:49:31,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:49:31,803 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 6 states. [2018-01-25 03:49:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:32,071 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-01-25 03:49:32,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:49:32,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 03:49:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:32,073 INFO L225 Difference]: With dead ends: 133 [2018-01-25 03:49:32,073 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 03:49:32,074 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 03:49:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 03:49:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2018-01-25 03:49:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-25 03:49:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-25 03:49:32,085 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 18 [2018-01-25 03:49:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:32,085 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-25 03:49:32,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:49:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-25 03:49:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 03:49:32,087 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:32,087 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:49:32,087 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash -22797272, now seen corresponding path program 1 times [2018-01-25 03:49:32,088 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:32,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:32,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:32,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:32,089 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:32,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:32,185 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 03:49:32,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:32,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:49:32,186 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:32,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:49:32,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:49:32,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:49:32,187 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-01-25 03:49:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:32,466 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2018-01-25 03:49:32,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:49:32,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 03:49:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:32,467 INFO L225 Difference]: With dead ends: 136 [2018-01-25 03:49:32,467 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 03:49:32,467 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:49:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 03:49:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2018-01-25 03:49:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 03:49:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-01-25 03:49:32,475 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 18 [2018-01-25 03:49:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:32,475 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-01-25 03:49:32,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:49:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-01-25 03:49:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 03:49:32,476 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:32,477 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:49:32,477 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:32,477 INFO L82 PathProgramCache]: Analyzing trace with hash -152886338, now seen corresponding path program 1 times [2018-01-25 03:49:32,477 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:32,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:32,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:32,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:32,479 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:32,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:32,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 03:49:32,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:32,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:49:32,666 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:32,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:49:32,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:49:32,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:49:32,667 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2018-01-25 03:49:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:32,995 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-01-25 03:49:32,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 03:49:32,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-25 03:49:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:32,996 INFO L225 Difference]: With dead ends: 128 [2018-01-25 03:49:32,996 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 03:49:32,997 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:49:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 03:49:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 86. [2018-01-25 03:49:33,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-25 03:49:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-01-25 03:49:33,004 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 21 [2018-01-25 03:49:33,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:33,005 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-01-25 03:49:33,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:49:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-01-25 03:49:33,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 03:49:33,005 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:33,006 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:49:33,006 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash -152886337, now seen corresponding path program 1 times [2018-01-25 03:49:33,006 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:33,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:33,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:33,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:33,007 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:33,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:49:33,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:33,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:49:33,300 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:33,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:49:33,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:49:33,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:49:33,301 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 9 states. [2018-01-25 03:49:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:33,623 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-01-25 03:49:33,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:49:33,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-25 03:49:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:33,625 INFO L225 Difference]: With dead ends: 163 [2018-01-25 03:49:33,625 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 03:49:33,625 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-01-25 03:49:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 03:49:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 99. [2018-01-25 03:49:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 03:49:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2018-01-25 03:49:33,635 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 21 [2018-01-25 03:49:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:33,635 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2018-01-25 03:49:33,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:49:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2018-01-25 03:49:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 03:49:33,636 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:33,636 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 03:49:33,636 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:33,637 INFO L82 PathProgramCache]: Analyzing trace with hash -986431451, now seen corresponding path program 1 times [2018-01-25 03:49:33,637 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:33,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:33,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:33,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:33,638 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:33,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:33,802 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 03:49:33,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:33,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:49:33,803 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:33,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:49:33,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:49:33,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:49:33,804 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 10 states. [2018-01-25 03:49:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:34,291 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-01-25 03:49:34,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:49:34,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-01-25 03:49:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:34,292 INFO L225 Difference]: With dead ends: 146 [2018-01-25 03:49:34,293 INFO L226 Difference]: Without dead ends: 145 [2018-01-25 03:49:34,293 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-01-25 03:49:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-25 03:49:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2018-01-25 03:49:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 03:49:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-01-25 03:49:34,303 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 25 [2018-01-25 03:49:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:34,304 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-01-25 03:49:34,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:49:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-01-25 03:49:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 03:49:34,305 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:34,305 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 03:49:34,305 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:34,306 INFO L82 PathProgramCache]: Analyzing trace with hash -986431450, now seen corresponding path program 1 times [2018-01-25 03:49:34,306 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:34,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:34,307 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:34,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:34,307 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:34,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:34,599 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 03:49:34,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:34,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:49:34,600 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:34,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:49:34,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:49:34,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:49:34,601 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 9 states. [2018-01-25 03:49:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:35,204 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2018-01-25 03:49:35,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:49:35,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-25 03:49:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:35,205 INFO L225 Difference]: With dead ends: 155 [2018-01-25 03:49:35,205 INFO L226 Difference]: Without dead ends: 154 [2018-01-25 03:49:35,205 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:49:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-25 03:49:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 99. [2018-01-25 03:49:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 03:49:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-01-25 03:49:35,212 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 25 [2018-01-25 03:49:35,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:35,212 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-01-25 03:49:35,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:49:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-01-25 03:49:35,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:49:35,214 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:35,214 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:49:35,214 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:35,214 INFO L82 PathProgramCache]: Analyzing trace with hash -515063564, now seen corresponding path program 1 times [2018-01-25 03:49:35,214 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:35,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:35,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:35,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:35,216 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:35,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:35,311 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 03:49:35,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:35,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:49:35,312 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:35,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:49:35,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:49:35,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:49:35,313 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 7 states. [2018-01-25 03:49:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:35,722 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-01-25 03:49:35,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:49:35,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 03:49:35,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:35,723 INFO L225 Difference]: With dead ends: 136 [2018-01-25 03:49:35,723 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 03:49:35,724 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:49:35,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 03:49:35,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 101. [2018-01-25 03:49:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-25 03:49:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-01-25 03:49:35,731 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 26 [2018-01-25 03:49:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:35,732 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-01-25 03:49:35,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:49:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-01-25 03:49:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:49:35,733 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:35,733 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:49:35,733 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:35,733 INFO L82 PathProgramCache]: Analyzing trace with hash -515063563, now seen corresponding path program 1 times [2018-01-25 03:49:35,734 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:35,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:35,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:35,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:35,735 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:35,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:36,170 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 03:49:36,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:36,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 03:49:36,171 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:36,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 03:49:36,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 03:49:36,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:49:36,172 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 11 states. [2018-01-25 03:49:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:36,526 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-01-25 03:49:36,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:49:36,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-25 03:49:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:36,527 INFO L225 Difference]: With dead ends: 162 [2018-01-25 03:49:36,527 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 03:49:36,527 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:49:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 03:49:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2018-01-25 03:49:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-25 03:49:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2018-01-25 03:49:36,542 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 26 [2018-01-25 03:49:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:36,543 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2018-01-25 03:49:36,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 03:49:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2018-01-25 03:49:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:49:36,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:36,544 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 03:49:36,545 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:36,545 INFO L82 PathProgramCache]: Analyzing trace with hash -90305214, now seen corresponding path program 1 times [2018-01-25 03:49:36,545 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:36,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:36,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:36,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:36,548 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:36,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:36,913 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 03:49:36,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:36,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 03:49:36,913 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:36,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 03:49:36,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 03:49:36,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:49:36,914 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand 13 states. [2018-01-25 03:49:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:37,711 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2018-01-25 03:49:37,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 03:49:37,711 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-01-25 03:49:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:37,712 INFO L225 Difference]: With dead ends: 145 [2018-01-25 03:49:37,712 INFO L226 Difference]: Without dead ends: 141 [2018-01-25 03:49:37,713 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-01-25 03:49:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-25 03:49:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2018-01-25 03:49:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 03:49:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 149 transitions. [2018-01-25 03:49:37,723 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 149 transitions. Word has length 30 [2018-01-25 03:49:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:37,723 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 149 transitions. [2018-01-25 03:49:37,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 03:49:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 149 transitions. [2018-01-25 03:49:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:49:37,724 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:37,724 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 03:49:37,724 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:37,724 INFO L82 PathProgramCache]: Analyzing trace with hash -709364135, now seen corresponding path program 1 times [2018-01-25 03:49:37,725 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:37,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:37,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:37,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:37,725 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:37,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:37,921 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 03:49:37,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:37,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:49:37,922 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:37,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:49:37,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:49:37,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:49:37,923 INFO L87 Difference]: Start difference. First operand 125 states and 149 transitions. Second operand 10 states. [2018-01-25 03:49:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:38,225 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2018-01-25 03:49:38,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 03:49:38,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-01-25 03:49:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:38,226 INFO L225 Difference]: With dead ends: 145 [2018-01-25 03:49:38,226 INFO L226 Difference]: Without dead ends: 144 [2018-01-25 03:49:38,227 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-01-25 03:49:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-25 03:49:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2018-01-25 03:49:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 03:49:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2018-01-25 03:49:38,241 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 30 [2018-01-25 03:49:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:38,242 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2018-01-25 03:49:38,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:49:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2018-01-25 03:49:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:49:38,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:38,243 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 03:49:38,243 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash -709364134, now seen corresponding path program 1 times [2018-01-25 03:49:38,244 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:38,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:38,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:38,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:38,245 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:38,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:38,447 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 03:49:38,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:38,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:49:38,448 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:38,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:49:38,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:49:38,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:49:38,449 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand 9 states. [2018-01-25 03:49:38,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:38,779 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2018-01-25 03:49:38,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:49:38,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-25 03:49:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:38,780 INFO L225 Difference]: With dead ends: 149 [2018-01-25 03:49:38,780 INFO L226 Difference]: Without dead ends: 148 [2018-01-25 03:49:38,781 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:49:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-25 03:49:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 125. [2018-01-25 03:49:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 03:49:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 147 transitions. [2018-01-25 03:49:38,794 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 147 transitions. Word has length 30 [2018-01-25 03:49:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:38,794 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 147 transitions. [2018-01-25 03:49:38,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:49:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2018-01-25 03:49:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:49:38,795 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:38,795 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 03:49:38,795 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:38,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1139830908, now seen corresponding path program 1 times [2018-01-25 03:49:38,796 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:38,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:38,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:38,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:38,797 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:38,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:38,822 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 03:49:38,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:38,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:49:38,823 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:38,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:49:38,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:49:38,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:49:38,824 INFO L87 Difference]: Start difference. First operand 125 states and 147 transitions. Second operand 3 states. [2018-01-25 03:49:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:38,853 INFO L93 Difference]: Finished difference Result 258 states and 293 transitions. [2018-01-25 03:49:38,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:49:38,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-25 03:49:38,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:38,856 INFO L225 Difference]: With dead ends: 258 [2018-01-25 03:49:38,856 INFO L226 Difference]: Without dead ends: 191 [2018-01-25 03:49:38,856 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:49:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-25 03:49:38,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 140. [2018-01-25 03:49:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-25 03:49:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2018-01-25 03:49:38,871 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 30 [2018-01-25 03:49:38,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:38,871 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2018-01-25 03:49:38,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:49:38,872 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2018-01-25 03:49:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 03:49:38,872 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:38,872 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:49:38,873 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:38,873 INFO L82 PathProgramCache]: Analyzing trace with hash -836244840, now seen corresponding path program 1 times [2018-01-25 03:49:38,873 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:38,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:38,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:38,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:38,874 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:38,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:49:39,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:49:39,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 03:49:39,227 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:49:39,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 03:49:39,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 03:49:39,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:49:39,228 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand 13 states. [2018-01-25 03:49:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:49:39,563 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2018-01-25 03:49:39,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 03:49:39,564 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-01-25 03:49:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:49:39,565 INFO L225 Difference]: With dead ends: 176 [2018-01-25 03:49:39,565 INFO L226 Difference]: Without dead ends: 153 [2018-01-25 03:49:39,566 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-01-25 03:49:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-25 03:49:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2018-01-25 03:49:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-25 03:49:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2018-01-25 03:49:39,580 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 32 [2018-01-25 03:49:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:49:39,580 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2018-01-25 03:49:39,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 03:49:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2018-01-25 03:49:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 03:49:39,581 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:49:39,581 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:49:39,581 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:49:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1537011505, now seen corresponding path program 1 times [2018-01-25 03:49:39,582 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:49:39,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:39,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:49:39,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:49:39,583 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:49:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:49:39,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:49:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:49:39,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:49:39,824 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:49:39,824 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-25 03:49:39,826 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [12], [14], [17], [73], [76], [79], [83], [88], [92], [100], [102], [103], [109], [113], [114], [117], [120], [123], [141], [145], [151], [154], [191], [192], [196], [197], [198] [2018-01-25 03:49:39,874 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:49:39,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown