java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:05:55,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:05:55,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:05:55,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:05:55,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:05:55,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:05:55,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:05:55,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:05:55,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:05:55,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:05:55,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:05:55,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:05:55,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:05:55,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:05:55,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:05:55,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:05:55,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:05:55,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:05:55,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:05:55,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:05:55,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:05:55,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:05:55,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:05:55,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:05:55,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:05:55,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:05:55,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:05:55,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:05:55,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:05:55,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:05:55,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:05:55,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:05:55,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:05:55,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:05:55,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:05:55,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:05:55,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:05:55,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:05:55,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:05:55,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:05:55,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:05:55,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:05:55,674 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:05:55,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:05:55,674 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:05:55,675 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:05:55,675 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:05:55,676 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:05:55,676 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:05:55,676 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:05:55,676 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:05:55,676 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:05:55,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:05:55,677 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:05:55,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:05:55,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:05:55,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:05:55,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:05:55,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:05:55,678 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:05:55,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:05:55,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:05:55,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:05:55,679 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:05:55,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:05:55,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:05:55,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:05:55,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:05:55,680 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:05:55,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:05:55,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:05:55,681 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:05:55,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:05:55,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:05:55,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:05:55,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:05:55,724 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:05:55,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:05:55,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9557fef/03de41529dbb4d3ba394091369f69a96/FLAG5c07ac94a [2019-09-10 06:05:56,202 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:05:56,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:05:56,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9557fef/03de41529dbb4d3ba394091369f69a96/FLAG5c07ac94a [2019-09-10 06:05:56,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9557fef/03de41529dbb4d3ba394091369f69a96 [2019-09-10 06:05:56,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:05:56,559 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:05:56,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:05:56,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:05:56,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:05:56,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:05:56" (1/1) ... [2019-09-10 06:05:56,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0a7f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:05:56, skipping insertion in model container [2019-09-10 06:05:56,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:05:56" (1/1) ... [2019-09-10 06:05:56,576 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:05:56,645 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:05:57,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:05:57,061 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:05:57,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:05:57,192 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:05:57,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:05:57 WrapperNode [2019-09-10 06:05:57,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:05:57,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:05:57,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:05:57,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:05:57,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:05:57" (1/1) ... [2019-09-10 06:05:57,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:05:57" (1/1) ... [2019-09-10 06:05:57,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:05:57" (1/1) ... [2019-09-10 06:05:57,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:05:57" (1/1) ... [2019-09-10 06:05:57,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:05:57" (1/1) ... [2019-09-10 06:05:57,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:05:57" (1/1) ... [2019-09-10 06:05:57,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:05:57" (1/1) ... [2019-09-10 06:05:57,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:05:57,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:05:57,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:05:57,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:05:57,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:05:57" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-10 06:05:57,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:05:57,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:05:57,310 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:05:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:05:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:05:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:05:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:05:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:05:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:05:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:05:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:05:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:05:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:05:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:05:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:05:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:05:57,313 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:05:57,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:05:57,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:05:58,060 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:05:58,061 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:05:58,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:05:58 BoogieIcfgContainer [2019-09-10 06:05:58,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:05:58,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:05:58,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:05:58,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:05:58,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:05:56" (1/3) ... [2019-09-10 06:05:58,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe26d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:05:58, skipping insertion in model container [2019-09-10 06:05:58,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:05:57" (2/3) ... [2019-09-10 06:05:58,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe26d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:05:58, skipping insertion in model container [2019-09-10 06:05:58,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:05:58" (3/3) ... [2019-09-10 06:05:58,070 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:05:58,079 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:05:58,087 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:05:58,103 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:05:58,129 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:05:58,129 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:05:58,129 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:05:58,130 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:05:58,130 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:05:58,130 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:05:58,130 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:05:58,130 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:05:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-09-10 06:05:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:05:58,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:05:58,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:05:58,169 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:05:58,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:05:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash -940649787, now seen corresponding path program 1 times [2019-09-10 06:05:58,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:05:58,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:58,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:05:58,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:58,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:05:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:05:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:05:58,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:05:58,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:05:58,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:05:58,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:05:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:05:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:05:58,652 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-09-10 06:05:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:05:58,778 INFO L93 Difference]: Finished difference Result 223 states and 367 transitions. [2019-09-10 06:05:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:05:58,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:05:58,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:05:58,794 INFO L225 Difference]: With dead ends: 223 [2019-09-10 06:05:58,794 INFO L226 Difference]: Without dead ends: 215 [2019-09-10 06:05:58,796 INFO L628 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 [2019-09-10 06:05:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-10 06:05:58,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-09-10 06:05:58,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-10 06:05:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 331 transitions. [2019-09-10 06:05:58,861 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 331 transitions. Word has length 60 [2019-09-10 06:05:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:05:58,862 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 331 transitions. [2019-09-10 06:05:58,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:05:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2019-09-10 06:05:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:05:58,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:05:58,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:05:58,870 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:05:58,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:05:58,871 INFO L82 PathProgramCache]: Analyzing trace with hash -662873070, now seen corresponding path program 1 times [2019-09-10 06:05:58,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:05:58,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:58,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:05:58,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:58,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:05:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:05:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:05:59,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:05:59,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:05:59,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:05:59,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:05:59,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:05:59,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:05:59,049 INFO L87 Difference]: Start difference. First operand 212 states and 331 transitions. Second operand 3 states. [2019-09-10 06:05:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:05:59,087 INFO L93 Difference]: Finished difference Result 352 states and 556 transitions. [2019-09-10 06:05:59,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:05:59,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-10 06:05:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:05:59,090 INFO L225 Difference]: With dead ends: 352 [2019-09-10 06:05:59,091 INFO L226 Difference]: Without dead ends: 352 [2019-09-10 06:05:59,091 INFO L628 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 [2019-09-10 06:05:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-10 06:05:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-09-10 06:05:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-10 06:05:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 553 transitions. [2019-09-10 06:05:59,119 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 553 transitions. Word has length 62 [2019-09-10 06:05:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:05:59,120 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 553 transitions. [2019-09-10 06:05:59,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:05:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 553 transitions. [2019-09-10 06:05:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 06:05:59,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:05:59,123 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:05:59,123 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:05:59,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:05:59,124 INFO L82 PathProgramCache]: Analyzing trace with hash 443916901, now seen corresponding path program 1 times [2019-09-10 06:05:59,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:05:59,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:59,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:05:59,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:59,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:05:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:05:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:05:59,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:05:59,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:05:59,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:05:59,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:05:59,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:05:59,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:05:59,220 INFO L87 Difference]: Start difference. First operand 348 states and 553 transitions. Second operand 3 states. [2019-09-10 06:05:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:05:59,263 INFO L93 Difference]: Finished difference Result 610 states and 970 transitions. [2019-09-10 06:05:59,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:05:59,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 06:05:59,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:05:59,270 INFO L225 Difference]: With dead ends: 610 [2019-09-10 06:05:59,270 INFO L226 Difference]: Without dead ends: 610 [2019-09-10 06:05:59,271 INFO L628 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 [2019-09-10 06:05:59,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-09-10 06:05:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2019-09-10 06:05:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-10 06:05:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 965 transitions. [2019-09-10 06:05:59,305 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 965 transitions. Word has length 64 [2019-09-10 06:05:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:05:59,305 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 965 transitions. [2019-09-10 06:05:59,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:05:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 965 transitions. [2019-09-10 06:05:59,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:05:59,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:05:59,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:05:59,309 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:05:59,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:05:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1638426254, now seen corresponding path program 1 times [2019-09-10 06:05:59,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:05:59,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:59,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:05:59,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:59,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:05:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:05:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:05:59,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:05:59,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:05:59,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:05:59,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:05:59,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:05:59,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:05:59,525 INFO L87 Difference]: Start difference. First operand 604 states and 965 transitions. Second operand 5 states. [2019-09-10 06:05:59,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:05:59,701 INFO L93 Difference]: Finished difference Result 1752 states and 2851 transitions. [2019-09-10 06:05:59,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:05:59,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-10 06:05:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:05:59,715 INFO L225 Difference]: With dead ends: 1752 [2019-09-10 06:05:59,715 INFO L226 Difference]: Without dead ends: 1752 [2019-09-10 06:05:59,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:05:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-09-10 06:05:59,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1308. [2019-09-10 06:05:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-09-10 06:05:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2128 transitions. [2019-09-10 06:05:59,792 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 2128 transitions. Word has length 66 [2019-09-10 06:05:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:05:59,795 INFO L475 AbstractCegarLoop]: Abstraction has 1308 states and 2128 transitions. [2019-09-10 06:05:59,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:05:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 2128 transitions. [2019-09-10 06:05:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:05:59,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:05:59,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:05:59,814 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:05:59,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:05:59,814 INFO L82 PathProgramCache]: Analyzing trace with hash 686783218, now seen corresponding path program 1 times [2019-09-10 06:05:59,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:05:59,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:59,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:05:59,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:59,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:05:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:05:59,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:05:59,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:05:59,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:05:59,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:05:59,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:05:59,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:05:59,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:05:59,938 INFO L87 Difference]: Start difference. First operand 1308 states and 2128 transitions. Second operand 6 states. [2019-09-10 06:06:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:00,145 INFO L93 Difference]: Finished difference Result 4600 states and 7479 transitions. [2019-09-10 06:06:00,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:06:00,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-10 06:06:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:00,170 INFO L225 Difference]: With dead ends: 4600 [2019-09-10 06:06:00,171 INFO L226 Difference]: Without dead ends: 4600 [2019-09-10 06:06:00,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:06:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4600 states. [2019-09-10 06:06:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4600 to 4501. [2019-09-10 06:06:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4501 states. [2019-09-10 06:06:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 7340 transitions. [2019-09-10 06:06:00,307 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 7340 transitions. Word has length 67 [2019-09-10 06:06:00,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:00,308 INFO L475 AbstractCegarLoop]: Abstraction has 4501 states and 7340 transitions. [2019-09-10 06:06:00,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:06:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 7340 transitions. [2019-09-10 06:06:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:06:00,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:00,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:00,311 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash -241609159, now seen corresponding path program 1 times [2019-09-10 06:06:00,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:00,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:00,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:00,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:00,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:06:00,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:00,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:06:00,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:00,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:06:00,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:06:00,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:06:00,453 INFO L87 Difference]: Start difference. First operand 4501 states and 7340 transitions. Second operand 4 states. [2019-09-10 06:06:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:00,589 INFO L93 Difference]: Finished difference Result 6169 states and 10063 transitions. [2019-09-10 06:06:00,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:06:00,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-10 06:06:00,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:00,659 INFO L225 Difference]: With dead ends: 6169 [2019-09-10 06:06:00,659 INFO L226 Difference]: Without dead ends: 6169 [2019-09-10 06:06:00,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:06:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2019-09-10 06:06:00,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 6142. [2019-09-10 06:06:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6142 states. [2019-09-10 06:06:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6142 states to 6142 states and 10015 transitions. [2019-09-10 06:06:00,815 INFO L78 Accepts]: Start accepts. Automaton has 6142 states and 10015 transitions. Word has length 68 [2019-09-10 06:06:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:00,816 INFO L475 AbstractCegarLoop]: Abstraction has 6142 states and 10015 transitions. [2019-09-10 06:06:00,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:06:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 10015 transitions. [2019-09-10 06:06:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:06:00,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:00,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:00,819 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:00,819 INFO L82 PathProgramCache]: Analyzing trace with hash 464144953, now seen corresponding path program 1 times [2019-09-10 06:06:00,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:00,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:00,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:00,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:00,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:06:00,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:00,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:00,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:00,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:00,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:00,877 INFO L87 Difference]: Start difference. First operand 6142 states and 10015 transitions. Second operand 3 states. [2019-09-10 06:06:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:00,940 INFO L93 Difference]: Finished difference Result 9184 states and 14931 transitions. [2019-09-10 06:06:00,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:00,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:06:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:00,982 INFO L225 Difference]: With dead ends: 9184 [2019-09-10 06:06:00,983 INFO L226 Difference]: Without dead ends: 9184 [2019-09-10 06:06:00,983 INFO L628 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 [2019-09-10 06:06:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9184 states. [2019-09-10 06:06:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9184 to 9182. [2019-09-10 06:06:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9182 states. [2019-09-10 06:06:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9182 states to 9182 states and 14930 transitions. [2019-09-10 06:06:01,197 INFO L78 Accepts]: Start accepts. Automaton has 9182 states and 14930 transitions. Word has length 69 [2019-09-10 06:06:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:01,197 INFO L475 AbstractCegarLoop]: Abstraction has 9182 states and 14930 transitions. [2019-09-10 06:06:01,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9182 states and 14930 transitions. [2019-09-10 06:06:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:06:01,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:01,199 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:01,199 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:01,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:01,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2123298740, now seen corresponding path program 1 times [2019-09-10 06:06:01,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:01,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:01,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:01,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:06:01,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:01,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:01,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:01,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:01,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:01,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:01,252 INFO L87 Difference]: Start difference. First operand 9182 states and 14930 transitions. Second operand 3 states. [2019-09-10 06:06:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:01,319 INFO L93 Difference]: Finished difference Result 12524 states and 20303 transitions. [2019-09-10 06:06:01,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:01,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:06:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:01,358 INFO L225 Difference]: With dead ends: 12524 [2019-09-10 06:06:01,359 INFO L226 Difference]: Without dead ends: 12524 [2019-09-10 06:06:01,359 INFO L628 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 [2019-09-10 06:06:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12524 states. [2019-09-10 06:06:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12524 to 12522. [2019-09-10 06:06:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12522 states. [2019-09-10 06:06:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12522 states to 12522 states and 20302 transitions. [2019-09-10 06:06:01,614 INFO L78 Accepts]: Start accepts. Automaton has 12522 states and 20302 transitions. Word has length 69 [2019-09-10 06:06:01,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:01,614 INFO L475 AbstractCegarLoop]: Abstraction has 12522 states and 20302 transitions. [2019-09-10 06:06:01,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 12522 states and 20302 transitions. [2019-09-10 06:06:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:06:01,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:01,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:01,616 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:01,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:01,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1047556249, now seen corresponding path program 1 times [2019-09-10 06:06:01,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:01,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:01,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:01,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:01,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:06:01,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:01,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:06:01,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:01,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:06:01,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:06:01,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:06:01,701 INFO L87 Difference]: Start difference. First operand 12522 states and 20302 transitions. Second operand 4 states. [2019-09-10 06:06:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:01,923 INFO L93 Difference]: Finished difference Result 24678 states and 40127 transitions. [2019-09-10 06:06:01,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:06:01,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-10 06:06:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:01,975 INFO L225 Difference]: With dead ends: 24678 [2019-09-10 06:06:01,975 INFO L226 Difference]: Without dead ends: 24678 [2019-09-10 06:06:01,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:06:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24678 states. [2019-09-10 06:06:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24678 to 18542. [2019-09-10 06:06:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18542 states. [2019-09-10 06:06:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18542 states to 18542 states and 30049 transitions. [2019-09-10 06:06:02,918 INFO L78 Accepts]: Start accepts. Automaton has 18542 states and 30049 transitions. Word has length 69 [2019-09-10 06:06:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:02,918 INFO L475 AbstractCegarLoop]: Abstraction has 18542 states and 30049 transitions. [2019-09-10 06:06:02,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:06:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 18542 states and 30049 transitions. [2019-09-10 06:06:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:06:02,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:02,919 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:02,919 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:02,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:02,920 INFO L82 PathProgramCache]: Analyzing trace with hash 795480594, now seen corresponding path program 1 times [2019-09-10 06:06:02,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:02,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:02,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:02,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:02,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:06:02,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:02,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:02,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:02,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:02,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:02,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:02,968 INFO L87 Difference]: Start difference. First operand 18542 states and 30049 transitions. Second operand 3 states. [2019-09-10 06:06:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:03,059 INFO L93 Difference]: Finished difference Result 27783 states and 44922 transitions. [2019-09-10 06:06:03,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:03,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:06:03,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:03,112 INFO L225 Difference]: With dead ends: 27783 [2019-09-10 06:06:03,113 INFO L226 Difference]: Without dead ends: 27783 [2019-09-10 06:06:03,113 INFO L628 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 [2019-09-10 06:06:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27783 states. [2019-09-10 06:06:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27783 to 27781. [2019-09-10 06:06:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27781 states. [2019-09-10 06:06:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27781 states to 27781 states and 44921 transitions. [2019-09-10 06:06:03,633 INFO L78 Accepts]: Start accepts. Automaton has 27781 states and 44921 transitions. Word has length 69 [2019-09-10 06:06:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:03,634 INFO L475 AbstractCegarLoop]: Abstraction has 27781 states and 44921 transitions. [2019-09-10 06:06:03,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 27781 states and 44921 transitions. [2019-09-10 06:06:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:06:03,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:03,635 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:03,635 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:03,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:03,636 INFO L82 PathProgramCache]: Analyzing trace with hash 189572521, now seen corresponding path program 1 times [2019-09-10 06:06:03,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:03,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:03,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:03,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:03,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:06:03,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:03,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:06:03,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:03,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:06:03,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:06:03,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:06:03,753 INFO L87 Difference]: Start difference. First operand 27781 states and 44921 transitions. Second operand 5 states. [2019-09-10 06:06:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:03,928 INFO L93 Difference]: Finished difference Result 27787 states and 44789 transitions. [2019-09-10 06:06:03,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:06:03,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:06:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:03,984 INFO L225 Difference]: With dead ends: 27787 [2019-09-10 06:06:03,984 INFO L226 Difference]: Without dead ends: 27787 [2019-09-10 06:06:03,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:06:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27787 states. [2019-09-10 06:06:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27787 to 27781. [2019-09-10 06:06:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27781 states. [2019-09-10 06:06:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27781 states to 27781 states and 44786 transitions. [2019-09-10 06:06:04,479 INFO L78 Accepts]: Start accepts. Automaton has 27781 states and 44786 transitions. Word has length 71 [2019-09-10 06:06:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:04,480 INFO L475 AbstractCegarLoop]: Abstraction has 27781 states and 44786 transitions. [2019-09-10 06:06:04,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:06:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 27781 states and 44786 transitions. [2019-09-10 06:06:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:06:04,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:04,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:04,481 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:04,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:04,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1918442634, now seen corresponding path program 1 times [2019-09-10 06:06:04,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:04,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:04,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:04,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:04,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:06:04,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:04,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:06:04,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:04,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:06:04,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:06:04,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:06:04,633 INFO L87 Difference]: Start difference. First operand 27781 states and 44786 transitions. Second operand 5 states. [2019-09-10 06:06:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:04,894 INFO L93 Difference]: Finished difference Result 49735 states and 79718 transitions. [2019-09-10 06:06:04,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:06:04,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-10 06:06:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:04,984 INFO L225 Difference]: With dead ends: 49735 [2019-09-10 06:06:04,984 INFO L226 Difference]: Without dead ends: 49735 [2019-09-10 06:06:04,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:06:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49735 states. [2019-09-10 06:06:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49735 to 49733. [2019-09-10 06:06:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49733 states. [2019-09-10 06:06:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49733 states to 49733 states and 79717 transitions. [2019-09-10 06:06:06,336 INFO L78 Accepts]: Start accepts. Automaton has 49733 states and 79717 transitions. Word has length 74 [2019-09-10 06:06:06,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:06,337 INFO L475 AbstractCegarLoop]: Abstraction has 49733 states and 79717 transitions. [2019-09-10 06:06:06,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:06:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand 49733 states and 79717 transitions. [2019-09-10 06:06:06,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:06:06,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:06,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:06,338 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:06,339 INFO L82 PathProgramCache]: Analyzing trace with hash -659729786, now seen corresponding path program 1 times [2019-09-10 06:06:06,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:06,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:06,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:06,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:06,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:06:06,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:06,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:06:06,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:06,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:06:06,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:06:06,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:06:06,434 INFO L87 Difference]: Start difference. First operand 49733 states and 79717 transitions. Second operand 5 states. [2019-09-10 06:06:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:06,705 INFO L93 Difference]: Finished difference Result 87411 states and 138681 transitions. [2019-09-10 06:06:06,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:06:06,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 06:06:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:07,049 INFO L225 Difference]: With dead ends: 87411 [2019-09-10 06:06:07,049 INFO L226 Difference]: Without dead ends: 87411 [2019-09-10 06:06:07,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:06:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87411 states. [2019-09-10 06:06:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87411 to 50969. [2019-09-10 06:06:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50969 states. [2019-09-10 06:06:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50969 states to 50969 states and 80944 transitions. [2019-09-10 06:06:09,055 INFO L78 Accepts]: Start accepts. Automaton has 50969 states and 80944 transitions. Word has length 75 [2019-09-10 06:06:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:09,056 INFO L475 AbstractCegarLoop]: Abstraction has 50969 states and 80944 transitions. [2019-09-10 06:06:09,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:06:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 50969 states and 80944 transitions. [2019-09-10 06:06:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:06:09,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:09,059 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:09,060 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:09,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:09,060 INFO L82 PathProgramCache]: Analyzing trace with hash -242897637, now seen corresponding path program 1 times [2019-09-10 06:06:09,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:09,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:09,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:09,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:09,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:06:09,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:09,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:09,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:09,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:09,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:09,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:09,146 INFO L87 Difference]: Start difference. First operand 50969 states and 80944 transitions. Second operand 3 states. [2019-09-10 06:06:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:09,263 INFO L93 Difference]: Finished difference Result 44101 states and 70076 transitions. [2019-09-10 06:06:09,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:09,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:06:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:09,317 INFO L225 Difference]: With dead ends: 44101 [2019-09-10 06:06:09,317 INFO L226 Difference]: Without dead ends: 44101 [2019-09-10 06:06:09,318 INFO L628 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 [2019-09-10 06:06:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44101 states. [2019-09-10 06:06:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44101 to 44099. [2019-09-10 06:06:09,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44099 states. [2019-09-10 06:06:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44099 states to 44099 states and 70075 transitions. [2019-09-10 06:06:10,045 INFO L78 Accepts]: Start accepts. Automaton has 44099 states and 70075 transitions. Word has length 97 [2019-09-10 06:06:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:10,045 INFO L475 AbstractCegarLoop]: Abstraction has 44099 states and 70075 transitions. [2019-09-10 06:06:10,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 44099 states and 70075 transitions. [2019-09-10 06:06:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:06:10,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:10,053 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:10,053 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:10,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:10,054 INFO L82 PathProgramCache]: Analyzing trace with hash 88438004, now seen corresponding path program 1 times [2019-09-10 06:06:10,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:10,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:10,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:10,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:10,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:06:10,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:10,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:10,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:10,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:10,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:10,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:10,133 INFO L87 Difference]: Start difference. First operand 44099 states and 70075 transitions. Second operand 3 states. [2019-09-10 06:06:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:10,184 INFO L93 Difference]: Finished difference Result 18566 states and 29422 transitions. [2019-09-10 06:06:10,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:10,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:06:10,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:10,204 INFO L225 Difference]: With dead ends: 18566 [2019-09-10 06:06:10,204 INFO L226 Difference]: Without dead ends: 18566 [2019-09-10 06:06:10,206 INFO L628 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 [2019-09-10 06:06:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18566 states. [2019-09-10 06:06:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18566 to 18564. [2019-09-10 06:06:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18564 states. [2019-09-10 06:06:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18564 states to 18564 states and 29421 transitions. [2019-09-10 06:06:10,406 INFO L78 Accepts]: Start accepts. Automaton has 18564 states and 29421 transitions. Word has length 97 [2019-09-10 06:06:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:10,406 INFO L475 AbstractCegarLoop]: Abstraction has 18564 states and 29421 transitions. [2019-09-10 06:06:10,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 18564 states and 29421 transitions. [2019-09-10 06:06:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:06:10,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:10,409 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:10,409 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:10,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash -680214214, now seen corresponding path program 1 times [2019-09-10 06:06:10,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:10,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:10,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:10,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:10,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:06:10,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:06:10,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:06:10,510 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 06:06:10,512 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [123], [145], [149], [154], [171], [174], [176], [209], [212], [215], [218], [221], [228], [236], [238], [241], [242], [244], [253], [256], [267], [270], [280], [296], [299], [324], [332], [340], [350], [354], [356], [358], [361], [386], [394], [402], [408], [412], [416], [418], [420], [423], [448], [456], [464], [575], [576], [580], [581], [582] [2019-09-10 06:06:10,565 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:06:10,565 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:06:10,812 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:06:11,139 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:06:11,142 INFO L272 AbstractInterpreter]: Visited 91 different actions 228 times. Merged at 43 different actions 125 times. Widened at 5 different actions 5 times. Performed 787 root evaluator evaluations with a maximum evaluation depth of 5. Performed 787 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 3 different actions. Largest state had 159 variables. [2019-09-10 06:06:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:11,146 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:06:11,492 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 86.62% of their original sizes. [2019-09-10 06:06:11,492 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:06:15,182 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 06:06:15,183 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:06:15,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:06:15,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [5] total 57 [2019-09-10 06:06:15,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:15,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 06:06:15,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 06:06:15,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2533, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 06:06:15,186 INFO L87 Difference]: Start difference. First operand 18564 states and 29421 transitions. Second operand 54 states. [2019-09-10 06:08:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:16,111 INFO L93 Difference]: Finished difference Result 252397 states and 385136 transitions. [2019-09-10 06:08:16,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 428 states. [2019-09-10 06:08:16,111 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 99 [2019-09-10 06:08:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:16,905 INFO L225 Difference]: With dead ends: 252397 [2019-09-10 06:08:16,905 INFO L226 Difference]: Without dead ends: 252357 [2019-09-10 06:08:16,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 448 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91767 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=24552, Invalid=177498, Unknown=0, NotChecked=0, Total=202050 [2019-09-10 06:08:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252357 states. [2019-09-10 06:08:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252357 to 61377. [2019-09-10 06:08:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61377 states. [2019-09-10 06:08:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61377 states to 61377 states and 96058 transitions. [2019-09-10 06:08:20,505 INFO L78 Accepts]: Start accepts. Automaton has 61377 states and 96058 transitions. Word has length 99 [2019-09-10 06:08:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:20,506 INFO L475 AbstractCegarLoop]: Abstraction has 61377 states and 96058 transitions. [2019-09-10 06:08:20,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 06:08:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 61377 states and 96058 transitions. [2019-09-10 06:08:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:08:20,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:20,509 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:20,509 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:20,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1255185238, now seen corresponding path program 1 times [2019-09-10 06:08:20,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:20,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:20,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:20,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:20,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:20,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:20,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:20,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:20,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:20,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:20,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:20,587 INFO L87 Difference]: Start difference. First operand 61377 states and 96058 transitions. Second operand 3 states. [2019-09-10 06:08:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:20,663 INFO L93 Difference]: Finished difference Result 25516 states and 39806 transitions. [2019-09-10 06:08:20,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:20,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 06:08:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:20,696 INFO L225 Difference]: With dead ends: 25516 [2019-09-10 06:08:20,697 INFO L226 Difference]: Without dead ends: 25516 [2019-09-10 06:08:20,699 INFO L628 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 [2019-09-10 06:08:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25516 states. [2019-09-10 06:08:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25516 to 25393. [2019-09-10 06:08:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25393 states. [2019-09-10 06:08:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25393 states to 25393 states and 39645 transitions. [2019-09-10 06:08:21,069 INFO L78 Accepts]: Start accepts. Automaton has 25393 states and 39645 transitions. Word has length 99 [2019-09-10 06:08:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:21,069 INFO L475 AbstractCegarLoop]: Abstraction has 25393 states and 39645 transitions. [2019-09-10 06:08:21,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 25393 states and 39645 transitions. [2019-09-10 06:08:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:08:21,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:21,073 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:21,073 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:21,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1045071639, now seen corresponding path program 1 times [2019-09-10 06:08:21,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:21,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:21,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:21,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:21,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:21,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:08:21,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:08:21,181 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-10 06:08:21,181 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [123], [145], [149], [154], [176], [180], [185], [202], [205], [207], [209], [212], [215], [218], [221], [228], [236], [238], [241], [242], [244], [253], [256], [267], [270], [280], [288], [292], [294], [296], [299], [324], [332], [340], [346], [350], [354], [356], [358], [361], [386], [394], [402], [408], [412], [416], [418], [420], [423], [448], [456], [464], [575], [576], [580], [581], [582] [2019-09-10 06:08:21,190 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:08:21,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:08:21,212 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:08:21,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:08:21,476 INFO L272 AbstractInterpreter]: Visited 99 different actions 460 times. Merged at 53 different actions 328 times. Widened at 26 different actions 69 times. Performed 1335 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1335 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 11 different actions. Largest state had 159 variables. [2019-09-10 06:08:21,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:21,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:08:21,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:08:21,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:08:21,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:21,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:08:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:21,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:08:21,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:08:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:08:21,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:08:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:08:21,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 06:08:21,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 06:08:21,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:21,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:08:21,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:08:21,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:08:21,801 INFO L87 Difference]: Start difference. First operand 25393 states and 39645 transitions. Second operand 5 states. [2019-09-10 06:08:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:21,930 INFO L93 Difference]: Finished difference Result 25397 states and 39607 transitions. [2019-09-10 06:08:21,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:08:21,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 06:08:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:21,968 INFO L225 Difference]: With dead ends: 25397 [2019-09-10 06:08:21,969 INFO L226 Difference]: Without dead ends: 25397 [2019-09-10 06:08:21,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:08:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25397 states. [2019-09-10 06:08:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25397 to 25393. [2019-09-10 06:08:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25393 states. [2019-09-10 06:08:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25393 states to 25393 states and 39605 transitions. [2019-09-10 06:08:22,303 INFO L78 Accepts]: Start accepts. Automaton has 25393 states and 39605 transitions. Word has length 101 [2019-09-10 06:08:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:22,304 INFO L475 AbstractCegarLoop]: Abstraction has 25393 states and 39605 transitions. [2019-09-10 06:08:22,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:08:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 25393 states and 39605 transitions. [2019-09-10 06:08:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:08:22,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:22,307 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:22,308 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:22,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:22,308 INFO L82 PathProgramCache]: Analyzing trace with hash 343541437, now seen corresponding path program 1 times [2019-09-10 06:08:22,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:22,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:22,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:22,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:22,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:08:22,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:22,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:08:22,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:22,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:08:22,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:08:22,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:22,419 INFO L87 Difference]: Start difference. First operand 25393 states and 39605 transitions. Second operand 5 states. [2019-09-10 06:08:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:22,621 INFO L93 Difference]: Finished difference Result 31161 states and 48542 transitions. [2019-09-10 06:08:22,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:08:22,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 06:08:22,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:22,665 INFO L225 Difference]: With dead ends: 31161 [2019-09-10 06:08:22,665 INFO L226 Difference]: Without dead ends: 31161 [2019-09-10 06:08:22,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:08:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31161 states. [2019-09-10 06:08:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31161 to 31107. [2019-09-10 06:08:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31107 states. [2019-09-10 06:08:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31107 states to 31107 states and 48491 transitions. [2019-09-10 06:08:23,479 INFO L78 Accepts]: Start accepts. Automaton has 31107 states and 48491 transitions. Word has length 101 [2019-09-10 06:08:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:23,479 INFO L475 AbstractCegarLoop]: Abstraction has 31107 states and 48491 transitions. [2019-09-10 06:08:23,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:08:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 31107 states and 48491 transitions. [2019-09-10 06:08:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:08:23,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:23,483 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:23,483 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:23,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1923087925, now seen corresponding path program 1 times [2019-09-10 06:08:23,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:23,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:23,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:23,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:23,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:08:23,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:23,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:23,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:23,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:23,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:23,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:23,533 INFO L87 Difference]: Start difference. First operand 31107 states and 48491 transitions. Second operand 3 states. [2019-09-10 06:08:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:23,721 INFO L93 Difference]: Finished difference Result 62199 states and 96958 transitions. [2019-09-10 06:08:23,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:23,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 06:08:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:23,815 INFO L225 Difference]: With dead ends: 62199 [2019-09-10 06:08:23,815 INFO L226 Difference]: Without dead ends: 62199 [2019-09-10 06:08:23,816 INFO L628 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 [2019-09-10 06:08:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62199 states. [2019-09-10 06:08:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62199 to 31109. [2019-09-10 06:08:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31109 states. [2019-09-10 06:08:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31109 states to 31109 states and 48493 transitions. [2019-09-10 06:08:24,488 INFO L78 Accepts]: Start accepts. Automaton has 31109 states and 48493 transitions. Word has length 102 [2019-09-10 06:08:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:24,488 INFO L475 AbstractCegarLoop]: Abstraction has 31109 states and 48493 transitions. [2019-09-10 06:08:24,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 31109 states and 48493 transitions. [2019-09-10 06:08:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:08:24,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:24,491 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:24,492 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:24,492 INFO L82 PathProgramCache]: Analyzing trace with hash -77094486, now seen corresponding path program 1 times [2019-09-10 06:08:24,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:24,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:24,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:24,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:24,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:08:24,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:24,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:24,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:24,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:24,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:24,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:24,541 INFO L87 Difference]: Start difference. First operand 31109 states and 48493 transitions. Second operand 3 states. [2019-09-10 06:08:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:24,682 INFO L93 Difference]: Finished difference Result 62202 states and 96962 transitions. [2019-09-10 06:08:24,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:24,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 06:08:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:24,760 INFO L225 Difference]: With dead ends: 62202 [2019-09-10 06:08:24,760 INFO L226 Difference]: Without dead ends: 62202 [2019-09-10 06:08:24,760 INFO L628 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 [2019-09-10 06:08:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62202 states. [2019-09-10 06:08:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62202 to 31112. [2019-09-10 06:08:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31112 states. [2019-09-10 06:08:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31112 states to 31112 states and 48497 transitions. [2019-09-10 06:08:25,217 INFO L78 Accepts]: Start accepts. Automaton has 31112 states and 48497 transitions. Word has length 102 [2019-09-10 06:08:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:25,217 INFO L475 AbstractCegarLoop]: Abstraction has 31112 states and 48497 transitions. [2019-09-10 06:08:25,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:25,217 INFO L276 IsEmpty]: Start isEmpty. Operand 31112 states and 48497 transitions. [2019-09-10 06:08:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:08:25,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:25,220 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:25,221 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:25,221 INFO L82 PathProgramCache]: Analyzing trace with hash 304094537, now seen corresponding path program 1 times [2019-09-10 06:08:25,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:25,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:25,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:25,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:25,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:08:25,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:25,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:25,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:25,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:25,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:25,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:25,261 INFO L87 Difference]: Start difference. First operand 31112 states and 48497 transitions. Second operand 3 states. [2019-09-10 06:08:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:25,836 INFO L93 Difference]: Finished difference Result 62188 states and 96936 transitions. [2019-09-10 06:08:25,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:25,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 06:08:25,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:25,912 INFO L225 Difference]: With dead ends: 62188 [2019-09-10 06:08:25,912 INFO L226 Difference]: Without dead ends: 62188 [2019-09-10 06:08:25,912 INFO L628 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 [2019-09-10 06:08:25,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62188 states. [2019-09-10 06:08:26,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62188 to 31114. [2019-09-10 06:08:26,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31114 states. [2019-09-10 06:08:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31114 states to 31114 states and 48499 transitions. [2019-09-10 06:08:26,311 INFO L78 Accepts]: Start accepts. Automaton has 31114 states and 48499 transitions. Word has length 102 [2019-09-10 06:08:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:26,311 INFO L475 AbstractCegarLoop]: Abstraction has 31114 states and 48499 transitions. [2019-09-10 06:08:26,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 31114 states and 48499 transitions. [2019-09-10 06:08:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:08:26,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:26,314 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:26,314 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:26,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2141579610, now seen corresponding path program 1 times [2019-09-10 06:08:26,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:26,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:26,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:26,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:26,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:08:26,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:26,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:26,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:26,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:26,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:26,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:26,355 INFO L87 Difference]: Start difference. First operand 31114 states and 48499 transitions. Second operand 3 states. [2019-09-10 06:08:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:26,485 INFO L93 Difference]: Finished difference Result 62178 states and 96916 transitions. [2019-09-10 06:08:26,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:26,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 06:08:26,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:26,550 INFO L225 Difference]: With dead ends: 62178 [2019-09-10 06:08:26,550 INFO L226 Difference]: Without dead ends: 62178 [2019-09-10 06:08:26,550 INFO L628 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 [2019-09-10 06:08:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62178 states. [2019-09-10 06:08:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62178 to 31120. [2019-09-10 06:08:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31120 states. [2019-09-10 06:08:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31120 states to 31120 states and 48507 transitions. [2019-09-10 06:08:27,006 INFO L78 Accepts]: Start accepts. Automaton has 31120 states and 48507 transitions. Word has length 102 [2019-09-10 06:08:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:27,006 INFO L475 AbstractCegarLoop]: Abstraction has 31120 states and 48507 transitions. [2019-09-10 06:08:27,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 31120 states and 48507 transitions. [2019-09-10 06:08:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:08:27,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:27,009 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:27,010 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:27,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:27,010 INFO L82 PathProgramCache]: Analyzing trace with hash -381064316, now seen corresponding path program 1 times [2019-09-10 06:08:27,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:27,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:27,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:27,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:27,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:08:27,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:27,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:08:27,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:27,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:08:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:08:27,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:08:27,126 INFO L87 Difference]: Start difference. First operand 31120 states and 48507 transitions. Second operand 4 states. [2019-09-10 06:08:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:27,291 INFO L93 Difference]: Finished difference Result 60289 states and 93166 transitions. [2019-09-10 06:08:27,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:08:27,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-10 06:08:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:27,352 INFO L225 Difference]: With dead ends: 60289 [2019-09-10 06:08:27,352 INFO L226 Difference]: Without dead ends: 60289 [2019-09-10 06:08:27,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60289 states. [2019-09-10 06:08:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60289 to 60267. [2019-09-10 06:08:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60267 states. [2019-09-10 06:08:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60267 states to 60267 states and 93145 transitions. [2019-09-10 06:08:28,275 INFO L78 Accepts]: Start accepts. Automaton has 60267 states and 93145 transitions. Word has length 102 [2019-09-10 06:08:28,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:28,275 INFO L475 AbstractCegarLoop]: Abstraction has 60267 states and 93145 transitions. [2019-09-10 06:08:28,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:08:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 60267 states and 93145 transitions. [2019-09-10 06:08:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:08:28,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:28,282 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:28,283 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:28,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:28,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1544447873, now seen corresponding path program 1 times [2019-09-10 06:08:28,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:28,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:28,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:28,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:28,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:08:28,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:28,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:08:28,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:28,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:08:28,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:08:28,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:28,385 INFO L87 Difference]: Start difference. First operand 60267 states and 93145 transitions. Second operand 5 states. [2019-09-10 06:08:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:28,635 INFO L93 Difference]: Finished difference Result 66653 states and 103085 transitions. [2019-09-10 06:08:28,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:08:28,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 06:08:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:28,696 INFO L225 Difference]: With dead ends: 66653 [2019-09-10 06:08:28,696 INFO L226 Difference]: Without dead ends: 66653 [2019-09-10 06:08:28,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:08:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66653 states. [2019-09-10 06:08:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66653 to 55590. [2019-09-10 06:08:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55590 states. [2019-09-10 06:08:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55590 states to 55590 states and 85937 transitions. [2019-09-10 06:08:29,213 INFO L78 Accepts]: Start accepts. Automaton has 55590 states and 85937 transitions. Word has length 103 [2019-09-10 06:08:29,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:29,213 INFO L475 AbstractCegarLoop]: Abstraction has 55590 states and 85937 transitions. [2019-09-10 06:08:29,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:08:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 55590 states and 85937 transitions. [2019-09-10 06:08:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:08:29,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:29,216 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:29,217 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:29,217 INFO L82 PathProgramCache]: Analyzing trace with hash -854773197, now seen corresponding path program 1 times [2019-09-10 06:08:29,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:29,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:29,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:08:29,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:29,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:29,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:29,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:29,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:29,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:29,281 INFO L87 Difference]: Start difference. First operand 55590 states and 85937 transitions. Second operand 3 states. [2019-09-10 06:08:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:29,441 INFO L93 Difference]: Finished difference Result 91584 states and 140115 transitions. [2019-09-10 06:08:29,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:29,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 06:08:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:29,528 INFO L225 Difference]: With dead ends: 91584 [2019-09-10 06:08:29,529 INFO L226 Difference]: Without dead ends: 91584 [2019-09-10 06:08:29,529 INFO L628 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 [2019-09-10 06:08:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91584 states. [2019-09-10 06:08:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91584 to 91502. [2019-09-10 06:08:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91502 states. [2019-09-10 06:08:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91502 states to 91502 states and 139994 transitions. [2019-09-10 06:08:30,823 INFO L78 Accepts]: Start accepts. Automaton has 91502 states and 139994 transitions. Word has length 104 [2019-09-10 06:08:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:30,824 INFO L475 AbstractCegarLoop]: Abstraction has 91502 states and 139994 transitions. [2019-09-10 06:08:30,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 91502 states and 139994 transitions. [2019-09-10 06:08:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:08:30,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:30,828 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:30,828 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:30,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:30,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1855097296, now seen corresponding path program 1 times [2019-09-10 06:08:30,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:30,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:30,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:30,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:30,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:08:30,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:30,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:08:30,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:30,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:08:30,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:08:30,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:08:30,915 INFO L87 Difference]: Start difference. First operand 91502 states and 139994 transitions. Second operand 4 states. [2019-09-10 06:08:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:31,130 INFO L93 Difference]: Finished difference Result 82439 states and 125745 transitions. [2019-09-10 06:08:31,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:08:31,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-10 06:08:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:31,287 INFO L225 Difference]: With dead ends: 82439 [2019-09-10 06:08:31,287 INFO L226 Difference]: Without dead ends: 82369 [2019-09-10 06:08:31,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82369 states. [2019-09-10 06:08:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82369 to 82369. [2019-09-10 06:08:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82369 states. [2019-09-10 06:08:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82369 states to 82369 states and 125647 transitions. [2019-09-10 06:08:32,669 INFO L78 Accepts]: Start accepts. Automaton has 82369 states and 125647 transitions. Word has length 104 [2019-09-10 06:08:32,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:32,670 INFO L475 AbstractCegarLoop]: Abstraction has 82369 states and 125647 transitions. [2019-09-10 06:08:32,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:08:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 82369 states and 125647 transitions. [2019-09-10 06:08:32,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:08:32,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:32,674 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:32,676 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:32,677 INFO L82 PathProgramCache]: Analyzing trace with hash -836909356, now seen corresponding path program 1 times [2019-09-10 06:08:32,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:32,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:32,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:32,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:32,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:32,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:08:32,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:08:32,852 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 06:08:32,852 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [123], [145], [149], [154], [157], [160], [171], [174], [176], [180], [185], [202], [205], [207], [209], [212], [215], [218], [221], [228], [236], [238], [241], [242], [244], [253], [256], [267], [270], [280], [288], [292], [294], [296], [299], [324], [332], [340], [350], [356], [358], [361], [386], [394], [402], [408], [412], [416], [418], [420], [423], [426], [429], [432], [434], [448], [456], [575], [576], [580], [581], [582] [2019-09-10 06:08:32,855 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:08:32,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:08:32,874 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:08:33,081 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:08:33,081 INFO L272 AbstractInterpreter]: Visited 104 different actions 513 times. Merged at 58 different actions 376 times. Widened at 24 different actions 67 times. Performed 1487 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1487 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 13 different actions. Largest state had 160 variables. [2019-09-10 06:08:33,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:33,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:08:33,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:08:33,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:08:33,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:33,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:08:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:33,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:08:33,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:08:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:08:33,247 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:08:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:08:33,284 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:08:33,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2019-09-10 06:08:33,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:33,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:08:33,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:08:33,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:08:33,285 INFO L87 Difference]: Start difference. First operand 82369 states and 125647 transitions. Second operand 4 states. [2019-09-10 06:08:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:33,538 INFO L93 Difference]: Finished difference Result 112346 states and 171153 transitions. [2019-09-10 06:08:33,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:08:33,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 06:08:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:33,698 INFO L225 Difference]: With dead ends: 112346 [2019-09-10 06:08:33,698 INFO L226 Difference]: Without dead ends: 112346 [2019-09-10 06:08:33,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:08:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112346 states. [2019-09-10 06:08:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112346 to 108415. [2019-09-10 06:08:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108415 states. [2019-09-10 06:08:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108415 states to 108415 states and 165287 transitions. [2019-09-10 06:08:35,323 INFO L78 Accepts]: Start accepts. Automaton has 108415 states and 165287 transitions. Word has length 106 [2019-09-10 06:08:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:35,324 INFO L475 AbstractCegarLoop]: Abstraction has 108415 states and 165287 transitions. [2019-09-10 06:08:35,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:08:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 108415 states and 165287 transitions. [2019-09-10 06:08:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:08:35,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:35,329 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:35,329 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:35,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:35,329 INFO L82 PathProgramCache]: Analyzing trace with hash 998727188, now seen corresponding path program 1 times [2019-09-10 06:08:35,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:35,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:35,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:35,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:35,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:08:35,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:35,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:08:35,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:35,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:08:35,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:08:35,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:08:35,446 INFO L87 Difference]: Start difference. First operand 108415 states and 165287 transitions. Second operand 4 states. [2019-09-10 06:08:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:35,846 INFO L93 Difference]: Finished difference Result 177541 states and 267933 transitions. [2019-09-10 06:08:35,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:08:35,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 06:08:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:36,077 INFO L225 Difference]: With dead ends: 177541 [2019-09-10 06:08:36,078 INFO L226 Difference]: Without dead ends: 177541 [2019-09-10 06:08:36,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177541 states. [2019-09-10 06:08:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177541 to 177487. [2019-09-10 06:08:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177487 states. [2019-09-10 06:08:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177487 states to 177487 states and 267854 transitions. [2019-09-10 06:08:38,373 INFO L78 Accepts]: Start accepts. Automaton has 177487 states and 267854 transitions. Word has length 106 [2019-09-10 06:08:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:38,374 INFO L475 AbstractCegarLoop]: Abstraction has 177487 states and 267854 transitions. [2019-09-10 06:08:38,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:08:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 177487 states and 267854 transitions. [2019-09-10 06:08:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:08:38,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:38,379 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:38,380 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash -229277515, now seen corresponding path program 1 times [2019-09-10 06:08:38,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:38,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:38,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:38,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:38,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:08:38,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:38,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:38,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:38,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:38,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:38,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:38,446 INFO L87 Difference]: Start difference. First operand 177487 states and 267854 transitions. Second operand 3 states. [2019-09-10 06:08:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:39,181 INFO L93 Difference]: Finished difference Result 307751 states and 460369 transitions. [2019-09-10 06:08:39,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:39,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 06:08:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:39,622 INFO L225 Difference]: With dead ends: 307751 [2019-09-10 06:08:39,622 INFO L226 Difference]: Without dead ends: 307751 [2019-09-10 06:08:39,622 INFO L628 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 [2019-09-10 06:08:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307751 states. [2019-09-10 06:08:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307751 to 307489. [2019-09-10 06:08:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307489 states. [2019-09-10 06:08:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307489 states to 307489 states and 459978 transitions. [2019-09-10 06:08:46,954 INFO L78 Accepts]: Start accepts. Automaton has 307489 states and 459978 transitions. Word has length 108 [2019-09-10 06:08:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:46,955 INFO L475 AbstractCegarLoop]: Abstraction has 307489 states and 459978 transitions. [2019-09-10 06:08:46,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 307489 states and 459978 transitions. [2019-09-10 06:08:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:08:46,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:46,964 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:46,964 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:46,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1206084882, now seen corresponding path program 1 times [2019-09-10 06:08:46,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:46,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:46,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:46,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:46,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:08:47,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:47,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:08:47,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:47,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:08:47,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:08:47,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:08:47,053 INFO L87 Difference]: Start difference. First operand 307489 states and 459978 transitions. Second operand 4 states. [2019-09-10 06:08:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:47,714 INFO L93 Difference]: Finished difference Result 279654 states and 417361 transitions. [2019-09-10 06:08:47,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:08:47,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-10 06:08:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:53,384 INFO L225 Difference]: With dead ends: 279654 [2019-09-10 06:08:53,384 INFO L226 Difference]: Without dead ends: 279598 [2019-09-10 06:08:53,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279598 states. [2019-09-10 06:08:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279598 to 279598. [2019-09-10 06:08:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279598 states. [2019-09-10 06:08:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279598 states to 279598 states and 417288 transitions. [2019-09-10 06:08:56,075 INFO L78 Accepts]: Start accepts. Automaton has 279598 states and 417288 transitions. Word has length 108 [2019-09-10 06:08:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:56,075 INFO L475 AbstractCegarLoop]: Abstraction has 279598 states and 417288 transitions. [2019-09-10 06:08:56,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:08:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 279598 states and 417288 transitions. [2019-09-10 06:08:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:08:56,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:56,084 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:56,084 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:56,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:56,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2089837102, now seen corresponding path program 1 times [2019-09-10 06:08:56,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:56,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:56,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:56,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:56,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:08:56,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:56,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:56,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:56,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:56,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:56,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:56,127 INFO L87 Difference]: Start difference. First operand 279598 states and 417288 transitions. Second operand 3 states. [2019-09-10 06:08:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:58,060 INFO L93 Difference]: Finished difference Result 554058 states and 821750 transitions. [2019-09-10 06:08:58,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:58,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 06:08:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:58,775 INFO L225 Difference]: With dead ends: 554058 [2019-09-10 06:08:58,775 INFO L226 Difference]: Without dead ends: 554058 [2019-09-10 06:08:58,775 INFO L628 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 [2019-09-10 06:08:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554058 states. [2019-09-10 06:09:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554058 to 554056. [2019-09-10 06:09:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554056 states. [2019-09-10 06:09:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554056 states to 554056 states and 821749 transitions. [2019-09-10 06:09:13,837 INFO L78 Accepts]: Start accepts. Automaton has 554056 states and 821749 transitions. Word has length 110 [2019-09-10 06:09:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:13,838 INFO L475 AbstractCegarLoop]: Abstraction has 554056 states and 821749 transitions. [2019-09-10 06:09:13,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:09:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 554056 states and 821749 transitions. [2019-09-10 06:09:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:09:13,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:13,854 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:13,855 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:13,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1973856727, now seen corresponding path program 1 times [2019-09-10 06:09:13,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:13,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:13,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:13,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:13,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:09:13,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:13,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:09:13,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:13,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:09:13,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:09:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:09:13,974 INFO L87 Difference]: Start difference. First operand 554056 states and 821749 transitions. Second operand 4 states. [2019-09-10 06:09:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:23,391 INFO L93 Difference]: Finished difference Result 1073902 states and 1579925 transitions. [2019-09-10 06:09:23,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:09:23,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-10 06:09:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:24,810 INFO L225 Difference]: With dead ends: 1073902 [2019-09-10 06:09:24,811 INFO L226 Difference]: Without dead ends: 1073902 [2019-09-10 06:09:24,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:09:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073902 states. [2019-09-10 06:09:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073902 to 1073744. [2019-09-10 06:09:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073744 states. [2019-09-10 06:09:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073744 states to 1073744 states and 1579768 transitions. [2019-09-10 06:09:56,979 INFO L78 Accepts]: Start accepts. Automaton has 1073744 states and 1579768 transitions. Word has length 110 [2019-09-10 06:09:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:56,979 INFO L475 AbstractCegarLoop]: Abstraction has 1073744 states and 1579768 transitions. [2019-09-10 06:09:56,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:09:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1073744 states and 1579768 transitions. [2019-09-10 06:09:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:09:57,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:57,006 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:09:57,007 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:57,007 INFO L82 PathProgramCache]: Analyzing trace with hash -585328086, now seen corresponding path program 1 times [2019-09-10 06:09:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:57,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:57,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:09:57,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:57,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:09:57,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:57,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:09:57,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:09:57,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:09:57,103 INFO L87 Difference]: Start difference. First operand 1073744 states and 1579768 transitions. Second operand 4 states. [2019-09-10 06:10:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:08,897 INFO L93 Difference]: Finished difference Result 1073917 states and 1579963 transitions. [2019-09-10 06:10:08,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:08,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 06:10:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:10,516 INFO L225 Difference]: With dead ends: 1073917 [2019-09-10 06:10:10,517 INFO L226 Difference]: Without dead ends: 1073705 [2019-09-10 06:10:10,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073705 states. [2019-09-10 06:10:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073705 to 1073705. [2019-09-10 06:10:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073705 states. [2019-09-10 06:10:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073705 states to 1073705 states and 1579707 transitions. [2019-09-10 06:10:46,954 INFO L78 Accepts]: Start accepts. Automaton has 1073705 states and 1579707 transitions. Word has length 112 [2019-09-10 06:10:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:46,954 INFO L475 AbstractCegarLoop]: Abstraction has 1073705 states and 1579707 transitions. [2019-09-10 06:10:46,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1073705 states and 1579707 transitions. [2019-09-10 06:10:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:10:46,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:46,979 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:46,979 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:46,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1224543300, now seen corresponding path program 1 times [2019-09-10 06:10:46,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:46,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:46,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:46,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:10:47,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:47,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:47,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:47,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:47,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:47,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:47,044 INFO L87 Difference]: Start difference. First operand 1073705 states and 1579707 transitions. Second operand 3 states. [2019-09-10 06:11:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:05,890 INFO L93 Difference]: Finished difference Result 1585495 states and 2296040 transitions. [2019-09-10 06:11:05,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:05,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 06:11:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:09,448 INFO L225 Difference]: With dead ends: 1585495 [2019-09-10 06:11:09,448 INFO L226 Difference]: Without dead ends: 1585495 [2019-09-10 06:11:09,448 INFO L628 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 [2019-09-10 06:11:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585495 states. [2019-09-10 06:11:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585495 to 1585181. [2019-09-10 06:11:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585181 states.