java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:04:51,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:04:51,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:04:51,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:04:51,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:04:51,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:04:51,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:04:51,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:04:51,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:04:51,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:04:51,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:04:51,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:04:51,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:04:51,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:04:51,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:04:51,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:04:51,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:04:51,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:04:51,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:04:51,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:04:51,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:04:51,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:04:51,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:04:51,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:04:51,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:04:51,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:04:51,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:04:51,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:04:51,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:04:51,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:04:51,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:04:51,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:04:51,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:04:51,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:04:51,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:04:51,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:04:51,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:04:51,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:04:51,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:04:51,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:04:51,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:04:51,420 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:51,434 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:04:51,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:04:51,435 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:04:51,435 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:04:51,436 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:04:51,436 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:04:51,436 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:04:51,437 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:04:51,437 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:04:51,437 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:04:51,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:04:51,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:04:51,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:04:51,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:04:51,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:04:51,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:04:51,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:04:51,439 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:04:51,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:04:51,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:04:51,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:04:51,440 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:04:51,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:04:51,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:04:51,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:04:51,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:04:51,441 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:04:51,441 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:04:51,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:04:51,441 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:04:51,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:04:51,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:04:51,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:04:51,486 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:04:51,487 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:04:51,487 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 06:04:51,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2628fa0/ba6a0bd77fe043e291bf8e5c5bb21d95/FLAGf96c47754 [2019-09-10 06:04:52,041 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:04:52,042 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 06:04:52,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2628fa0/ba6a0bd77fe043e291bf8e5c5bb21d95/FLAGf96c47754 [2019-09-10 06:04:52,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2628fa0/ba6a0bd77fe043e291bf8e5c5bb21d95 [2019-09-10 06:04:52,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:04:52,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:04:52,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:04:52,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:04:52,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:04:52,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:04:52" (1/1) ... [2019-09-10 06:04:52,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c490221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:52, skipping insertion in model container [2019-09-10 06:04:52,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:04:52" (1/1) ... [2019-09-10 06:04:52,398 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:04:52,465 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:04:52,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:04:52,832 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:04:52,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:04:52,985 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:04:52,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:52 WrapperNode [2019-09-10 06:04:52,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:04:52,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:04:52,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:04:52,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:04:52,998 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:52" (1/1) ... [2019-09-10 06:04:52,998 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:52" (1/1) ... [2019-09-10 06:04:53,009 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:52" (1/1) ... [2019-09-10 06:04:53,010 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:52" (1/1) ... [2019-09-10 06:04:53,025 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:52" (1/1) ... [2019-09-10 06:04:53,036 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:52" (1/1) ... [2019-09-10 06:04:53,039 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:52" (1/1) ... [2019-09-10 06:04:53,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:04:53,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:04:53,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:04:53,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:04:53,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:52" (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:53,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:04:53,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:04:53,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:04:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:04:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:04:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:04:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:04:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:04:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:04:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:04:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:04:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:04:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:04:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:04:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:04:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:04:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:04:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:04:53,967 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:04:53,967 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:04:53,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:04:53 BoogieIcfgContainer [2019-09-10 06:04:53,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:04:53,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:04:53,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:04:53,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:04:53,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:04:52" (1/3) ... [2019-09-10 06:04:53,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42644de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:04:53, skipping insertion in model container [2019-09-10 06:04:53,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:04:52" (2/3) ... [2019-09-10 06:04:53,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42644de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:04:53, skipping insertion in model container [2019-09-10 06:04:53,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:04:53" (3/3) ... [2019-09-10 06:04:53,977 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 06:04:53,987 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:04:53,995 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:04:54,012 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:04:54,039 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:04:54,040 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:04:54,040 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:04:54,040 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:04:54,040 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:04:54,041 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:04:54,041 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:04:54,041 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:04:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-10 06:04:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:04:54,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:54,078 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:54,081 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:54,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:54,087 INFO L82 PathProgramCache]: Analyzing trace with hash 8502252, now seen corresponding path program 1 times [2019-09-10 06:04:54,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:54,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:54,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:54,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:54,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:54,543 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:54,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:54,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:54,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:54,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:54,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:54,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:54,570 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-10 06:04:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:54,694 INFO L93 Difference]: Finished difference Result 213 states and 354 transitions. [2019-09-10 06:04:54,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:54,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:04:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:54,718 INFO L225 Difference]: With dead ends: 213 [2019-09-10 06:04:54,719 INFO L226 Difference]: Without dead ends: 205 [2019-09-10 06:04:54,722 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:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-10 06:04:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2019-09-10 06:04:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-10 06:04:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 317 transitions. [2019-09-10 06:04:54,804 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 317 transitions. Word has length 61 [2019-09-10 06:04:54,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:54,805 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 317 transitions. [2019-09-10 06:04:54,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 317 transitions. [2019-09-10 06:04:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:04:54,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:54,809 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:54,809 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:54,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:54,810 INFO L82 PathProgramCache]: Analyzing trace with hash -851487175, now seen corresponding path program 1 times [2019-09-10 06:04:54,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:54,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:54,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:54,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:54,947 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:54,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:54,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:54,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:54,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:54,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:54,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:54,950 INFO L87 Difference]: Start difference. First operand 203 states and 317 transitions. Second operand 3 states. [2019-09-10 06:04:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:54,987 INFO L93 Difference]: Finished difference Result 334 states and 530 transitions. [2019-09-10 06:04:54,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:54,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-10 06:04:54,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:54,990 INFO L225 Difference]: With dead ends: 334 [2019-09-10 06:04:54,990 INFO L226 Difference]: Without dead ends: 334 [2019-09-10 06:04:54,991 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:54,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-10 06:04:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-09-10 06:04:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-10 06:04:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 529 transitions. [2019-09-10 06:04:55,019 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 529 transitions. Word has length 63 [2019-09-10 06:04:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:55,019 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 529 transitions. [2019-09-10 06:04:55,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 529 transitions. [2019-09-10 06:04:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:04:55,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:55,027 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:55,027 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:55,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:55,028 INFO L82 PathProgramCache]: Analyzing trace with hash 812724513, now seen corresponding path program 1 times [2019-09-10 06:04:55,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:55,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:55,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:55,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:55,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:55,172 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:55,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:55,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:55,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:55,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:55,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:55,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:55,175 INFO L87 Difference]: Start difference. First operand 332 states and 529 transitions. Second operand 3 states. [2019-09-10 06:04:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:55,198 INFO L93 Difference]: Finished difference Result 462 states and 740 transitions. [2019-09-10 06:04:55,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:55,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 06:04:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:55,202 INFO L225 Difference]: With dead ends: 462 [2019-09-10 06:04:55,202 INFO L226 Difference]: Without dead ends: 462 [2019-09-10 06:04:55,203 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:55,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-10 06:04:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2019-09-10 06:04:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-10 06:04:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 739 transitions. [2019-09-10 06:04:55,222 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 739 transitions. Word has length 65 [2019-09-10 06:04:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:55,222 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 739 transitions. [2019-09-10 06:04:55,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 739 transitions. [2019-09-10 06:04:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:04:55,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:55,227 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:55,227 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1750058316, now seen corresponding path program 1 times [2019-09-10 06:04:55,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:55,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:55,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:55,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:55,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:55,312 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:55,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:55,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:55,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:55,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:55,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:55,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:55,314 INFO L87 Difference]: Start difference. First operand 460 states and 739 transitions. Second operand 3 states. [2019-09-10 06:04:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:55,346 INFO L93 Difference]: Finished difference Result 797 states and 1282 transitions. [2019-09-10 06:04:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:55,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 06:04:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:55,352 INFO L225 Difference]: With dead ends: 797 [2019-09-10 06:04:55,353 INFO L226 Difference]: Without dead ends: 797 [2019-09-10 06:04:55,353 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:55,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-09-10 06:04:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 795. [2019-09-10 06:04:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-09-10 06:04:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1281 transitions. [2019-09-10 06:04:55,377 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1281 transitions. Word has length 65 [2019-09-10 06:04:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:55,380 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1281 transitions. [2019-09-10 06:04:55,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1281 transitions. [2019-09-10 06:04:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:04:55,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:55,382 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:55,383 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:55,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1895724377, now seen corresponding path program 1 times [2019-09-10 06:04:55,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:55,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:55,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:55,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:55,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:55,563 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:55,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:55,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:04:55,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:55,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:04:55,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:04:55,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:04:55,567 INFO L87 Difference]: Start difference. First operand 795 states and 1281 transitions. Second operand 5 states. [2019-09-10 06:04:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:55,712 INFO L93 Difference]: Finished difference Result 2019 states and 3301 transitions. [2019-09-10 06:04:55,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:04:55,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-10 06:04:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:55,724 INFO L225 Difference]: With dead ends: 2019 [2019-09-10 06:04:55,725 INFO L226 Difference]: Without dead ends: 2019 [2019-09-10 06:04:55,725 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:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-09-10 06:04:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1761. [2019-09-10 06:04:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-09-10 06:04:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2868 transitions. [2019-09-10 06:04:55,776 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2868 transitions. Word has length 67 [2019-09-10 06:04:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:55,776 INFO L475 AbstractCegarLoop]: Abstraction has 1761 states and 2868 transitions. [2019-09-10 06:04:55,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:04:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2868 transitions. [2019-09-10 06:04:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:04:55,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:55,778 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:55,778 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:55,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:55,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1423696929, now seen corresponding path program 1 times [2019-09-10 06:04:55,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:55,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:55,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:55,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:55,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:55,885 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:55,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:55,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:04:55,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:55,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:04:55,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:04:55,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:04:55,887 INFO L87 Difference]: Start difference. First operand 1761 states and 2868 transitions. Second operand 6 states. [2019-09-10 06:04:56,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:56,133 INFO L93 Difference]: Finished difference Result 5000 states and 8151 transitions. [2019-09-10 06:04:56,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:04:56,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-10 06:04:56,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:56,162 INFO L225 Difference]: With dead ends: 5000 [2019-09-10 06:04:56,162 INFO L226 Difference]: Without dead ends: 5000 [2019-09-10 06:04:56,163 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:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5000 states. [2019-09-10 06:04:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5000 to 4931. [2019-09-10 06:04:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4931 states. [2019-09-10 06:04:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4931 states to 4931 states and 8050 transitions. [2019-09-10 06:04:56,281 INFO L78 Accepts]: Start accepts. Automaton has 4931 states and 8050 transitions. Word has length 68 [2019-09-10 06:04:56,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:56,281 INFO L475 AbstractCegarLoop]: Abstraction has 4931 states and 8050 transitions. [2019-09-10 06:04:56,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:04:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4931 states and 8050 transitions. [2019-09-10 06:04:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:04:56,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:56,283 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:56,283 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:56,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1771341997, now seen corresponding path program 1 times [2019-09-10 06:04:56,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:56,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:56,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:56,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:56,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:56,352 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:56,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:56,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:56,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:56,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:56,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:56,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:56,354 INFO L87 Difference]: Start difference. First operand 4931 states and 8050 transitions. Second operand 3 states. [2019-09-10 06:04:56,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:56,419 INFO L93 Difference]: Finished difference Result 6705 states and 10898 transitions. [2019-09-10 06:04:56,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:56,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:04:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:56,455 INFO L225 Difference]: With dead ends: 6705 [2019-09-10 06:04:56,455 INFO L226 Difference]: Without dead ends: 6705 [2019-09-10 06:04:56,456 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:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2019-09-10 06:04:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 6703. [2019-09-10 06:04:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6703 states. [2019-09-10 06:04:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6703 states to 6703 states and 10897 transitions. [2019-09-10 06:04:56,658 INFO L78 Accepts]: Start accepts. Automaton has 6703 states and 10897 transitions. Word has length 68 [2019-09-10 06:04:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:56,659 INFO L475 AbstractCegarLoop]: Abstraction has 6703 states and 10897 transitions. [2019-09-10 06:04:56,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 6703 states and 10897 transitions. [2019-09-10 06:04:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:04:56,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:56,660 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:56,661 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:56,661 INFO L82 PathProgramCache]: Analyzing trace with hash 334558445, now seen corresponding path program 1 times [2019-09-10 06:04:56,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:56,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:56,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:56,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:56,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:56,715 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:56,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:56,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:56,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:56,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:56,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:56,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:56,717 INFO L87 Difference]: Start difference. First operand 6703 states and 10897 transitions. Second operand 3 states. [2019-09-10 06:04:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:56,788 INFO L93 Difference]: Finished difference Result 9919 states and 16100 transitions. [2019-09-10 06:04:56,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:56,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:04:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:56,853 INFO L225 Difference]: With dead ends: 9919 [2019-09-10 06:04:56,853 INFO L226 Difference]: Without dead ends: 9919 [2019-09-10 06:04:56,854 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:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9919 states. [2019-09-10 06:04:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9919 to 9917. [2019-09-10 06:04:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9917 states. [2019-09-10 06:04:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9917 states to 9917 states and 16099 transitions. [2019-09-10 06:04:57,124 INFO L78 Accepts]: Start accepts. Automaton has 9917 states and 16099 transitions. Word has length 68 [2019-09-10 06:04:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:57,125 INFO L475 AbstractCegarLoop]: Abstraction has 9917 states and 16099 transitions. [2019-09-10 06:04:57,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 9917 states and 16099 transitions. [2019-09-10 06:04:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:04:57,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:57,126 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:57,127 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:57,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:57,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1241984288, now seen corresponding path program 1 times [2019-09-10 06:04:57,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:57,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:57,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:57,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:57,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:57,251 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:57,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:57,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:04:57,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:57,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:04:57,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:04:57,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:04:57,253 INFO L87 Difference]: Start difference. First operand 9917 states and 16099 transitions. Second operand 4 states. [2019-09-10 06:04:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:57,379 INFO L93 Difference]: Finished difference Result 15484 states and 25083 transitions. [2019-09-10 06:04:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:04:57,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-10 06:04:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:57,416 INFO L225 Difference]: With dead ends: 15484 [2019-09-10 06:04:57,416 INFO L226 Difference]: Without dead ends: 15484 [2019-09-10 06:04:57,417 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:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15484 states. [2019-09-10 06:04:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15484 to 15417. [2019-09-10 06:04:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15417 states. [2019-09-10 06:04:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15417 states to 15417 states and 24955 transitions. [2019-09-10 06:04:57,685 INFO L78 Accepts]: Start accepts. Automaton has 15417 states and 24955 transitions. Word has length 69 [2019-09-10 06:04:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:57,685 INFO L475 AbstractCegarLoop]: Abstraction has 15417 states and 24955 transitions. [2019-09-10 06:04:57,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:04:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 15417 states and 24955 transitions. [2019-09-10 06:04:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:04:57,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:57,687 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:57,687 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:57,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash 100698310, now seen corresponding path program 1 times [2019-09-10 06:04:57,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:57,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:57,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:57,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:57,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:57,951 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:57,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:57,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:04:57,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:57,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:04:57,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:04:57,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:04:57,953 INFO L87 Difference]: Start difference. First operand 15417 states and 24955 transitions. Second operand 4 states. [2019-09-10 06:04:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:58,164 INFO L93 Difference]: Finished difference Result 30207 states and 48922 transitions. [2019-09-10 06:04:58,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:04:58,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-09-10 06:04:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:58,243 INFO L225 Difference]: With dead ends: 30207 [2019-09-10 06:04:58,243 INFO L226 Difference]: Without dead ends: 30207 [2019-09-10 06:04:58,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:04:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30207 states. [2019-09-10 06:04:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30207 to 22725. [2019-09-10 06:04:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-09-10 06:04:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 36691 transitions. [2019-09-10 06:04:59,144 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 36691 transitions. Word has length 70 [2019-09-10 06:04:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:59,145 INFO L475 AbstractCegarLoop]: Abstraction has 22725 states and 36691 transitions. [2019-09-10 06:04:59,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:04:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 36691 transitions. [2019-09-10 06:04:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:04:59,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:59,146 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:59,146 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:59,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:59,147 INFO L82 PathProgramCache]: Analyzing trace with hash 792159510, now seen corresponding path program 1 times [2019-09-10 06:04:59,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:59,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:59,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:59,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:59,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:59,269 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:59,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:59,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:04:59,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:59,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:04:59,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:04:59,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:04:59,271 INFO L87 Difference]: Start difference. First operand 22725 states and 36691 transitions. Second operand 5 states. [2019-09-10 06:04:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:59,432 INFO L93 Difference]: Finished difference Result 24433 states and 39371 transitions. [2019-09-10 06:04:59,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:04:59,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 06:04:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:59,484 INFO L225 Difference]: With dead ends: 24433 [2019-09-10 06:04:59,484 INFO L226 Difference]: Without dead ends: 24433 [2019-09-10 06:04:59,485 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:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24433 states. [2019-09-10 06:04:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24433 to 22725. [2019-09-10 06:04:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-09-10 06:04:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 36556 transitions. [2019-09-10 06:04:59,961 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 36556 transitions. Word has length 72 [2019-09-10 06:04:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:59,962 INFO L475 AbstractCegarLoop]: Abstraction has 22725 states and 36556 transitions. [2019-09-10 06:04:59,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:04:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 36556 transitions. [2019-09-10 06:04:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:04:59,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:59,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:59,963 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:59,964 INFO L82 PathProgramCache]: Analyzing trace with hash 624122737, now seen corresponding path program 1 times [2019-09-10 06:04:59,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:59,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:59,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:59,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:59,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:05:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:05:00,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:05:00,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:05:00,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:05:00,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:05:00,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:05:00,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:05:00,119 INFO L87 Difference]: Start difference. First operand 22725 states and 36556 transitions. Second operand 5 states. [2019-09-10 06:05:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:05:00,374 INFO L93 Difference]: Finished difference Result 41388 states and 66191 transitions. [2019-09-10 06:05:00,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:05:00,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 06:05:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:05:00,482 INFO L225 Difference]: With dead ends: 41388 [2019-09-10 06:05:00,483 INFO L226 Difference]: Without dead ends: 41388 [2019-09-10 06:05:00,483 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:05:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41388 states. [2019-09-10 06:05:01,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41388 to 41386. [2019-09-10 06:05:01,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41386 states. [2019-09-10 06:05:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41386 states to 41386 states and 66190 transitions. [2019-09-10 06:05:01,727 INFO L78 Accepts]: Start accepts. Automaton has 41386 states and 66190 transitions. Word has length 75 [2019-09-10 06:05:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:05:01,727 INFO L475 AbstractCegarLoop]: Abstraction has 41386 states and 66190 transitions. [2019-09-10 06:05:01,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:05:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 41386 states and 66190 transitions. [2019-09-10 06:05:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:05:01,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:05:01,728 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:05:01,729 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:05:01,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:05:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2128940941, now seen corresponding path program 1 times [2019-09-10 06:05:01,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:05:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:01,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:05:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:01,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:05:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:05:01,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:05:01,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:05:01,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:05:01,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:05:01,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:05:01,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:05:01,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:05:01,848 INFO L87 Difference]: Start difference. First operand 41386 states and 66190 transitions. Second operand 5 states. [2019-09-10 06:05:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:05:02,133 INFO L93 Difference]: Finished difference Result 72834 states and 115276 transitions. [2019-09-10 06:05:02,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:05:02,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 06:05:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:05:02,324 INFO L225 Difference]: With dead ends: 72834 [2019-09-10 06:05:02,324 INFO L226 Difference]: Without dead ends: 72834 [2019-09-10 06:05:02,325 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:05:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72834 states. [2019-09-10 06:05:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72834 to 42462. [2019-09-10 06:05:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42462 states. [2019-09-10 06:05:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42462 states to 42462 states and 67257 transitions. [2019-09-10 06:05:04,588 INFO L78 Accepts]: Start accepts. Automaton has 42462 states and 67257 transitions. Word has length 76 [2019-09-10 06:05:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:05:04,589 INFO L475 AbstractCegarLoop]: Abstraction has 42462 states and 67257 transitions. [2019-09-10 06:05:04,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:05:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 42462 states and 67257 transitions. [2019-09-10 06:05:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:05:04,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:05:04,608 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:05:04,608 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:05:04,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:05:04,611 INFO L82 PathProgramCache]: Analyzing trace with hash -294350133, now seen corresponding path program 1 times [2019-09-10 06:05:04,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:05:04,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:04,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:05:04,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:04,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:05:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:05:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:05:04,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:05:04,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:05:04,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:05:04,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:05:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:05:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:05:04,818 INFO L87 Difference]: Start difference. First operand 42462 states and 67257 transitions. Second operand 4 states. [2019-09-10 06:05:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:05:05,081 INFO L93 Difference]: Finished difference Result 69547 states and 110373 transitions. [2019-09-10 06:05:05,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:05:05,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 06:05:05,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:05:05,161 INFO L225 Difference]: With dead ends: 69547 [2019-09-10 06:05:05,161 INFO L226 Difference]: Without dead ends: 69547 [2019-09-10 06:05:05,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:05:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69547 states. [2019-09-10 06:05:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69547 to 61175. [2019-09-10 06:05:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61175 states. [2019-09-10 06:05:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61175 states to 61175 states and 97106 transitions. [2019-09-10 06:05:05,864 INFO L78 Accepts]: Start accepts. Automaton has 61175 states and 97106 transitions. Word has length 97 [2019-09-10 06:05:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:05:05,865 INFO L475 AbstractCegarLoop]: Abstraction has 61175 states and 97106 transitions. [2019-09-10 06:05:05,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:05:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 61175 states and 97106 transitions. [2019-09-10 06:05:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:05:05,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:05:05,867 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:05:05,868 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:05:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:05:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash -266072244, now seen corresponding path program 1 times [2019-09-10 06:05:05,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:05:05,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:05,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:05:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:05,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:05:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:05:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:05:05,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:05:05,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:05:05,958 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 06:05:05,960 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [147], [169], [173], [190], [193], [195], [197], [200], [203], [206], [209], [216], [224], [226], [229], [230], [232], [241], [244], [255], [258], [268], [276], [280], [282], [285], [310], [318], [326], [332], [336], [340], [342], [345], [370], [378], [386], [402], [405], [430], [438], [446], [558], [559], [563], [564], [565] [2019-09-10 06:05:06,001 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:05:06,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:05:06,159 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:05:06,632 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:05:06,635 INFO L272 AbstractInterpreter]: Visited 86 different actions 276 times. Merged at 37 different actions 171 times. Widened at 3 different actions 5 times. Performed 1007 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1007 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 6 fixpoints after 4 different actions. Largest state had 162 variables. [2019-09-10 06:05:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:05:06,640 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:05:06,973 INFO L227 lantSequenceWeakener]: Weakened 75 states. On average, predicates are now at 84.28% of their original sizes. [2019-09-10 06:05:06,973 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:05:11,775 INFO L420 sIntCurrentIteration]: We unified 96 AI predicates to 96 [2019-09-10 06:05:11,776 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:05:11,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:05:11,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [5] total 63 [2019-09-10 06:05:11,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:05:11,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 06:05:11,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 06:05:11,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=3146, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:05:11,779 INFO L87 Difference]: Start difference. First operand 61175 states and 97106 transitions. Second operand 60 states. [2019-09-10 06:06:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:24,859 INFO L93 Difference]: Finished difference Result 339904 states and 525691 transitions. [2019-09-10 06:06:24,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-10 06:06:24,859 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 97 [2019-09-10 06:06:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:26,122 INFO L225 Difference]: With dead ends: 339904 [2019-09-10 06:06:26,122 INFO L226 Difference]: Without dead ends: 339904 [2019-09-10 06:06:26,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8146 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3030, Invalid=19922, Unknown=0, NotChecked=0, Total=22952 [2019-09-10 06:06:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339904 states. [2019-09-10 06:06:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339904 to 115755. [2019-09-10 06:06:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115755 states. [2019-09-10 06:06:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115755 states to 115755 states and 181360 transitions. [2019-09-10 06:06:29,466 INFO L78 Accepts]: Start accepts. Automaton has 115755 states and 181360 transitions. Word has length 97 [2019-09-10 06:06:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:29,466 INFO L475 AbstractCegarLoop]: Abstraction has 115755 states and 181360 transitions. [2019-09-10 06:06:29,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 06:06:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 115755 states and 181360 transitions. [2019-09-10 06:06:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:06:29,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:29,470 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:29,470 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:29,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:29,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1991425558, now seen corresponding path program 1 times [2019-09-10 06:06:29,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:29,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:29,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:29,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:29,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:06:29,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:29,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:06:29,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:29,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:06:29,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:06:29,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:06:29,577 INFO L87 Difference]: Start difference. First operand 115755 states and 181360 transitions. Second operand 5 states. [2019-09-10 06:06:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:30,122 INFO L93 Difference]: Finished difference Result 129779 states and 203252 transitions. [2019-09-10 06:06:30,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:06:30,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 06:06:30,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:32,769 INFO L225 Difference]: With dead ends: 129779 [2019-09-10 06:06:32,770 INFO L226 Difference]: Without dead ends: 129779 [2019-09-10 06:06:32,770 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:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129779 states. [2019-09-10 06:06:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129779 to 128841. [2019-09-10 06:06:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128841 states. [2019-09-10 06:06:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128841 states to 128841 states and 201909 transitions. [2019-09-10 06:06:34,341 INFO L78 Accepts]: Start accepts. Automaton has 128841 states and 201909 transitions. Word has length 97 [2019-09-10 06:06:34,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:34,341 INFO L475 AbstractCegarLoop]: Abstraction has 128841 states and 201909 transitions. [2019-09-10 06:06:34,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:06:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 128841 states and 201909 transitions. [2019-09-10 06:06:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:06:34,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:34,346 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:34,346 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:34,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:34,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2050293036, now seen corresponding path program 1 times [2019-09-10 06:06:34,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:34,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:34,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:34,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:34,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 06:06:34,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:34,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:34,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:34,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:34,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:34,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:34,388 INFO L87 Difference]: Start difference. First operand 128841 states and 201909 transitions. Second operand 3 states. [2019-09-10 06:06:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:35,198 INFO L93 Difference]: Finished difference Result 257667 states and 403794 transitions. [2019-09-10 06:06:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:35,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:06:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:35,559 INFO L225 Difference]: With dead ends: 257667 [2019-09-10 06:06:35,560 INFO L226 Difference]: Without dead ends: 257667 [2019-09-10 06:06:35,560 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:35,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257667 states. [2019-09-10 06:06:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257667 to 128843. [2019-09-10 06:06:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128843 states. [2019-09-10 06:06:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128843 states to 128843 states and 201911 transitions. [2019-09-10 06:06:42,723 INFO L78 Accepts]: Start accepts. Automaton has 128843 states and 201911 transitions. Word has length 98 [2019-09-10 06:06:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:42,723 INFO L475 AbstractCegarLoop]: Abstraction has 128843 states and 201911 transitions. [2019-09-10 06:06:42,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 128843 states and 201911 transitions. [2019-09-10 06:06:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:06:42,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:42,727 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:42,727 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:42,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1922212725, now seen corresponding path program 1 times [2019-09-10 06:06:42,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:42,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:42,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 06:06:42,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:42,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:42,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:42,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:42,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:42,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:42,765 INFO L87 Difference]: Start difference. First operand 128843 states and 201911 transitions. Second operand 3 states. [2019-09-10 06:06:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:43,303 INFO L93 Difference]: Finished difference Result 257670 states and 403798 transitions. [2019-09-10 06:06:43,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:43,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:06:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:43,642 INFO L225 Difference]: With dead ends: 257670 [2019-09-10 06:06:43,642 INFO L226 Difference]: Without dead ends: 257670 [2019-09-10 06:06:43,642 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:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257670 states. [2019-09-10 06:06:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257670 to 128846. [2019-09-10 06:06:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128846 states. [2019-09-10 06:06:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128846 states to 128846 states and 201915 transitions. [2019-09-10 06:06:46,172 INFO L78 Accepts]: Start accepts. Automaton has 128846 states and 201915 transitions. Word has length 98 [2019-09-10 06:06:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:46,172 INFO L475 AbstractCegarLoop]: Abstraction has 128846 states and 201915 transitions. [2019-09-10 06:06:46,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 128846 states and 201915 transitions. [2019-09-10 06:06:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:06:46,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:46,176 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:06:46,176 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:46,177 INFO L82 PathProgramCache]: Analyzing trace with hash -180848726, now seen corresponding path program 1 times [2019-09-10 06:06:46,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:46,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:46,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:46,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:46,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 06:06:46,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:46,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:46,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:46,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:46,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:46,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:46,216 INFO L87 Difference]: Start difference. First operand 128846 states and 201915 transitions. Second operand 3 states. [2019-09-10 06:06:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:47,295 INFO L93 Difference]: Finished difference Result 257656 states and 403772 transitions. [2019-09-10 06:06:47,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:47,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:06:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:47,583 INFO L225 Difference]: With dead ends: 257656 [2019-09-10 06:06:47,583 INFO L226 Difference]: Without dead ends: 257656 [2019-09-10 06:06:47,584 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:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257656 states. [2019-09-10 06:06:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257656 to 128848. [2019-09-10 06:06:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128848 states. [2019-09-10 06:06:49,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128848 states to 128848 states and 201917 transitions. [2019-09-10 06:06:49,996 INFO L78 Accepts]: Start accepts. Automaton has 128848 states and 201917 transitions. Word has length 98 [2019-09-10 06:06:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:49,996 INFO L475 AbstractCegarLoop]: Abstraction has 128848 states and 201917 transitions. [2019-09-10 06:06:49,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 128848 states and 201917 transitions. [2019-09-10 06:06:50,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:06:50,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:50,000 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] [2019-09-10 06:06:50,000 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:50,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:50,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1268584624, now seen corresponding path program 1 times [2019-09-10 06:06:50,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:50,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:50,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:50,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:06:50,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:50,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:50,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:50,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:50,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:50,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:50,078 INFO L87 Difference]: Start difference. First operand 128848 states and 201917 transitions. Second operand 3 states. [2019-09-10 06:06:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:50,591 INFO L93 Difference]: Finished difference Result 245642 states and 382146 transitions. [2019-09-10 06:06:50,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:50,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:06:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:50,888 INFO L225 Difference]: With dead ends: 245642 [2019-09-10 06:06:50,889 INFO L226 Difference]: Without dead ends: 245642 [2019-09-10 06:06:50,889 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:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245642 states. [2019-09-10 06:06:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245642 to 245640. [2019-09-10 06:06:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245640 states. [2019-09-10 06:06:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245640 states to 245640 states and 382145 transitions. [2019-09-10 06:06:54,853 INFO L78 Accepts]: Start accepts. Automaton has 245640 states and 382145 transitions. Word has length 98 [2019-09-10 06:06:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:06:54,854 INFO L475 AbstractCegarLoop]: Abstraction has 245640 states and 382145 transitions. [2019-09-10 06:06:54,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:06:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 245640 states and 382145 transitions. [2019-09-10 06:06:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:06:54,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:06:54,859 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] [2019-09-10 06:06:54,859 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:06:54,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:06:54,859 INFO L82 PathProgramCache]: Analyzing trace with hash -496874534, now seen corresponding path program 1 times [2019-09-10 06:06:54,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:06:54,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:54,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:06:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:06:54,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:06:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:06:54,920 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:06:54,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:06:54,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:06:54,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:06:54,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:06:54,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:06:54,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:06:54,922 INFO L87 Difference]: Start difference. First operand 245640 states and 382145 transitions. Second operand 3 states. [2019-09-10 06:06:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:06:56,142 INFO L93 Difference]: Finished difference Result 469853 states and 724872 transitions. [2019-09-10 06:06:56,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:06:56,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:06:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:06:56,785 INFO L225 Difference]: With dead ends: 469853 [2019-09-10 06:06:56,785 INFO L226 Difference]: Without dead ends: 469853 [2019-09-10 06:06:56,785 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:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469853 states. [2019-09-10 06:07:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469853 to 469502. [2019-09-10 06:07:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469502 states. [2019-09-10 06:07:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469502 states to 469502 states and 724522 transitions. [2019-09-10 06:07:11,561 INFO L78 Accepts]: Start accepts. Automaton has 469502 states and 724522 transitions. Word has length 98 [2019-09-10 06:07:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:11,561 INFO L475 AbstractCegarLoop]: Abstraction has 469502 states and 724522 transitions. [2019-09-10 06:07:11,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 469502 states and 724522 transitions. [2019-09-10 06:07:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:07:11,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:11,566 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:07:11,566 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:11,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:11,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1914840343, now seen corresponding path program 1 times [2019-09-10 06:07:11,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:11,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:11,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:11,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:11,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:07:11,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:11,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:11,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:11,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:11,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:11,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:11,627 INFO L87 Difference]: Start difference. First operand 469502 states and 724522 transitions. Second operand 3 states. [2019-09-10 06:07:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:20,452 INFO L93 Difference]: Finished difference Result 631556 states and 979472 transitions. [2019-09-10 06:07:20,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:20,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:07:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:21,331 INFO L225 Difference]: With dead ends: 631556 [2019-09-10 06:07:21,332 INFO L226 Difference]: Without dead ends: 631556 [2019-09-10 06:07:21,332 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,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631556 states. [2019-09-10 06:07:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631556 to 630142. [2019-09-10 06:07:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630142 states. [2019-09-10 06:07:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630142 states to 630142 states and 978059 transitions. [2019-09-10 06:07:29,534 INFO L78 Accepts]: Start accepts. Automaton has 630142 states and 978059 transitions. Word has length 98 [2019-09-10 06:07:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:29,534 INFO L475 AbstractCegarLoop]: Abstraction has 630142 states and 978059 transitions. [2019-09-10 06:07:29,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 630142 states and 978059 transitions. [2019-09-10 06:07:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:07:29,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:29,539 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] [2019-09-10 06:07:29,539 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:29,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:29,539 INFO L82 PathProgramCache]: Analyzing trace with hash 443111312, now seen corresponding path program 1 times [2019-09-10 06:07:29,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:29,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:29,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:29,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:29,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:07:37,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:37,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:07:37,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:37,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:07:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:07:37,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:07:37,501 INFO L87 Difference]: Start difference. First operand 630142 states and 978059 transitions. Second operand 4 states. [2019-09-10 06:07:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:41,267 INFO L93 Difference]: Finished difference Result 1113393 states and 1732616 transitions. [2019-09-10 06:07:41,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:07:41,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-10 06:07:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:43,268 INFO L225 Difference]: With dead ends: 1113393 [2019-09-10 06:07:43,268 INFO L226 Difference]: Without dead ends: 1113393 [2019-09-10 06:07:43,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:07:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113393 states. [2019-09-10 06:08:16,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113393 to 964019. [2019-09-10 06:08:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964019 states. [2019-09-10 06:08:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964019 states to 964019 states and 1498170 transitions. [2019-09-10 06:08:18,333 INFO L78 Accepts]: Start accepts. Automaton has 964019 states and 1498170 transitions. Word has length 98 [2019-09-10 06:08:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:18,333 INFO L475 AbstractCegarLoop]: Abstraction has 964019 states and 1498170 transitions. [2019-09-10 06:08:18,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:08:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 964019 states and 1498170 transitions. [2019-09-10 06:08:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:08:18,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:18,338 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:18,339 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:18,339 INFO L82 PathProgramCache]: Analyzing trace with hash 587107172, now seen corresponding path program 1 times [2019-09-10 06:08:18,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:18,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:18,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:18,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:18,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:20,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:20,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:20,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:20,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:20,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:20,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:20,936 INFO L87 Difference]: Start difference. First operand 964019 states and 1498170 transitions. Second operand 3 states. [2019-09-10 06:08:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:37,700 INFO L93 Difference]: Finished difference Result 1813736 states and 2797436 transitions. [2019-09-10 06:08:37,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:37,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 06:08:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:43,307 INFO L225 Difference]: With dead ends: 1813736 [2019-09-10 06:08:43,308 INFO L226 Difference]: Without dead ends: 1813736 [2019-09-10 06:08:43,308 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:44,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813736 states. [2019-09-10 06:09:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813736 to 1813734. [2019-09-10 06:09:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1813734 states.