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.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:04:18,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:04:18,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:04:18,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:04:18,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:04:18,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:04:18,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:04:18,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:04:18,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:04:18,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:04:18,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:04:18,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:04:18,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:04:18,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:04:18,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:04:18,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:04:18,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:04:18,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:04:18,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:04:18,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:04:18,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:04:18,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:04:19,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:04:19,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:04:19,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:04:19,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:04:19,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:04:19,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:04:19,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:04:19,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:04:19,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:04:19,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:04:19,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:04:19,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:04:19,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:04:19,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:04:19,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:04:19,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:04:19,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:04:19,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:04:19,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:04:19,019 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:04:19,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:04:19,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:04:19,035 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:04:19,035 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:04:19,035 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:04:19,036 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:04:19,036 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:04:19,036 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:04:19,036 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:04:19,037 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:04:19,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:04:19,037 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:04:19,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:04:19,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:04:19,038 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:04:19,038 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:04:19,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:04:19,039 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:04:19,039 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:04:19,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:04:19,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:04:19,039 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:04:19,040 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:04:19,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:04:19,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:04:19,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:04:19,040 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:04:19,041 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:04:19,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:04:19,041 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:04:19,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:04:19,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:04:19,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:04:19,085 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:04:19,085 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:04:19,086 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.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:04:19,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02579de0d/01a9e01127784f1d9743503be39003b2/FLAGa4a0d70e3 [2019-09-10 06:04:19,624 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:04:19,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:04:19,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02579de0d/01a9e01127784f1d9743503be39003b2/FLAGa4a0d70e3 [2019-09-10 06:04:19,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02579de0d/01a9e01127784f1d9743503be39003b2 [2019-09-10 06:04:19,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:04:19,994 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:04:19,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:04:19,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:04:19,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:04:19,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:04:19" (1/1) ... [2019-09-10 06:04:20,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d42effb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:20, skipping insertion in model container [2019-09-10 06:04:20,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:04:19" (1/1) ... [2019-09-10 06:04:20,010 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:04:20,069 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:04:20,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:04:20,432 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:04:20,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:04:20,538 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:04:20,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:20 WrapperNode [2019-09-10 06:04:20,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:04:20,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:04:20,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:04:20,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:04:20,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:20" (1/1) ... [2019-09-10 06:04:20,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:20" (1/1) ... [2019-09-10 06:04:20,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:20" (1/1) ... [2019-09-10 06:04:20,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:20" (1/1) ... [2019-09-10 06:04:20,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:20" (1/1) ... [2019-09-10 06:04:20,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:20" (1/1) ... [2019-09-10 06:04:20,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:20" (1/1) ... [2019-09-10 06:04:20,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:04:20,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:04:20,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:04:20,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:04:20,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:20" (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:04:20,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:04:20,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:04:20,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:04:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:04:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:04:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:04:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:04:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:04:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:04:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:04:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:04:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:04:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:04:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:04:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:04:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:04:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:04:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:04:20,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:04:21,406 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:04:21,406 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:04:21,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:04:21 BoogieIcfgContainer [2019-09-10 06:04:21,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:04:21,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:04:21,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:04:21,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:04:21,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:04:19" (1/3) ... [2019-09-10 06:04:21,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e58f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:04:21, skipping insertion in model container [2019-09-10 06:04:21,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:20" (2/3) ... [2019-09-10 06:04:21,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e58f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:04:21, skipping insertion in model container [2019-09-10 06:04:21,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:04:21" (3/3) ... [2019-09-10 06:04:21,415 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:04:21,425 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:04:21,433 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:04:21,449 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:04:21,476 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:04:21,477 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:04:21,477 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:04:21,477 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:04:21,477 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:04:21,477 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:04:21,478 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:04:21,478 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:04:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-09-10 06:04:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 06:04:21,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:21,510 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] [2019-09-10 06:04:21,512 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:21,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:21,517 INFO L82 PathProgramCache]: Analyzing trace with hash -720461132, now seen corresponding path program 1 times [2019-09-10 06:04:21,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:21,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:21,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:21,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:21,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:21,971 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:04:21,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:21,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:21,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:21,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:21,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:21,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:22,001 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 3 states. [2019-09-10 06:04:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:22,157 INFO L93 Difference]: Finished difference Result 217 states and 355 transitions. [2019-09-10 06:04:22,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:22,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-10 06:04:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:22,173 INFO L225 Difference]: With dead ends: 217 [2019-09-10 06:04:22,174 INFO L226 Difference]: Without dead ends: 209 [2019-09-10 06:04:22,175 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:04:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-10 06:04:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-09-10 06:04:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-10 06:04:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 325 transitions. [2019-09-10 06:04:22,228 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 325 transitions. Word has length 54 [2019-09-10 06:04:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:22,228 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 325 transitions. [2019-09-10 06:04:22,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 325 transitions. [2019-09-10 06:04:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:04:22,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:22,232 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] [2019-09-10 06:04:22,232 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:22,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:22,233 INFO L82 PathProgramCache]: Analyzing trace with hash 485026305, now seen corresponding path program 1 times [2019-09-10 06:04:22,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:22,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:22,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:22,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:22,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:22,371 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:04:22,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:22,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:22,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:22,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:22,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:22,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:22,375 INFO L87 Difference]: Start difference. First operand 206 states and 325 transitions. Second operand 3 states. [2019-09-10 06:04:22,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:22,424 INFO L93 Difference]: Finished difference Result 346 states and 550 transitions. [2019-09-10 06:04:22,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:22,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:04:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:22,428 INFO L225 Difference]: With dead ends: 346 [2019-09-10 06:04:22,429 INFO L226 Difference]: Without dead ends: 346 [2019-09-10 06:04:22,429 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:04:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-10 06:04:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2019-09-10 06:04:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-10 06:04:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 547 transitions. [2019-09-10 06:04:22,462 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 547 transitions. Word has length 56 [2019-09-10 06:04:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:22,463 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 547 transitions. [2019-09-10 06:04:22,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 547 transitions. [2019-09-10 06:04:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:04:22,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:22,466 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] [2019-09-10 06:04:22,467 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash -231379372, now seen corresponding path program 1 times [2019-09-10 06:04:22,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:22,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:22,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:22,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:22,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:22,562 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:04:22,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:22,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:22,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:22,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:22,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:22,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:22,566 INFO L87 Difference]: Start difference. First operand 342 states and 547 transitions. Second operand 3 states. [2019-09-10 06:04:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:22,600 INFO L93 Difference]: Finished difference Result 604 states and 964 transitions. [2019-09-10 06:04:22,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:22,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 06:04:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:22,605 INFO L225 Difference]: With dead ends: 604 [2019-09-10 06:04:22,606 INFO L226 Difference]: Without dead ends: 604 [2019-09-10 06:04:22,606 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:04:22,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-09-10 06:04:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 598. [2019-09-10 06:04:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-10 06:04:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 959 transitions. [2019-09-10 06:04:22,634 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 959 transitions. Word has length 58 [2019-09-10 06:04:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:22,636 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 959 transitions. [2019-09-10 06:04:22,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 959 transitions. [2019-09-10 06:04:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:04:22,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:22,642 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:04:22,643 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:22,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2058083487, now seen corresponding path program 1 times [2019-09-10 06:04:22,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:22,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:22,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:22,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:22,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:22,846 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:04:22,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:22,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:04:22,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:22,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:04:22,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:04:22,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:04:22,848 INFO L87 Difference]: Start difference. First operand 598 states and 959 transitions. Second operand 5 states. [2019-09-10 06:04:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:22,975 INFO L93 Difference]: Finished difference Result 1464 states and 2384 transitions. [2019-09-10 06:04:22,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:04:22,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-10 06:04:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:22,984 INFO L225 Difference]: With dead ends: 1464 [2019-09-10 06:04:22,984 INFO L226 Difference]: Without dead ends: 1464 [2019-09-10 06:04:22,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:04:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-09-10 06:04:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1304. [2019-09-10 06:04:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2019-09-10 06:04:23,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 2119 transitions. [2019-09-10 06:04:23,030 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 2119 transitions. Word has length 60 [2019-09-10 06:04:23,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:23,030 INFO L475 AbstractCegarLoop]: Abstraction has 1304 states and 2119 transitions. [2019-09-10 06:04:23,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:04:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 2119 transitions. [2019-09-10 06:04:23,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:04:23,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:23,037 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] [2019-09-10 06:04:23,037 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:23,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:23,038 INFO L82 PathProgramCache]: Analyzing trace with hash 562310865, now seen corresponding path program 1 times [2019-09-10 06:04:23,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:23,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:23,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:23,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:23,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:23,193 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:04:23,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:23,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:04:23,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:23,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:04:23,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:04:23,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:04:23,195 INFO L87 Difference]: Start difference. First operand 1304 states and 2119 transitions. Second operand 6 states. [2019-09-10 06:04:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:23,414 INFO L93 Difference]: Finished difference Result 3892 states and 6315 transitions. [2019-09-10 06:04:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:04:23,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-09-10 06:04:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:23,441 INFO L225 Difference]: With dead ends: 3892 [2019-09-10 06:04:23,441 INFO L226 Difference]: Without dead ends: 3892 [2019-09-10 06:04:23,442 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:04:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2019-09-10 06:04:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3797. [2019-09-10 06:04:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2019-09-10 06:04:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 6184 transitions. [2019-09-10 06:04:23,573 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 6184 transitions. Word has length 61 [2019-09-10 06:04:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:23,574 INFO L475 AbstractCegarLoop]: Abstraction has 3797 states and 6184 transitions. [2019-09-10 06:04:23,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:04:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 6184 transitions. [2019-09-10 06:04:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:04:23,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:23,577 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:04:23,577 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:23,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:23,578 INFO L82 PathProgramCache]: Analyzing trace with hash 194715176, now seen corresponding path program 1 times [2019-09-10 06:04:23,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:23,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:23,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:23,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:23,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:23,669 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:04:23,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:23,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:04:23,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:23,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:04:23,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:04:23,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:04:23,672 INFO L87 Difference]: Start difference. First operand 3797 states and 6184 transitions. Second operand 4 states. [2019-09-10 06:04:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:23,810 INFO L93 Difference]: Finished difference Result 5465 states and 8907 transitions. [2019-09-10 06:04:23,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:04:23,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-10 06:04:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:23,846 INFO L225 Difference]: With dead ends: 5465 [2019-09-10 06:04:23,847 INFO L226 Difference]: Without dead ends: 5465 [2019-09-10 06:04:23,847 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:04:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5465 states. [2019-09-10 06:04:24,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5465 to 5438. [2019-09-10 06:04:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5438 states. [2019-09-10 06:04:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5438 states to 5438 states and 8859 transitions. [2019-09-10 06:04:24,118 INFO L78 Accepts]: Start accepts. Automaton has 5438 states and 8859 transitions. Word has length 62 [2019-09-10 06:04:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:24,119 INFO L475 AbstractCegarLoop]: Abstraction has 5438 states and 8859 transitions. [2019-09-10 06:04:24,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:04:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 5438 states and 8859 transitions. [2019-09-10 06:04:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:04:24,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:24,121 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] [2019-09-10 06:04:24,122 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:24,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1105297432, now seen corresponding path program 1 times [2019-09-10 06:04:24,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:24,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:24,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:24,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:24,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:24,175 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:04:24,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:24,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:24,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:24,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:24,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:24,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:24,177 INFO L87 Difference]: Start difference. First operand 5438 states and 8859 transitions. Second operand 3 states. [2019-09-10 06:04:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:24,243 INFO L93 Difference]: Finished difference Result 7992 states and 12985 transitions. [2019-09-10 06:04:24,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:24,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-10 06:04:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:24,285 INFO L225 Difference]: With dead ends: 7992 [2019-09-10 06:04:24,285 INFO L226 Difference]: Without dead ends: 7992 [2019-09-10 06:04:24,286 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:04:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7992 states. [2019-09-10 06:04:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7992 to 7990. [2019-09-10 06:04:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7990 states. [2019-09-10 06:04:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7990 states to 7990 states and 12984 transitions. [2019-09-10 06:04:24,497 INFO L78 Accepts]: Start accepts. Automaton has 7990 states and 12984 transitions. Word has length 63 [2019-09-10 06:04:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:24,497 INFO L475 AbstractCegarLoop]: Abstraction has 7990 states and 12984 transitions. [2019-09-10 06:04:24,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 7990 states and 12984 transitions. [2019-09-10 06:04:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:04:24,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:24,499 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] [2019-09-10 06:04:24,499 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:24,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:24,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1482146261, now seen corresponding path program 1 times [2019-09-10 06:04:24,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:24,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:24,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:24,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:24,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:24,551 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:04:24,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:24,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:24,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:24,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:24,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:24,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:24,553 INFO L87 Difference]: Start difference. First operand 7990 states and 12984 transitions. Second operand 3 states. [2019-09-10 06:04:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:24,626 INFO L93 Difference]: Finished difference Result 10909 states and 17667 transitions. [2019-09-10 06:04:24,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:24,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-10 06:04:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:24,747 INFO L225 Difference]: With dead ends: 10909 [2019-09-10 06:04:24,747 INFO L226 Difference]: Without dead ends: 10909 [2019-09-10 06:04:24,747 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:04:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10909 states. [2019-09-10 06:04:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10909 to 10907. [2019-09-10 06:04:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10907 states. [2019-09-10 06:04:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10907 states to 10907 states and 17666 transitions. [2019-09-10 06:04:24,966 INFO L78 Accepts]: Start accepts. Automaton has 10907 states and 17666 transitions. Word has length 63 [2019-09-10 06:04:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:24,967 INFO L475 AbstractCegarLoop]: Abstraction has 10907 states and 17666 transitions. [2019-09-10 06:04:24,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 10907 states and 17666 transitions. [2019-09-10 06:04:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:04:24,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:24,972 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] [2019-09-10 06:04:24,973 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:24,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1688708728, now seen corresponding path program 1 times [2019-09-10 06:04:24,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:24,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:24,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:25,079 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:04:25,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:25,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:04:25,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:25,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:04:25,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:04:25,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:04:25,081 INFO L87 Difference]: Start difference. First operand 10907 states and 17666 transitions. Second operand 4 states. [2019-09-10 06:04:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:25,316 INFO L93 Difference]: Finished difference Result 20951 states and 34029 transitions. [2019-09-10 06:04:25,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:04:25,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-10 06:04:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:25,378 INFO L225 Difference]: With dead ends: 20951 [2019-09-10 06:04:25,378 INFO L226 Difference]: Without dead ends: 20951 [2019-09-10 06:04:25,379 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:04:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20951 states. [2019-09-10 06:04:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20951 to 15881. [2019-09-10 06:04:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15881 states. [2019-09-10 06:04:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15881 states to 15881 states and 25711 transitions. [2019-09-10 06:04:25,880 INFO L78 Accepts]: Start accepts. Automaton has 15881 states and 25711 transitions. Word has length 63 [2019-09-10 06:04:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:25,880 INFO L475 AbstractCegarLoop]: Abstraction has 15881 states and 25711 transitions. [2019-09-10 06:04:25,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:04:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 15881 states and 25711 transitions. [2019-09-10 06:04:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:04:25,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:25,885 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] [2019-09-10 06:04:25,886 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:25,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:25,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1436633073, now seen corresponding path program 1 times [2019-09-10 06:04:25,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:25,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:25,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:25,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:25,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:25,945 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:04:25,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:25,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:25,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:25,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:25,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:25,948 INFO L87 Difference]: Start difference. First operand 15881 states and 25711 transitions. Second operand 3 states. [2019-09-10 06:04:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:26,050 INFO L93 Difference]: Finished difference Result 23750 states and 38366 transitions. [2019-09-10 06:04:26,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:26,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-10 06:04:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:26,108 INFO L225 Difference]: With dead ends: 23750 [2019-09-10 06:04:26,108 INFO L226 Difference]: Without dead ends: 23750 [2019-09-10 06:04:26,109 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:04:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23750 states. [2019-09-10 06:04:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23750 to 23748. [2019-09-10 06:04:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23748 states. [2019-09-10 06:04:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23748 states to 23748 states and 38365 transitions. [2019-09-10 06:04:27,050 INFO L78 Accepts]: Start accepts. Automaton has 23748 states and 38365 transitions. Word has length 63 [2019-09-10 06:04:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:27,050 INFO L475 AbstractCegarLoop]: Abstraction has 23748 states and 38365 transitions. [2019-09-10 06:04:27,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 23748 states and 38365 transitions. [2019-09-10 06:04:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:04:27,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:27,052 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] [2019-09-10 06:04:27,052 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:27,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:27,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2138186360, now seen corresponding path program 1 times [2019-09-10 06:04:27,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:27,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:27,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:27,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:27,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:27,194 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:04:27,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:27,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:04:27,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:27,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:04:27,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:04:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:04:27,195 INFO L87 Difference]: Start difference. First operand 23748 states and 38365 transitions. Second operand 5 states. [2019-09-10 06:04:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:27,356 INFO L93 Difference]: Finished difference Result 25536 states and 41181 transitions. [2019-09-10 06:04:27,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:04:27,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-10 06:04:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:27,414 INFO L225 Difference]: With dead ends: 25536 [2019-09-10 06:04:27,414 INFO L226 Difference]: Without dead ends: 25536 [2019-09-10 06:04:27,416 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:04:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25536 states. [2019-09-10 06:04:27,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25536 to 23748. [2019-09-10 06:04:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23748 states. [2019-09-10 06:04:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23748 states to 23748 states and 38230 transitions. [2019-09-10 06:04:27,875 INFO L78 Accepts]: Start accepts. Automaton has 23748 states and 38230 transitions. Word has length 65 [2019-09-10 06:04:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:27,876 INFO L475 AbstractCegarLoop]: Abstraction has 23748 states and 38230 transitions. [2019-09-10 06:04:27,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:04:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 23748 states and 38230 transitions. [2019-09-10 06:04:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:04:27,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:27,877 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:04:27,877 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:27,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2099405191, now seen corresponding path program 1 times [2019-09-10 06:04:27,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:27,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:27,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:28,039 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:04:28,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:28,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:04:28,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:28,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:04:28,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:04:28,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:04:28,041 INFO L87 Difference]: Start difference. First operand 23748 states and 38230 transitions. Second operand 5 states. [2019-09-10 06:04:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:28,239 INFO L93 Difference]: Finished difference Result 43247 states and 69232 transitions. [2019-09-10 06:04:28,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:04:28,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 06:04:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:28,329 INFO L225 Difference]: With dead ends: 43247 [2019-09-10 06:04:28,329 INFO L226 Difference]: Without dead ends: 43247 [2019-09-10 06:04:28,329 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:04:28,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43247 states. [2019-09-10 06:04:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43247 to 43245. [2019-09-10 06:04:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43245 states. [2019-09-10 06:04:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43245 states to 43245 states and 69231 transitions. [2019-09-10 06:04:29,198 INFO L78 Accepts]: Start accepts. Automaton has 43245 states and 69231 transitions. Word has length 68 [2019-09-10 06:04:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:29,198 INFO L475 AbstractCegarLoop]: Abstraction has 43245 states and 69231 transitions. [2019-09-10 06:04:29,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:04:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 43245 states and 69231 transitions. [2019-09-10 06:04:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:04:29,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:29,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:04:29,199 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:29,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash -658960795, now seen corresponding path program 1 times [2019-09-10 06:04:29,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:29,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:29,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:29,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:29,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:29,301 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:04:29,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:29,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:04:29,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:29,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:04:29,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:04:29,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:04:29,303 INFO L87 Difference]: Start difference. First operand 43245 states and 69231 transitions. Second operand 5 states. [2019-09-10 06:04:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:30,271 INFO L93 Difference]: Finished difference Result 76091 states and 120546 transitions. [2019-09-10 06:04:30,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:04:30,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-10 06:04:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:30,431 INFO L225 Difference]: With dead ends: 76091 [2019-09-10 06:04:30,431 INFO L226 Difference]: Without dead ends: 76091 [2019-09-10 06:04:30,432 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:04:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76091 states. [2019-09-10 06:04:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76091 to 44321. [2019-09-10 06:04:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44321 states. [2019-09-10 06:04:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44321 states to 44321 states and 70298 transitions. [2019-09-10 06:04:31,393 INFO L78 Accepts]: Start accepts. Automaton has 44321 states and 70298 transitions. Word has length 69 [2019-09-10 06:04:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:31,393 INFO L475 AbstractCegarLoop]: Abstraction has 44321 states and 70298 transitions. [2019-09-10 06:04:31,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:04:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 44321 states and 70298 transitions. [2019-09-10 06:04:31,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 06:04:31,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:31,398 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] [2019-09-10 06:04:31,398 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:31,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:31,398 INFO L82 PathProgramCache]: Analyzing trace with hash 921927418, now seen corresponding path program 1 times [2019-09-10 06:04:31,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:31,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:31,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:31,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:31,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:31,473 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:04:31,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:31,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:31,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:31,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:31,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:31,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:31,476 INFO L87 Difference]: Start difference. First operand 44321 states and 70298 transitions. Second operand 3 states. [2019-09-10 06:04:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:31,590 INFO L93 Difference]: Finished difference Result 38379 states and 60918 transitions. [2019-09-10 06:04:31,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:31,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 06:04:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:31,684 INFO L225 Difference]: With dead ends: 38379 [2019-09-10 06:04:31,684 INFO L226 Difference]: Without dead ends: 38379 [2019-09-10 06:04:31,686 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:04:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38379 states. [2019-09-10 06:04:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38379 to 38377. [2019-09-10 06:04:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38377 states. [2019-09-10 06:04:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38377 states to 38377 states and 60917 transitions. [2019-09-10 06:04:33,349 INFO L78 Accepts]: Start accepts. Automaton has 38377 states and 60917 transitions. Word has length 91 [2019-09-10 06:04:33,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:33,349 INFO L475 AbstractCegarLoop]: Abstraction has 38377 states and 60917 transitions. [2019-09-10 06:04:33,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 38377 states and 60917 transitions. [2019-09-10 06:04:33,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 06:04:33,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:33,352 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] [2019-09-10 06:04:33,352 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:33,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:33,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1253263059, now seen corresponding path program 1 times [2019-09-10 06:04:33,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:33,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:33,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:33,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:33,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:33,451 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:04:33,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:33,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:33,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:33,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:33,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:33,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:33,452 INFO L87 Difference]: Start difference. First operand 38377 states and 60917 transitions. Second operand 3 states. [2019-09-10 06:04:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:33,497 INFO L93 Difference]: Finished difference Result 15702 states and 24870 transitions. [2019-09-10 06:04:33,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:33,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 06:04:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:33,517 INFO L225 Difference]: With dead ends: 15702 [2019-09-10 06:04:33,518 INFO L226 Difference]: Without dead ends: 15702 [2019-09-10 06:04:33,518 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:04:33,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15702 states. [2019-09-10 06:04:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15702 to 15700. [2019-09-10 06:04:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15700 states. [2019-09-10 06:04:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15700 states to 15700 states and 24869 transitions. [2019-09-10 06:04:33,719 INFO L78 Accepts]: Start accepts. Automaton has 15700 states and 24869 transitions. Word has length 91 [2019-09-10 06:04:33,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:33,719 INFO L475 AbstractCegarLoop]: Abstraction has 15700 states and 24869 transitions. [2019-09-10 06:04:33,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 15700 states and 24869 transitions. [2019-09-10 06:04:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:04:33,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:33,721 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] [2019-09-10 06:04:33,722 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:33,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:33,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2025166105, now seen corresponding path program 1 times [2019-09-10 06:04:33,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:33,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:33,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:33,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:33,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:04:33,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:33,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:04:33,813 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2019-09-10 06:04:33,815 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], [100], [105], [127], [131], [136], [153], [156], [158], [191], [194], [197], [200], [203], [210], [218], [220], [223], [224], [226], [235], [238], [249], [252], [262], [278], [281], [306], [314], [322], [332], [336], [338], [340], [343], [368], [376], [384], [390], [394], [398], [400], [402], [405], [430], [438], [446], [551], [552], [556], [557], [558] [2019-09-10 06:04:33,854 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:04:33,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:04:34,011 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:04:34,210 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:04:34,213 INFO L272 AbstractInterpreter]: Visited 85 different actions 222 times. Merged at 43 different actions 125 times. Widened at 5 different actions 5 times. Performed 775 root evaluator evaluations with a maximum evaluation depth of 5. Performed 775 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:04:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:34,218 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:04:34,475 INFO L227 lantSequenceWeakener]: Weakened 73 states. On average, predicates are now at 87.55% of their original sizes. [2019-09-10 06:04:34,475 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:04:37,585 INFO L420 sIntCurrentIteration]: We unified 92 AI predicates to 92 [2019-09-10 06:04:37,586 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:04:37,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:04:37,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [5] total 51 [2019-09-10 06:04:37,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:37,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 06:04:37,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 06:04:37,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1960, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:04:37,589 INFO L87 Difference]: Start difference. First operand 15700 states and 24869 transitions. Second operand 48 states. [2019-09-10 06:06:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:14,337 INFO L93 Difference]: Finished difference Result 217553 states and 332270 transitions. [2019-09-10 06:06:14,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 494 states. [2019-09-10 06:06:14,338 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-09-10 06:06:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:14,760 INFO L225 Difference]: With dead ends: 217553 [2019-09-10 06:06:14,760 INFO L226 Difference]: Without dead ends: 217553 [2019-09-10 06:06:14,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 508 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121270 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=26833, Invalid=232757, Unknown=0, NotChecked=0, Total=259590 [2019-09-10 06:06:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217553 states. [2019-09-10 06:06:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217553 to 49212. [2019-09-10 06:06:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49212 states. [2019-09-10 06:06:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49212 states to 49212 states and 77070 transitions. [2019-09-10 06:06:18,754 INFO L78 Accepts]: Start accepts. Automaton has 49212 states and 77070 transitions. Word has length 93 [2019-09-10 06:06:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:18,755 INFO L475 AbstractCegarLoop]: Abstraction has 49212 states and 77070 transitions. [2019-09-10 06:06:18,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 06:06:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 49212 states and 77070 transitions. [2019-09-10 06:06:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:06:18,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:18,758 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] [2019-09-10 06:06:18,758 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:18,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:18,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1450195081, now seen corresponding path program 1 times [2019-09-10 06:06:18,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:18,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:18,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:18,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:18,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:06:18,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:18,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:06:18,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:18,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:06:18,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:06:18,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:06:18,854 INFO L87 Difference]: Start difference. First operand 49212 states and 77070 transitions. Second operand 5 states. [2019-09-10 06:06:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:19,043 INFO L93 Difference]: Finished difference Result 58384 states and 91301 transitions. [2019-09-10 06:06:19,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:06:19,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 06:06:19,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:19,123 INFO L225 Difference]: With dead ends: 58384 [2019-09-10 06:06:19,123 INFO L226 Difference]: Without dead ends: 58384 [2019-09-10 06:06:19,123 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:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58384 states. [2019-09-10 06:06:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58384 to 57962. [2019-09-10 06:06:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57962 states. [2019-09-10 06:06:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57962 states to 57962 states and 90722 transitions. [2019-09-10 06:06:19,862 INFO L78 Accepts]: Start accepts. Automaton has 57962 states and 90722 transitions. Word has length 93 [2019-09-10 06:06:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:19,864 INFO L475 AbstractCegarLoop]: Abstraction has 57962 states and 90722 transitions. [2019-09-10 06:06:19,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:06:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 57962 states and 90722 transitions. [2019-09-10 06:06:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:06:19,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:19,869 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] [2019-09-10 06:06:19,870 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:19,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:19,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1673572506, now seen corresponding path program 1 times [2019-09-10 06:06:19,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:19,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:19,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:19,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:19,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:19,938 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:06:19,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:19,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:19,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:19,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:19,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:19,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:19,940 INFO L87 Difference]: Start difference. First operand 57962 states and 90722 transitions. Second operand 3 states. [2019-09-10 06:06:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:20,018 INFO L93 Difference]: Finished difference Result 25379 states and 39590 transitions. [2019-09-10 06:06:20,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:20,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 06:06:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:20,049 INFO L225 Difference]: With dead ends: 25379 [2019-09-10 06:06:20,049 INFO L226 Difference]: Without dead ends: 25379 [2019-09-10 06:06:20,049 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:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25379 states. [2019-09-10 06:06:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25379 to 25256. [2019-09-10 06:06:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25256 states. [2019-09-10 06:06:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25256 states to 25256 states and 39429 transitions. [2019-09-10 06:06:20,365 INFO L78 Accepts]: Start accepts. Automaton has 25256 states and 39429 transitions. Word has length 94 [2019-09-10 06:06:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:20,366 INFO L475 AbstractCegarLoop]: Abstraction has 25256 states and 39429 transitions. [2019-09-10 06:06:20,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 25256 states and 39429 transitions. [2019-09-10 06:06:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:06:20,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:20,371 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] [2019-09-10 06:06:20,371 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:20,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1834623754, now seen corresponding path program 1 times [2019-09-10 06:06:20,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:20,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:20,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:20,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:20,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:20,509 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:06:20,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:06:20,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:06:20,510 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2019-09-10 06:06:20,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], [100], [105], [127], [131], [136], [158], [162], [167], [184], [187], [189], [191], [194], [197], [200], [203], [210], [218], [220], [223], [224], [226], [235], [238], [249], [252], [262], [270], [274], [276], [278], [281], [306], [314], [322], [328], [332], [336], [338], [340], [343], [368], [376], [384], [390], [394], [398], [400], [402], [405], [430], [438], [446], [551], [552], [556], [557], [558] [2019-09-10 06:06:20,523 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:06:20,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:06:20,561 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:06:20,824 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:06:20,825 INFO L272 AbstractInterpreter]: Visited 93 different actions 392 times. Merged at 53 different actions 271 times. Widened at 21 different actions 42 times. Performed 1182 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1182 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 11 different actions. Largest state had 159 variables. [2019-09-10 06:06:20,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:20,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:06:20,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:06:20,827 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:06:20,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:20,854 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:06:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:21,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:06:21,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:06:21,343 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:06:21,344 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:06:21,393 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:06:21,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 06:06:21,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 06:06:21,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:21,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:06:21,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:06:21,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:06:21,407 INFO L87 Difference]: Start difference. First operand 25256 states and 39429 transitions. Second operand 5 states. [2019-09-10 06:06:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:21,520 INFO L93 Difference]: Finished difference Result 25828 states and 40303 transitions. [2019-09-10 06:06:21,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:06:21,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 06:06:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:21,552 INFO L225 Difference]: With dead ends: 25828 [2019-09-10 06:06:21,552 INFO L226 Difference]: Without dead ends: 25828 [2019-09-10 06:06:21,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 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:06:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25828 states. [2019-09-10 06:06:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25828 to 25256. [2019-09-10 06:06:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25256 states. [2019-09-10 06:06:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25256 states to 25256 states and 39389 transitions. [2019-09-10 06:06:21,869 INFO L78 Accepts]: Start accepts. Automaton has 25256 states and 39389 transitions. Word has length 95 [2019-09-10 06:06:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:21,869 INFO L475 AbstractCegarLoop]: Abstraction has 25256 states and 39389 transitions. [2019-09-10 06:06:21,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:06:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 25256 states and 39389 transitions. [2019-09-10 06:06:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:06:21,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:21,872 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] [2019-09-10 06:06:21,872 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:21,873 INFO L82 PathProgramCache]: Analyzing trace with hash 542691699, now seen corresponding path program 1 times [2019-09-10 06:06:21,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:21,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:21,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:21,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:21,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:21,991 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:06:21,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:21,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:06:21,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:21,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:06:21,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:06:21,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:06:21,993 INFO L87 Difference]: Start difference. First operand 25256 states and 39389 transitions. Second operand 4 states. [2019-09-10 06:06:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:22,140 INFO L93 Difference]: Finished difference Result 48907 states and 75618 transitions. [2019-09-10 06:06:22,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:06:22,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-10 06:06:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:22,197 INFO L225 Difference]: With dead ends: 48907 [2019-09-10 06:06:22,197 INFO L226 Difference]: Without dead ends: 48907 [2019-09-10 06:06:22,197 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:06:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48907 states. [2019-09-10 06:06:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48907 to 48891. [2019-09-10 06:06:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48891 states. [2019-09-10 06:06:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48891 states to 48891 states and 75603 transitions. [2019-09-10 06:06:23,015 INFO L78 Accepts]: Start accepts. Automaton has 48891 states and 75603 transitions. Word has length 96 [2019-09-10 06:06:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:23,016 INFO L475 AbstractCegarLoop]: Abstraction has 48891 states and 75603 transitions. [2019-09-10 06:06:23,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:06:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 48891 states and 75603 transitions. [2019-09-10 06:06:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:06:23,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:23,023 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] [2019-09-10 06:06:23,023 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:23,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1261540347, now seen corresponding path program 1 times [2019-09-10 06:06:23,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:23,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:23,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:23,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:23,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:23,081 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:06:23,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:23,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:23,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:23,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:23,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:23,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:23,083 INFO L87 Difference]: Start difference. First operand 48891 states and 75603 transitions. Second operand 3 states. [2019-09-10 06:06:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:23,357 INFO L93 Difference]: Finished difference Result 97768 states and 151185 transitions. [2019-09-10 06:06:23,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:23,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:06:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:23,482 INFO L225 Difference]: With dead ends: 97768 [2019-09-10 06:06:23,482 INFO L226 Difference]: Without dead ends: 97768 [2019-09-10 06:06:23,483 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:23,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97768 states. [2019-09-10 06:06:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97768 to 48893. [2019-09-10 06:06:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48893 states. [2019-09-10 06:06:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48893 states to 48893 states and 75605 transitions. [2019-09-10 06:06:24,532 INFO L78 Accepts]: Start accepts. Automaton has 48893 states and 75605 transitions. Word has length 97 [2019-09-10 06:06:24,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:24,532 INFO L475 AbstractCegarLoop]: Abstraction has 48893 states and 75605 transitions. [2019-09-10 06:06:24,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 48893 states and 75605 transitions. [2019-09-10 06:06:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:06:24,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:24,537 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] [2019-09-10 06:06:24,537 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1833528204, now seen corresponding path program 1 times [2019-09-10 06:06:24,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:24,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:24,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:24,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:24,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:24,629 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:06:24,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:24,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:06:24,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:24,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:06:24,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:06:24,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:06:24,631 INFO L87 Difference]: Start difference. First operand 48893 states and 75605 transitions. Second operand 4 states. [2019-09-10 06:06:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:24,901 INFO L93 Difference]: Finished difference Result 94755 states and 145554 transitions. [2019-09-10 06:06:24,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:06:24,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-10 06:06:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:25,037 INFO L225 Difference]: With dead ends: 94755 [2019-09-10 06:06:25,037 INFO L226 Difference]: Without dead ends: 94755 [2019-09-10 06:06:25,040 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:06:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94755 states. [2019-09-10 06:06:26,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94755 to 94725. [2019-09-10 06:06:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94725 states. [2019-09-10 06:06:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94725 states to 94725 states and 145525 transitions. [2019-09-10 06:06:26,255 INFO L78 Accepts]: Start accepts. Automaton has 94725 states and 145525 transitions. Word has length 98 [2019-09-10 06:06:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:26,255 INFO L475 AbstractCegarLoop]: Abstraction has 94725 states and 145525 transitions. [2019-09-10 06:06:26,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:06:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 94725 states and 145525 transitions. [2019-09-10 06:06:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:06:26,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:26,266 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] [2019-09-10 06:06:26,266 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:26,266 INFO L82 PathProgramCache]: Analyzing trace with hash -917326106, now seen corresponding path program 1 times [2019-09-10 06:06:26,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:26,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:26,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:26,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:26,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:26,306 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:06:26,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:26,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:26,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:26,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:26,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:26,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:26,309 INFO L87 Difference]: Start difference. First operand 94725 states and 145525 transitions. Second operand 3 states. [2019-09-10 06:06:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:26,787 INFO L93 Difference]: Finished difference Result 189414 states and 290993 transitions. [2019-09-10 06:06:26,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:26,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 06:06:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:27,094 INFO L225 Difference]: With dead ends: 189414 [2019-09-10 06:06:27,094 INFO L226 Difference]: Without dead ends: 189414 [2019-09-10 06:06:27,101 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:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189414 states. [2019-09-10 06:06:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189414 to 94729. [2019-09-10 06:06:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94729 states. [2019-09-10 06:06:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94729 states to 94729 states and 145529 transitions. [2019-09-10 06:06:29,064 INFO L78 Accepts]: Start accepts. Automaton has 94729 states and 145529 transitions. Word has length 99 [2019-09-10 06:06:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:29,064 INFO L475 AbstractCegarLoop]: Abstraction has 94729 states and 145529 transitions. [2019-09-10 06:06:29,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 94729 states and 145529 transitions. [2019-09-10 06:06:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:06:29,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:29,070 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] [2019-09-10 06:06:29,070 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:29,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:29,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1826850017, now seen corresponding path program 1 times [2019-09-10 06:06:29,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:29,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:29,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:29,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:29,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:29,128 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:06:29,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:29,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:29,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:29,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:29,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:29,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:29,130 INFO L87 Difference]: Start difference. First operand 94729 states and 145529 transitions. Second operand 3 states. [2019-09-10 06:06:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:29,442 INFO L93 Difference]: Finished difference Result 183454 states and 279093 transitions. [2019-09-10 06:06:29,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:29,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 06:06:29,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:29,637 INFO L225 Difference]: With dead ends: 183454 [2019-09-10 06:06:29,637 INFO L226 Difference]: Without dead ends: 183454 [2019-09-10 06:06:29,637 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:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183454 states. [2019-09-10 06:06:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183454 to 183396. [2019-09-10 06:06:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183396 states. [2019-09-10 06:06:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183396 states to 183396 states and 279036 transitions. [2019-09-10 06:06:33,747 INFO L78 Accepts]: Start accepts. Automaton has 183396 states and 279036 transitions. Word has length 100 [2019-09-10 06:06:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:33,747 INFO L475 AbstractCegarLoop]: Abstraction has 183396 states and 279036 transitions. [2019-09-10 06:06:33,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 183396 states and 279036 transitions. [2019-09-10 06:06:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:06:33,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:33,756 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] [2019-09-10 06:06:33,756 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:33,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:33,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1677738748, now seen corresponding path program 1 times [2019-09-10 06:06:33,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:33,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:33,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:33,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:33,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:33,851 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:06:33,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:33,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:06:33,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:33,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:06:33,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:06:33,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:06:33,852 INFO L87 Difference]: Start difference. First operand 183396 states and 279036 transitions. Second operand 4 states. [2019-09-10 06:06:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:34,794 INFO L93 Difference]: Finished difference Result 183808 states and 277236 transitions. [2019-09-10 06:06:34,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:06:34,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-10 06:06:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:34,991 INFO L225 Difference]: With dead ends: 183808 [2019-09-10 06:06:34,992 INFO L226 Difference]: Without dead ends: 183579 [2019-09-10 06:06:34,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183579 states. [2019-09-10 06:06:37,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183579 to 183577. [2019-09-10 06:06:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183577 states. [2019-09-10 06:06:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183577 states to 183577 states and 276965 transitions. [2019-09-10 06:06:37,284 INFO L78 Accepts]: Start accepts. Automaton has 183577 states and 276965 transitions. Word has length 100 [2019-09-10 06:06:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:37,284 INFO L475 AbstractCegarLoop]: Abstraction has 183577 states and 276965 transitions. [2019-09-10 06:06:37,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:06:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 183577 states and 276965 transitions. [2019-09-10 06:06:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:06:37,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:37,290 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] [2019-09-10 06:06:37,290 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1762067467, now seen corresponding path program 1 times [2019-09-10 06:06:37,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:37,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:37,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:37,380 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:06:37,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:37,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:06:37,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:37,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:06:37,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:06:37,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:06:37,381 INFO L87 Difference]: Start difference. First operand 183577 states and 276965 transitions. Second operand 4 states. [2019-09-10 06:06:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:37,766 INFO L93 Difference]: Finished difference Result 183579 states and 276957 transitions. [2019-09-10 06:06:37,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:06:37,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-10 06:06:37,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:37,960 INFO L225 Difference]: With dead ends: 183579 [2019-09-10 06:06:37,961 INFO L226 Difference]: Without dead ends: 183579 [2019-09-10 06:06:37,961 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:06:38,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183579 states. [2019-09-10 06:06:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183579 to 183352. [2019-09-10 06:06:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183352 states. [2019-09-10 06:06:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183352 states to 183352 states and 276697 transitions. [2019-09-10 06:06:42,960 INFO L78 Accepts]: Start accepts. Automaton has 183352 states and 276697 transitions. Word has length 100 [2019-09-10 06:06:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:42,961 INFO L475 AbstractCegarLoop]: Abstraction has 183352 states and 276697 transitions. [2019-09-10 06:06:42,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:06:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 183352 states and 276697 transitions. [2019-09-10 06:06:42,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:06:42,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:42,967 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:06:42,967 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:42,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:42,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1839724576, now seen corresponding path program 1 times [2019-09-10 06:06:42,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:42,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:42,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:42,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:42,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:43,011 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:06:43,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:43,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:43,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:43,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:43,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:43,013 INFO L87 Difference]: Start difference. First operand 183352 states and 276697 transitions. Second operand 3 states. [2019-09-10 06:06:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:44,536 INFO L93 Difference]: Finished difference Result 366596 states and 553235 transitions. [2019-09-10 06:06:44,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:44,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 06:06:44,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:44,937 INFO L225 Difference]: With dead ends: 366596 [2019-09-10 06:06:44,937 INFO L226 Difference]: Without dead ends: 366596 [2019-09-10 06:06:44,938 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:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366596 states. [2019-09-10 06:06:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366596 to 183360. [2019-09-10 06:06:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183360 states. [2019-09-10 06:06:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183360 states to 183360 states and 276705 transitions. [2019-09-10 06:06:49,430 INFO L78 Accepts]: Start accepts. Automaton has 183360 states and 276705 transitions. Word has length 101 [2019-09-10 06:06:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:49,431 INFO L475 AbstractCegarLoop]: Abstraction has 183360 states and 276705 transitions. [2019-09-10 06:06:49,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 183360 states and 276705 transitions. [2019-09-10 06:06:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:06:49,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:49,437 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:06:49,437 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:49,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:49,437 INFO L82 PathProgramCache]: Analyzing trace with hash -561977027, now seen corresponding path program 1 times [2019-09-10 06:06:49,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:49,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:49,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:49,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:49,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:49,531 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:06:49,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:49,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:06:49,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:49,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:06:49,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:06:49,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:06:49,533 INFO L87 Difference]: Start difference. First operand 183360 states and 276705 transitions. Second operand 4 states. [2019-09-10 06:06:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:50,395 INFO L93 Difference]: Finished difference Result 357193 states and 534870 transitions. [2019-09-10 06:06:50,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:06:50,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-10 06:06:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:50,901 INFO L225 Difference]: With dead ends: 357193 [2019-09-10 06:06:50,901 INFO L226 Difference]: Without dead ends: 357193 [2019-09-10 06:06:50,902 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:06:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357193 states. [2019-09-10 06:07:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357193 to 357079. [2019-09-10 06:07:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357079 states. [2019-09-10 06:07:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357079 states to 357079 states and 534701 transitions. [2019-09-10 06:07:01,327 INFO L78 Accepts]: Start accepts. Automaton has 357079 states and 534701 transitions. Word has length 102 [2019-09-10 06:07:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:01,327 INFO L475 AbstractCegarLoop]: Abstraction has 357079 states and 534701 transitions. [2019-09-10 06:07:01,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:07:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 357079 states and 534701 transitions. [2019-09-10 06:07:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:07:01,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:01,337 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:07:01,337 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:01,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash 909068278, now seen corresponding path program 1 times [2019-09-10 06:07:01,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:01,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:01,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:01,435 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:07:01,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:01,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:07:01,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:01,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:07:01,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:07:01,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:07:01,437 INFO L87 Difference]: Start difference. First operand 357079 states and 534701 transitions. Second operand 4 states. [2019-09-10 06:07:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:02,252 INFO L93 Difference]: Finished difference Result 412533 states and 612486 transitions. [2019-09-10 06:07:02,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:07:02,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-10 06:07:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:02,820 INFO L225 Difference]: With dead ends: 412533 [2019-09-10 06:07:02,820 INFO L226 Difference]: Without dead ends: 412533 [2019-09-10 06:07:02,820 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:07:03,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412533 states. [2019-09-10 06:07:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412533 to 411228. [2019-09-10 06:07:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411228 states. [2019-09-10 06:07:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411228 states to 411228 states and 611166 transitions. [2019-09-10 06:07:14,277 INFO L78 Accepts]: Start accepts. Automaton has 411228 states and 611166 transitions. Word has length 102 [2019-09-10 06:07:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:14,278 INFO L475 AbstractCegarLoop]: Abstraction has 411228 states and 611166 transitions. [2019-09-10 06:07:14,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:07:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 411228 states and 611166 transitions. [2019-09-10 06:07:14,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:07:14,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:14,283 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:14,283 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:14,284 INFO L82 PathProgramCache]: Analyzing trace with hash -144487214, now seen corresponding path program 1 times [2019-09-10 06:07:14,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:14,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:14,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:14,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:14,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:07:14,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:14,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:14,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:14,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:14,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:14,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:14,338 INFO L87 Difference]: Start difference. First operand 411228 states and 611166 transitions. Second operand 3 states. [2019-09-10 06:07:20,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:20,010 INFO L93 Difference]: Finished difference Result 599868 states and 890791 transitions. [2019-09-10 06:07:20,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:20,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 06:07:20,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:20,766 INFO L225 Difference]: With dead ends: 599868 [2019-09-10 06:07:20,766 INFO L226 Difference]: Without dead ends: 599868 [2019-09-10 06:07:20,766 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:07:21,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599868 states. [2019-09-10 06:07:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599868 to 597922. [2019-09-10 06:07:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597922 states. [2019-09-10 06:07:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597922 states to 597922 states and 888846 transitions. [2019-09-10 06:07:32,566 INFO L78 Accepts]: Start accepts. Automaton has 597922 states and 888846 transitions. Word has length 102 [2019-09-10 06:07:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:32,566 INFO L475 AbstractCegarLoop]: Abstraction has 597922 states and 888846 transitions. [2019-09-10 06:07:32,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 597922 states and 888846 transitions. [2019-09-10 06:07:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:07:32,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:32,572 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:07:32,573 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:32,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:32,573 INFO L82 PathProgramCache]: Analyzing trace with hash 276868742, now seen corresponding path program 1 times [2019-09-10 06:07:32,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:32,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:32,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:32,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:32,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:32,658 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:07:32,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:32,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:07:32,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:32,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:07:32,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:07:32,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:07:32,659 INFO L87 Difference]: Start difference. First operand 597922 states and 888846 transitions. Second operand 4 states. [2019-09-10 06:07:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:40,141 INFO L93 Difference]: Finished difference Result 556008 states and 827469 transitions. [2019-09-10 06:07:40,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:07:40,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-10 06:07:40,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:40,815 INFO L225 Difference]: With dead ends: 556008 [2019-09-10 06:07:40,815 INFO L226 Difference]: Without dead ends: 556008 [2019-09-10 06:07:40,816 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:07:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556008 states. [2019-09-10 06:07:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556008 to 556006. [2019-09-10 06:07:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556006 states. [2019-09-10 06:07:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556006 states to 556006 states and 827468 transitions. [2019-09-10 06:07:53,287 INFO L78 Accepts]: Start accepts. Automaton has 556006 states and 827468 transitions. Word has length 102 [2019-09-10 06:07:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:53,287 INFO L475 AbstractCegarLoop]: Abstraction has 556006 states and 827468 transitions. [2019-09-10 06:07:53,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:07:53,287 INFO L276 IsEmpty]: Start isEmpty. Operand 556006 states and 827468 transitions. [2019-09-10 06:07:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:07:53,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:53,292 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:07:53,292 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:53,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:53,292 INFO L82 PathProgramCache]: Analyzing trace with hash -767758119, now seen corresponding path program 1 times [2019-09-10 06:07:53,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:53,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:53,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:53,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:53,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:07:53,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:53,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:53,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:53,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:53,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:53,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:53,353 INFO L87 Difference]: Start difference. First operand 556006 states and 827468 transitions. Second operand 3 states. [2019-09-10 06:08:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:02,425 INFO L93 Difference]: Finished difference Result 988152 states and 1470323 transitions. [2019-09-10 06:08:02,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:02,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 06:08:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:04,558 INFO L225 Difference]: With dead ends: 988152 [2019-09-10 06:08:04,558 INFO L226 Difference]: Without dead ends: 988152 [2019-09-10 06:08:04,559 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:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988152 states. [2019-09-10 06:08:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988152 to 984890. [2019-09-10 06:08:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984890 states. [2019-09-10 06:08:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984890 states to 984890 states and 1467062 transitions. [2019-09-10 06:08:34,217 INFO L78 Accepts]: Start accepts. Automaton has 984890 states and 1467062 transitions. Word has length 104 [2019-09-10 06:08:34,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:34,217 INFO L475 AbstractCegarLoop]: Abstraction has 984890 states and 1467062 transitions. [2019-09-10 06:08:34,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 984890 states and 1467062 transitions. [2019-09-10 06:08:34,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:08:34,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:34,222 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:34,223 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:34,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:34,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1478879878, now seen corresponding path program 1 times [2019-09-10 06:08:34,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:34,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:34,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:34,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:34,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:34,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:08:34,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:08:34,298 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-10 06:08:34,298 INFO L207 CegarAbsIntRunner]: [0], [5], [10], [15], [20], [25], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [105], [127], [131], [136], [158], [162], [167], [184], [187], [189], [191], [194], [197], [200], [203], [210], [218], [220], [223], [224], [226], [235], [238], [249], [252], [256], [270], [274], [276], [278], [281], [306], [314], [322], [328], [332], [336], [338], [340], [343], [368], [376], [384], [390], [394], [398], [400], [402], [405], [430], [438], [446], [472], [483], [485], [496], [498], [509], [511], [522], [524], [535], [537], [548], [551], [552], [556], [557], [558] [2019-09-10 06:08:34,301 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:08:34,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:08:34,320 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:08:34,435 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:08:34,435 INFO L272 AbstractInterpreter]: Visited 98 different actions 288 times. Merged at 50 different actions 170 times. Widened at 8 different actions 8 times. Performed 943 root evaluator evaluations with a maximum evaluation depth of 5. Performed 943 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 4 different actions. Largest state had 159 variables. [2019-09-10 06:08:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:34,436 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:08:34,609 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 86.85% of their original sizes. [2019-09-10 06:08:34,610 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:08:37,247 INFO L420 sIntCurrentIteration]: We unified 103 AI predicates to 103 [2019-09-10 06:08:37,247 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:08:37,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:08:37,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [6] total 55 [2019-09-10 06:08:37,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:37,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-10 06:08:37,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-10 06:08:37,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=2212, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:08:37,249 INFO L87 Difference]: Start difference. First operand 984890 states and 1467062 transitions. Second operand 51 states. [2019-09-10 06:11:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:23,432 INFO L93 Difference]: Finished difference Result 4617825 states and 6790705 transitions. [2019-09-10 06:11:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 420 states. [2019-09-10 06:11:23,432 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 104 [2019-09-10 06:11:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:31,590 INFO L225 Difference]: With dead ends: 4617825 [2019-09-10 06:11:31,591 INFO L226 Difference]: Without dead ends: 4617825 [2019-09-10 06:11:31,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 441 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86519 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=23415, Invalid=172391, Unknown=0, NotChecked=0, Total=195806 [2019-09-10 06:11:35,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617825 states.