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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:43:46,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:43:46,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:43:46,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:43:46,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:43:46,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:43:46,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:43:46,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:43:46,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:43:46,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:43:46,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:43:46,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:43:46,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:43:46,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:43:46,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:43:46,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:43:46,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:43:46,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:43:46,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:43:46,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:43:46,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:43:46,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:43:46,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:43:46,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:43:46,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:43:46,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:43:46,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:43:46,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:43:46,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:43:46,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:43:46,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:43:46,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:43:46,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:43:46,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:43:46,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:43:46,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:43:46,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:43:46,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:43:46,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:43:46,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:43:46,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:43:46,494 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 08:43:46,509 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:43:46,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:43:46,510 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:43:46,510 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:43:46,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:43:46,511 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:43:46,512 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:43:46,512 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:43:46,512 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:43:46,512 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:43:46,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:43:46,513 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:43:46,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:43:46,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:43:46,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:43:46,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:43:46,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:43:46,514 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:43:46,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:43:46,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:43:46,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:43:46,515 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:43:46,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:43:46,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:43:46,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:43:46,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:43:46,516 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:43:46,516 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:43:46,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:43:46,517 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:43:46,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:43:46,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:43:46,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:43:46,566 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:43:46,566 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:43:46,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:43:46,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9761eec3a/536920b78a69476ba5c54c3a572519f2/FLAG9f197c11c [2019-09-10 08:43:47,152 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:43:47,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:43:47,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9761eec3a/536920b78a69476ba5c54c3a572519f2/FLAG9f197c11c [2019-09-10 08:43:47,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9761eec3a/536920b78a69476ba5c54c3a572519f2 [2019-09-10 08:43:47,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:43:47,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:43:47,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:43:47,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:43:47,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:43:47,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:43:47" (1/1) ... [2019-09-10 08:43:47,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f59ac88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:47, skipping insertion in model container [2019-09-10 08:43:47,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:43:47" (1/1) ... [2019-09-10 08:43:47,502 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:43:47,573 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:43:47,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:43:48,018 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:43:48,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:43:48,139 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:43:48,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:48 WrapperNode [2019-09-10 08:43:48,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:43:48,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:43:48,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:43:48,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:43:48,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:48" (1/1) ... [2019-09-10 08:43:48,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:48" (1/1) ... [2019-09-10 08:43:48,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:48" (1/1) ... [2019-09-10 08:43:48,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:48" (1/1) ... [2019-09-10 08:43:48,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:48" (1/1) ... [2019-09-10 08:43:48,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:48" (1/1) ... [2019-09-10 08:43:48,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:48" (1/1) ... [2019-09-10 08:43:48,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:43:48,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:43:48,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:43:48,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:43:48,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:48" (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 08:43:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:43:48,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:43:48,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:43:48,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:43:48,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:43:48,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:43:48,266 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:43:48,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:43:48,266 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:43:48,267 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:43:48,267 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:43:48,267 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:43:48,267 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:43:48,267 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:43:48,267 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:43:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:43:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:43:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:43:49,081 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:43:49,081 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:43:49,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:43:49 BoogieIcfgContainer [2019-09-10 08:43:49,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:43:49,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:43:49,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:43:49,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:43:49,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:43:47" (1/3) ... [2019-09-10 08:43:49,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2352ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:43:49, skipping insertion in model container [2019-09-10 08:43:49,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:48" (2/3) ... [2019-09-10 08:43:49,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2352ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:43:49, skipping insertion in model container [2019-09-10 08:43:49,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:43:49" (3/3) ... [2019-09-10 08:43:49,097 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:43:49,108 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:43:49,131 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:43:49,151 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:43:49,188 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:43:49,188 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:43:49,189 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:43:49,189 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:43:49,190 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:43:49,190 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:43:49,190 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:43:49,190 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:43:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-10 08:43:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 08:43:49,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:49,257 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:49,260 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:49,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash -902016562, now seen corresponding path program 1 times [2019-09-10 08:43:49,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:49,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:49,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:49,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:49,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:49,775 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 08:43:49,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:49,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:49,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:49,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:49,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:49,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:49,809 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-09-10 08:43:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:49,966 INFO L93 Difference]: Finished difference Result 237 states and 393 transitions. [2019-09-10 08:43:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:49,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 08:43:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:49,999 INFO L225 Difference]: With dead ends: 237 [2019-09-10 08:43:50,000 INFO L226 Difference]: Without dead ends: 229 [2019-09-10 08:43:50,003 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 08:43:50,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-10 08:43:50,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-09-10 08:43:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 08:43:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 353 transitions. [2019-09-10 08:43:50,099 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 353 transitions. Word has length 66 [2019-09-10 08:43:50,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:50,100 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 353 transitions. [2019-09-10 08:43:50,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 353 transitions. [2019-09-10 08:43:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:43:50,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:50,104 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 08:43:50,104 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:50,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash 730168783, now seen corresponding path program 1 times [2019-09-10 08:43:50,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:50,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:50,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:50,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:50,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:50,320 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 08:43:50,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:50,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:50,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:50,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:50,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:50,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:50,323 INFO L87 Difference]: Start difference. First operand 227 states and 353 transitions. Second operand 3 states. [2019-09-10 08:43:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:50,361 INFO L93 Difference]: Finished difference Result 377 states and 597 transitions. [2019-09-10 08:43:50,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:50,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 08:43:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:50,365 INFO L225 Difference]: With dead ends: 377 [2019-09-10 08:43:50,365 INFO L226 Difference]: Without dead ends: 377 [2019-09-10 08:43:50,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 08:43:50,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-10 08:43:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2019-09-10 08:43:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-10 08:43:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 596 transitions. [2019-09-10 08:43:50,390 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 596 transitions. Word has length 68 [2019-09-10 08:43:50,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:50,390 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 596 transitions. [2019-09-10 08:43:50,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 596 transitions. [2019-09-10 08:43:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 08:43:50,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:50,394 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 08:43:50,395 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:50,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1550224880, now seen corresponding path program 1 times [2019-09-10 08:43:50,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:50,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:50,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:50,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:50,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:50,496 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 08:43:50,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:50,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:50,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:50,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:50,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:50,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:50,498 INFO L87 Difference]: Start difference. First operand 375 states and 596 transitions. Second operand 3 states. [2019-09-10 08:43:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:50,529 INFO L93 Difference]: Finished difference Result 657 states and 1053 transitions. [2019-09-10 08:43:50,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:50,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 08:43:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:50,534 INFO L225 Difference]: With dead ends: 657 [2019-09-10 08:43:50,534 INFO L226 Difference]: Without dead ends: 657 [2019-09-10 08:43:50,535 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 08:43:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-10 08:43:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2019-09-10 08:43:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-10 08:43:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1052 transitions. [2019-09-10 08:43:50,562 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1052 transitions. Word has length 70 [2019-09-10 08:43:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:50,562 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 1052 transitions. [2019-09-10 08:43:50,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1052 transitions. [2019-09-10 08:43:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 08:43:50,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:50,566 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 08:43:50,566 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:50,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:50,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2032710127, now seen corresponding path program 1 times [2019-09-10 08:43:50,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:50,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:50,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:50,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:50,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:50,775 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 08:43:50,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:50,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:43:50,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:50,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:43:50,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:43:50,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:50,778 INFO L87 Difference]: Start difference. First operand 655 states and 1052 transitions. Second operand 5 states. [2019-09-10 08:43:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:50,909 INFO L93 Difference]: Finished difference Result 1593 states and 2597 transitions. [2019-09-10 08:43:50,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:43:50,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 08:43:50,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:50,919 INFO L225 Difference]: With dead ends: 1593 [2019-09-10 08:43:50,919 INFO L226 Difference]: Without dead ends: 1593 [2019-09-10 08:43:50,920 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 08:43:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2019-09-10 08:43:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1421. [2019-09-10 08:43:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-09-10 08:43:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2313 transitions. [2019-09-10 08:43:50,984 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2313 transitions. Word has length 72 [2019-09-10 08:43:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:50,984 INFO L475 AbstractCegarLoop]: Abstraction has 1421 states and 2313 transitions. [2019-09-10 08:43:50,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:43:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2313 transitions. [2019-09-10 08:43:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 08:43:50,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:50,988 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] [2019-09-10 08:43:50,988 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:50,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:50,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1348885045, now seen corresponding path program 1 times [2019-09-10 08:43:50,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:50,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:50,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:50,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:51,126 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 08:43:51,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:51,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:43:51,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:51,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:43:51,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:43:51,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:43:51,130 INFO L87 Difference]: Start difference. First operand 1421 states and 2313 transitions. Second operand 6 states. [2019-09-10 08:43:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:51,345 INFO L93 Difference]: Finished difference Result 4239 states and 6897 transitions. [2019-09-10 08:43:51,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:43:51,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-09-10 08:43:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:51,372 INFO L225 Difference]: With dead ends: 4239 [2019-09-10 08:43:51,373 INFO L226 Difference]: Without dead ends: 4239 [2019-09-10 08:43:51,373 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 08:43:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4239 states. [2019-09-10 08:43:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4239 to 4136. [2019-09-10 08:43:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4136 states. [2019-09-10 08:43:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 6750 transitions. [2019-09-10 08:43:51,501 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 6750 transitions. Word has length 73 [2019-09-10 08:43:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:51,502 INFO L475 AbstractCegarLoop]: Abstraction has 4136 states and 6750 transitions. [2019-09-10 08:43:51,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:43:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 6750 transitions. [2019-09-10 08:43:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:43:51,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:51,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:51,507 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:51,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:51,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1795572021, now seen corresponding path program 1 times [2019-09-10 08:43:51,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:51,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:51,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:51,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:51,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:51,591 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 08:43:51,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:51,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:51,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:51,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:51,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:51,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:51,593 INFO L87 Difference]: Start difference. First operand 4136 states and 6750 transitions. Second operand 3 states. [2019-09-10 08:43:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:51,655 INFO L93 Difference]: Finished difference Result 6131 states and 9982 transitions. [2019-09-10 08:43:51,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:51,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 08:43:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:51,724 INFO L225 Difference]: With dead ends: 6131 [2019-09-10 08:43:51,724 INFO L226 Difference]: Without dead ends: 6131 [2019-09-10 08:43:51,725 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 08:43:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2019-09-10 08:43:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 6129. [2019-09-10 08:43:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6129 states. [2019-09-10 08:43:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 9981 transitions. [2019-09-10 08:43:51,968 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 9981 transitions. Word has length 74 [2019-09-10 08:43:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:51,968 INFO L475 AbstractCegarLoop]: Abstraction has 6129 states and 9981 transitions. [2019-09-10 08:43:51,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 9981 transitions. [2019-09-10 08:43:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:43:51,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:51,981 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:51,982 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:51,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1561348457, now seen corresponding path program 1 times [2019-09-10 08:43:51,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:51,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:51,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:51,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:51,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:52,122 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 08:43:52,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:52,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:52,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:52,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:52,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:52,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:52,126 INFO L87 Difference]: Start difference. First operand 6129 states and 9981 transitions. Second operand 3 states. [2019-09-10 08:43:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:52,246 INFO L93 Difference]: Finished difference Result 8439 states and 13684 transitions. [2019-09-10 08:43:52,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:52,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 08:43:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:52,297 INFO L225 Difference]: With dead ends: 8439 [2019-09-10 08:43:52,298 INFO L226 Difference]: Without dead ends: 8439 [2019-09-10 08:43:52,299 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 08:43:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8439 states. [2019-09-10 08:43:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8439 to 8437. [2019-09-10 08:43:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8437 states. [2019-09-10 08:43:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8437 states to 8437 states and 13683 transitions. [2019-09-10 08:43:52,620 INFO L78 Accepts]: Start accepts. Automaton has 8437 states and 13683 transitions. Word has length 74 [2019-09-10 08:43:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:52,621 INFO L475 AbstractCegarLoop]: Abstraction has 8437 states and 13683 transitions. [2019-09-10 08:43:52,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 8437 states and 13683 transitions. [2019-09-10 08:43:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:43:52,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:52,624 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:52,625 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:52,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1191289000, now seen corresponding path program 1 times [2019-09-10 08:43:52,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:52,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:52,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:52,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:52,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:52,731 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 08:43:52,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:52,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:43:52,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:52,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:52,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:52,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:52,735 INFO L87 Difference]: Start difference. First operand 8437 states and 13683 transitions. Second operand 4 states. [2019-09-10 08:43:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:52,895 INFO L93 Difference]: Finished difference Result 13079 states and 21168 transitions. [2019-09-10 08:43:52,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:43:52,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-10 08:43:52,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:52,961 INFO L225 Difference]: With dead ends: 13079 [2019-09-10 08:43:52,961 INFO L226 Difference]: Without dead ends: 13079 [2019-09-10 08:43:52,962 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 08:43:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13079 states. [2019-09-10 08:43:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13079 to 13035. [2019-09-10 08:43:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13035 states. [2019-09-10 08:43:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13035 states to 13035 states and 21086 transitions. [2019-09-10 08:43:53,418 INFO L78 Accepts]: Start accepts. Automaton has 13035 states and 21086 transitions. Word has length 74 [2019-09-10 08:43:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:53,418 INFO L475 AbstractCegarLoop]: Abstraction has 13035 states and 21086 transitions. [2019-09-10 08:43:53,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:43:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 13035 states and 21086 transitions. [2019-09-10 08:43:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:43:53,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:53,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:53,420 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:53,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1031073657, now seen corresponding path program 1 times [2019-09-10 08:43:53,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:53,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:53,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:53,498 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 08:43:53,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:53,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:53,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:53,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:53,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:53,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:53,501 INFO L87 Difference]: Start difference. First operand 13035 states and 21086 transitions. Second operand 3 states. [2019-09-10 08:43:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:53,586 INFO L93 Difference]: Finished difference Result 17770 states and 28545 transitions. [2019-09-10 08:43:53,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:53,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 08:43:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:53,643 INFO L225 Difference]: With dead ends: 17770 [2019-09-10 08:43:53,643 INFO L226 Difference]: Without dead ends: 17770 [2019-09-10 08:43:53,644 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 08:43:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2019-09-10 08:43:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17768. [2019-09-10 08:43:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17768 states. [2019-09-10 08:43:54,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17768 states to 17768 states and 28544 transitions. [2019-09-10 08:43:54,619 INFO L78 Accepts]: Start accepts. Automaton has 17768 states and 28544 transitions. Word has length 74 [2019-09-10 08:43:54,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:54,619 INFO L475 AbstractCegarLoop]: Abstraction has 17768 states and 28544 transitions. [2019-09-10 08:43:54,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 17768 states and 28544 transitions. [2019-09-10 08:43:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 08:43:54,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:54,620 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 08:43:54,621 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:54,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1672252252, now seen corresponding path program 1 times [2019-09-10 08:43:54,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:54,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:54,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:54,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:54,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:54,718 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 08:43:54,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:54,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:43:54,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:54,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:54,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:54,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:54,722 INFO L87 Difference]: Start difference. First operand 17768 states and 28544 transitions. Second operand 4 states. [2019-09-10 08:43:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:54,951 INFO L93 Difference]: Finished difference Result 39448 states and 63337 transitions. [2019-09-10 08:43:54,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:43:54,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-10 08:43:54,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:55,066 INFO L225 Difference]: With dead ends: 39448 [2019-09-10 08:43:55,067 INFO L226 Difference]: Without dead ends: 39448 [2019-09-10 08:43:55,068 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 08:43:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39448 states. [2019-09-10 08:43:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39448 to 26203. [2019-09-10 08:43:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26203 states. [2019-09-10 08:43:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26203 states to 26203 states and 41961 transitions. [2019-09-10 08:43:55,728 INFO L78 Accepts]: Start accepts. Automaton has 26203 states and 41961 transitions. Word has length 75 [2019-09-10 08:43:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:55,729 INFO L475 AbstractCegarLoop]: Abstraction has 26203 states and 41961 transitions. [2019-09-10 08:43:55,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:43:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 26203 states and 41961 transitions. [2019-09-10 08:43:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:43:55,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:55,731 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, 1] [2019-09-10 08:43:55,731 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:55,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:55,732 INFO L82 PathProgramCache]: Analyzing trace with hash -772989972, now seen corresponding path program 1 times [2019-09-10 08:43:55,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:55,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:55,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:55,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:55,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:55,919 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 08:43:55,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:55,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:43:55,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:55,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:43:55,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:43:55,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:55,921 INFO L87 Difference]: Start difference. First operand 26203 states and 41961 transitions. Second operand 5 states. [2019-09-10 08:43:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:56,100 INFO L93 Difference]: Finished difference Result 28175 states and 45033 transitions. [2019-09-10 08:43:56,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:43:56,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:43:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:56,177 INFO L225 Difference]: With dead ends: 28175 [2019-09-10 08:43:56,177 INFO L226 Difference]: Without dead ends: 28175 [2019-09-10 08:43:56,178 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 08:43:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28175 states. [2019-09-10 08:43:56,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28175 to 26203. [2019-09-10 08:43:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26203 states. [2019-09-10 08:43:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26203 states to 26203 states and 41826 transitions. [2019-09-10 08:43:56,794 INFO L78 Accepts]: Start accepts. Automaton has 26203 states and 41826 transitions. Word has length 77 [2019-09-10 08:43:56,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:56,795 INFO L475 AbstractCegarLoop]: Abstraction has 26203 states and 41826 transitions. [2019-09-10 08:43:56,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:43:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 26203 states and 41826 transitions. [2019-09-10 08:43:56,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:43:56,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:56,796 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, 1, 1, 1, 1] [2019-09-10 08:43:56,796 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:56,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:56,797 INFO L82 PathProgramCache]: Analyzing trace with hash -579116247, now seen corresponding path program 1 times [2019-09-10 08:43:56,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:56,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:56,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:56,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:56,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:57,047 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 08:43:57,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:57,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:43:57,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:57,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:43:57,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:43:57,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:57,050 INFO L87 Difference]: Start difference. First operand 26203 states and 41826 transitions. Second operand 5 states. [2019-09-10 08:43:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:57,359 INFO L93 Difference]: Finished difference Result 58799 states and 93903 transitions. [2019-09-10 08:43:57,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:43:57,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-10 08:43:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:57,802 INFO L225 Difference]: With dead ends: 58799 [2019-09-10 08:43:57,803 INFO L226 Difference]: Without dead ends: 58799 [2019-09-10 08:43:57,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58799 states. [2019-09-10 08:43:59,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58799 to 36841. [2019-09-10 08:43:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36841 states. [2019-09-10 08:43:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36841 states to 36841 states and 58607 transitions. [2019-09-10 08:43:59,599 INFO L78 Accepts]: Start accepts. Automaton has 36841 states and 58607 transitions. Word has length 80 [2019-09-10 08:43:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:59,600 INFO L475 AbstractCegarLoop]: Abstraction has 36841 states and 58607 transitions. [2019-09-10 08:43:59,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:43:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 36841 states and 58607 transitions. [2019-09-10 08:43:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:43:59,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:59,603 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, 1, 1, 1, 1, 1] [2019-09-10 08:43:59,604 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:59,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:59,604 INFO L82 PathProgramCache]: Analyzing trace with hash -774643767, now seen corresponding path program 1 times [2019-09-10 08:43:59,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:59,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:59,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:59,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:59,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:59,771 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 08:43:59,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:59,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:43:59,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:59,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:43:59,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:43:59,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:59,774 INFO L87 Difference]: Start difference. First operand 36841 states and 58607 transitions. Second operand 5 states. [2019-09-10 08:44:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:00,031 INFO L93 Difference]: Finished difference Result 65270 states and 102837 transitions. [2019-09-10 08:44:00,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:44:00,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 08:44:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:00,191 INFO L225 Difference]: With dead ends: 65270 [2019-09-10 08:44:00,192 INFO L226 Difference]: Without dead ends: 65270 [2019-09-10 08:44:00,192 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 08:44:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65270 states. [2019-09-10 08:44:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65270 to 37697. [2019-09-10 08:44:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37697 states. [2019-09-10 08:44:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37697 states to 37697 states and 59454 transitions. [2019-09-10 08:44:01,008 INFO L78 Accepts]: Start accepts. Automaton has 37697 states and 59454 transitions. Word has length 81 [2019-09-10 08:44:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:01,009 INFO L475 AbstractCegarLoop]: Abstraction has 37697 states and 59454 transitions. [2019-09-10 08:44:01,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:44:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 37697 states and 59454 transitions. [2019-09-10 08:44:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:44:01,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:01,012 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2019-09-10 08:44:01,012 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:01,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1389875202, now seen corresponding path program 1 times [2019-09-10 08:44:01,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:01,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:01,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:01,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:01,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:44:01,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:01,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:44:01,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:01,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:44:01,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:44:01,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:01,130 INFO L87 Difference]: Start difference. First operand 37697 states and 59454 transitions. Second operand 5 states. [2019-09-10 08:44:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:01,337 INFO L93 Difference]: Finished difference Result 43482 states and 68439 transitions. [2019-09-10 08:44:01,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:44:01,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 08:44:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:01,393 INFO L225 Difference]: With dead ends: 43482 [2019-09-10 08:44:01,394 INFO L226 Difference]: Without dead ends: 43482 [2019-09-10 08:44:01,394 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 08:44:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43482 states. [2019-09-10 08:44:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43482 to 42943. [2019-09-10 08:44:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42943 states. [2019-09-10 08:44:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42943 states to 42943 states and 67653 transitions. [2019-09-10 08:44:02,116 INFO L78 Accepts]: Start accepts. Automaton has 42943 states and 67653 transitions. Word has length 105 [2019-09-10 08:44:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:02,117 INFO L475 AbstractCegarLoop]: Abstraction has 42943 states and 67653 transitions. [2019-09-10 08:44:02,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:44:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 42943 states and 67653 transitions. [2019-09-10 08:44:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:44:02,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:02,120 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2019-09-10 08:44:02,120 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash 451828384, now seen corresponding path program 1 times [2019-09-10 08:44:02,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:02,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:02,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:02,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:02,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:44:02,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:02,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:44:02,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:02,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:44:02,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:44:02,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:02,239 INFO L87 Difference]: Start difference. First operand 42943 states and 67653 transitions. Second operand 5 states. [2019-09-10 08:44:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:02,481 INFO L93 Difference]: Finished difference Result 47113 states and 74288 transitions. [2019-09-10 08:44:02,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:44:02,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 08:44:02,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:02,556 INFO L225 Difference]: With dead ends: 47113 [2019-09-10 08:44:02,556 INFO L226 Difference]: Without dead ends: 47113 [2019-09-10 08:44:02,559 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 08:44:02,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47113 states. [2019-09-10 08:44:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47113 to 45863. [2019-09-10 08:44:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45863 states. [2019-09-10 08:44:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45863 states to 45863 states and 72269 transitions. [2019-09-10 08:44:03,355 INFO L78 Accepts]: Start accepts. Automaton has 45863 states and 72269 transitions. Word has length 105 [2019-09-10 08:44:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:03,355 INFO L475 AbstractCegarLoop]: Abstraction has 45863 states and 72269 transitions. [2019-09-10 08:44:03,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:44:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 45863 states and 72269 transitions. [2019-09-10 08:44:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:44:03,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:03,359 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2019-09-10 08:44:03,359 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2140593730, now seen corresponding path program 1 times [2019-09-10 08:44:03,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:03,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:03,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:03,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:03,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:03,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:44:03,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:44:03,754 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 08:44:03,756 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], [117], [120], [123], [127], [155], [183], [186], [201], [204], [207], [209], [211], [214], [217], [220], [223], [230], [238], [240], [243], [244], [246], [255], [258], [269], [272], [282], [290], [294], [296], [299], [330], [340], [350], [366], [369], [400], [410], [420], [436], [439], [470], [480], [490], [605], [606], [610], [611], [612] [2019-09-10 08:44:03,815 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:44:03,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:44:04,021 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:44:04,352 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:44:04,355 INFO L272 AbstractInterpreter]: Visited 87 different actions 278 times. Merged at 35 different actions 176 times. Widened at 16 different actions 17 times. Performed 979 root evaluator evaluations with a maximum evaluation depth of 5. Performed 979 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 174 variables. [2019-09-10 08:44:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:04,361 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:44:04,698 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 85.06% of their original sizes. [2019-09-10 08:44:04,698 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:44:10,549 INFO L420 sIntCurrentIteration]: We unified 104 AI predicates to 104 [2019-09-10 08:44:10,549 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:44:10,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:44:10,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [5] total 66 [2019-09-10 08:44:10,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:10,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 08:44:10,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 08:44:10,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=3408, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 08:44:10,553 INFO L87 Difference]: Start difference. First operand 45863 states and 72269 transitions. Second operand 63 states. [2019-09-10 08:45:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:22,575 INFO L93 Difference]: Finished difference Result 222156 states and 344073 transitions. [2019-09-10 08:45:22,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-10 08:45:22,575 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 105 [2019-09-10 08:45:22,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:23,325 INFO L225 Difference]: With dead ends: 222156 [2019-09-10 08:45:23,326 INFO L226 Difference]: Without dead ends: 222156 [2019-09-10 08:45:23,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10177 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=3607, Invalid=24115, Unknown=0, NotChecked=0, Total=27722 [2019-09-10 08:45:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222156 states. [2019-09-10 08:45:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222156 to 74871. [2019-09-10 08:45:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74871 states. [2019-09-10 08:45:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74871 states to 74871 states and 117101 transitions. [2019-09-10 08:45:26,045 INFO L78 Accepts]: Start accepts. Automaton has 74871 states and 117101 transitions. Word has length 105 [2019-09-10 08:45:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:26,045 INFO L475 AbstractCegarLoop]: Abstraction has 74871 states and 117101 transitions. [2019-09-10 08:45:26,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 08:45:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 74871 states and 117101 transitions. [2019-09-10 08:45:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:45:26,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:26,052 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2019-09-10 08:45:26,052 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:26,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:26,053 INFO L82 PathProgramCache]: Analyzing trace with hash -383639073, now seen corresponding path program 1 times [2019-09-10 08:45:26,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:26,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:26,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:26,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:26,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:45:26,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:26,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:26,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:26,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:26,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:26,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:26,101 INFO L87 Difference]: Start difference. First operand 74871 states and 117101 transitions. Second operand 3 states. [2019-09-10 08:45:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:26,597 INFO L93 Difference]: Finished difference Result 149728 states and 234180 transitions. [2019-09-10 08:45:26,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:26,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:45:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:26,868 INFO L225 Difference]: With dead ends: 149728 [2019-09-10 08:45:26,869 INFO L226 Difference]: Without dead ends: 149728 [2019-09-10 08:45:26,870 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 08:45:27,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149728 states. [2019-09-10 08:45:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149728 to 74874. [2019-09-10 08:45:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74874 states. [2019-09-10 08:45:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74874 states to 74874 states and 117105 transitions. [2019-09-10 08:45:30,712 INFO L78 Accepts]: Start accepts. Automaton has 74874 states and 117105 transitions. Word has length 106 [2019-09-10 08:45:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:30,712 INFO L475 AbstractCegarLoop]: Abstraction has 74874 states and 117105 transitions. [2019-09-10 08:45:30,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 74874 states and 117105 transitions. [2019-09-10 08:45:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:45:30,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:30,717 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2019-09-10 08:45:30,718 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:30,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:30,718 INFO L82 PathProgramCache]: Analyzing trace with hash -900487682, now seen corresponding path program 1 times [2019-09-10 08:45:30,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:30,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:30,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:30,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:45:30,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:30,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:30,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:30,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:30,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:30,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:30,768 INFO L87 Difference]: Start difference. First operand 74874 states and 117105 transitions. Second operand 3 states. [2019-09-10 08:45:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:31,152 INFO L93 Difference]: Finished difference Result 149714 states and 234154 transitions. [2019-09-10 08:45:31,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:31,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:45:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:31,422 INFO L225 Difference]: With dead ends: 149714 [2019-09-10 08:45:31,422 INFO L226 Difference]: Without dead ends: 149714 [2019-09-10 08:45:31,423 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 08:45:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149714 states. [2019-09-10 08:45:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149714 to 74876. [2019-09-10 08:45:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74876 states. [2019-09-10 08:45:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74876 states to 74876 states and 117107 transitions. [2019-09-10 08:45:33,358 INFO L78 Accepts]: Start accepts. Automaton has 74876 states and 117107 transitions. Word has length 106 [2019-09-10 08:45:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:33,358 INFO L475 AbstractCegarLoop]: Abstraction has 74876 states and 117107 transitions. [2019-09-10 08:45:33,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 74876 states and 117107 transitions. [2019-09-10 08:45:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:45:33,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:33,364 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1] [2019-09-10 08:45:33,364 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:33,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:33,364 INFO L82 PathProgramCache]: Analyzing trace with hash 134984115, now seen corresponding path program 1 times [2019-09-10 08:45:33,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:33,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:33,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:33,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:33,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:45:33,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:33,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:33,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:33,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:33,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:33,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:33,431 INFO L87 Difference]: Start difference. First operand 74876 states and 117107 transitions. Second operand 3 states. [2019-09-10 08:45:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:33,832 INFO L93 Difference]: Finished difference Result 100583 states and 157724 transitions. [2019-09-10 08:45:33,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:33,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:45:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:34,047 INFO L225 Difference]: With dead ends: 100583 [2019-09-10 08:45:34,047 INFO L226 Difference]: Without dead ends: 100583 [2019-09-10 08:45:34,048 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 08:45:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100583 states. [2019-09-10 08:45:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100583 to 100400. [2019-09-10 08:45:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100400 states. [2019-09-10 08:45:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100400 states to 100400 states and 157542 transitions. [2019-09-10 08:45:36,087 INFO L78 Accepts]: Start accepts. Automaton has 100400 states and 157542 transitions. Word has length 106 [2019-09-10 08:45:36,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:36,087 INFO L475 AbstractCegarLoop]: Abstraction has 100400 states and 157542 transitions. [2019-09-10 08:45:36,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 100400 states and 157542 transitions. [2019-09-10 08:45:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:45:36,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:36,093 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2019-09-10 08:45:36,093 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:36,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:36,094 INFO L82 PathProgramCache]: Analyzing trace with hash 62486747, now seen corresponding path program 1 times [2019-09-10 08:45:36,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:36,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:36,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:36,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:36,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:45:36,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:36,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:36,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:36,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:36,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:36,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:36,145 INFO L87 Difference]: Start difference. First operand 100400 states and 157542 transitions. Second operand 3 states. [2019-09-10 08:45:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:36,761 INFO L93 Difference]: Finished difference Result 200752 states and 315004 transitions. [2019-09-10 08:45:36,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:36,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:45:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:37,132 INFO L225 Difference]: With dead ends: 200752 [2019-09-10 08:45:37,132 INFO L226 Difference]: Without dead ends: 200752 [2019-09-10 08:45:37,133 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 08:45:37,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200752 states. [2019-09-10 08:45:41,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200752 to 100406. [2019-09-10 08:45:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100406 states. [2019-09-10 08:45:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100406 states to 100406 states and 157550 transitions. [2019-09-10 08:45:42,072 INFO L78 Accepts]: Start accepts. Automaton has 100406 states and 157550 transitions. Word has length 106 [2019-09-10 08:45:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:42,073 INFO L475 AbstractCegarLoop]: Abstraction has 100406 states and 157550 transitions. [2019-09-10 08:45:42,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 100406 states and 157550 transitions. [2019-09-10 08:45:42,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:45:42,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:42,076 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2019-09-10 08:45:42,077 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:42,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:42,077 INFO L82 PathProgramCache]: Analyzing trace with hash -472030852, now seen corresponding path program 1 times [2019-09-10 08:45:42,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:42,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:42,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:42,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:42,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:45:42,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:42,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:42,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:42,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:42,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:42,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:42,150 INFO L87 Difference]: Start difference. First operand 100406 states and 157550 transitions. Second operand 3 states. [2019-09-10 08:45:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:42,672 INFO L93 Difference]: Finished difference Result 200754 states and 315006 transitions. [2019-09-10 08:45:42,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:42,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:45:42,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:42,946 INFO L225 Difference]: With dead ends: 200754 [2019-09-10 08:45:42,947 INFO L226 Difference]: Without dead ends: 200754 [2019-09-10 08:45:42,947 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 08:45:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200754 states. [2019-09-10 08:45:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200754 to 100408. [2019-09-10 08:45:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100408 states. [2019-09-10 08:45:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100408 states to 100408 states and 157552 transitions. [2019-09-10 08:45:45,565 INFO L78 Accepts]: Start accepts. Automaton has 100408 states and 157552 transitions. Word has length 106 [2019-09-10 08:45:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:45,565 INFO L475 AbstractCegarLoop]: Abstraction has 100408 states and 157552 transitions. [2019-09-10 08:45:45,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 100408 states and 157552 transitions. [2019-09-10 08:45:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:45:45,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:45,569 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2019-09-10 08:45:45,569 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:45,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:45,570 INFO L82 PathProgramCache]: Analyzing trace with hash 746984925, now seen corresponding path program 1 times [2019-09-10 08:45:45,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:45,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:45,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:45,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:45,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:45:45,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:45,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:45,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:45,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:45,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:45,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:45,617 INFO L87 Difference]: Start difference. First operand 100408 states and 157552 transitions. Second operand 3 states. [2019-09-10 08:45:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:46,102 INFO L93 Difference]: Finished difference Result 200784 states and 315052 transitions. [2019-09-10 08:45:46,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:46,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:45:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:46,429 INFO L225 Difference]: With dead ends: 200784 [2019-09-10 08:45:46,429 INFO L226 Difference]: Without dead ends: 200784 [2019-09-10 08:45:46,430 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 08:45:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200784 states. [2019-09-10 08:45:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200784 to 100414. [2019-09-10 08:45:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100414 states. [2019-09-10 08:45:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100414 states to 100414 states and 157560 transitions. [2019-09-10 08:45:49,215 INFO L78 Accepts]: Start accepts. Automaton has 100414 states and 157560 transitions. Word has length 106 [2019-09-10 08:45:49,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:49,216 INFO L475 AbstractCegarLoop]: Abstraction has 100414 states and 157560 transitions. [2019-09-10 08:45:49,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:49,216 INFO L276 IsEmpty]: Start isEmpty. Operand 100414 states and 157560 transitions. [2019-09-10 08:45:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:45:49,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:49,220 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2019-09-10 08:45:49,220 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:49,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:49,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1426692480, now seen corresponding path program 1 times [2019-09-10 08:45:49,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:49,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:49,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:49,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:49,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:45:49,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:49,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:49,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:49,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:49,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:49,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:49,277 INFO L87 Difference]: Start difference. First operand 100414 states and 157560 transitions. Second operand 3 states. [2019-09-10 08:45:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:49,863 INFO L93 Difference]: Finished difference Result 200810 states and 315092 transitions. [2019-09-10 08:45:49,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:49,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:45:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:50,170 INFO L225 Difference]: With dead ends: 200810 [2019-09-10 08:45:50,170 INFO L226 Difference]: Without dead ends: 200810 [2019-09-10 08:45:50,171 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 08:45:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200810 states. [2019-09-10 08:45:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200810 to 100416. [2019-09-10 08:45:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100416 states. [2019-09-10 08:45:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100416 states to 100416 states and 157562 transitions. [2019-09-10 08:45:52,959 INFO L78 Accepts]: Start accepts. Automaton has 100416 states and 157562 transitions. Word has length 106 [2019-09-10 08:45:52,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:52,960 INFO L475 AbstractCegarLoop]: Abstraction has 100416 states and 157562 transitions. [2019-09-10 08:45:52,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 100416 states and 157562 transitions. [2019-09-10 08:45:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:45:52,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:52,964 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:52,964 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:52,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:52,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2136006622, now seen corresponding path program 1 times [2019-09-10 08:45:52,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:52,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:52,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:52,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:52,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:53,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:45:53,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:45:53,057 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 08:45:53,057 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [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], [117], [120], [123], [127], [155], [183], [186], [201], [204], [207], [209], [211], [214], [217], [220], [223], [230], [238], [240], [243], [244], [246], [255], [258], [269], [272], [282], [290], [294], [296], [299], [330], [340], [350], [366], [369], [400], [410], [420], [436], [439], [470], [480], [490], [578], [581], [587], [605], [606], [610], [611], [612] [2019-09-10 08:45:53,062 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:45:53,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:45:53,088 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:45:53,218 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:45:53,219 INFO L272 AbstractInterpreter]: Visited 89 different actions 285 times. Merged at 35 different actions 181 times. Widened at 16 different actions 19 times. Performed 990 root evaluator evaluations with a maximum evaluation depth of 5. Performed 990 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 174 variables. [2019-09-10 08:45:53,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:53,219 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:45:53,434 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 85.25% of their original sizes. [2019-09-10 08:45:53,434 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:45:58,493 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-09-10 08:45:58,493 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:45:58,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:45:58,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [5] total 65 [2019-09-10 08:45:58,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:58,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 08:45:58,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 08:45:58,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3302, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 08:45:58,496 INFO L87 Difference]: Start difference. First operand 100416 states and 157562 transitions. Second operand 62 states. [2019-09-10 08:47:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:26,782 INFO L93 Difference]: Finished difference Result 301709 states and 468139 transitions. [2019-09-10 08:47:26,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-10 08:47:26,782 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 107 [2019-09-10 08:47:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:27,270 INFO L225 Difference]: With dead ends: 301709 [2019-09-10 08:47:27,270 INFO L226 Difference]: Without dead ends: 301709 [2019-09-10 08:47:27,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10508 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=3872, Invalid=24520, Unknown=0, NotChecked=0, Total=28392 [2019-09-10 08:47:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301709 states. [2019-09-10 08:47:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301709 to 100612. [2019-09-10 08:47:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100612 states. [2019-09-10 08:47:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100612 states to 100612 states and 157835 transitions. [2019-09-10 08:47:30,641 INFO L78 Accepts]: Start accepts. Automaton has 100612 states and 157835 transitions. Word has length 107 [2019-09-10 08:47:30,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:30,641 INFO L475 AbstractCegarLoop]: Abstraction has 100612 states and 157835 transitions. [2019-09-10 08:47:30,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 08:47:30,641 INFO L276 IsEmpty]: Start isEmpty. Operand 100612 states and 157835 transitions. [2019-09-10 08:47:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:47:30,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:30,645 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:30,645 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:30,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:30,646 INFO L82 PathProgramCache]: Analyzing trace with hash 535566749, now seen corresponding path program 1 times [2019-09-10 08:47:30,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:30,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:30,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:30,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:30,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:47:30,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:30,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:30,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:30,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:30,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:30,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:30,751 INFO L87 Difference]: Start difference. First operand 100612 states and 157835 transitions. Second operand 4 states. [2019-09-10 08:47:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:31,008 INFO L93 Difference]: Finished difference Result 100639 states and 157868 transitions. [2019-09-10 08:47:31,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:31,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-10 08:47:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:31,152 INFO L225 Difference]: With dead ends: 100639 [2019-09-10 08:47:31,152 INFO L226 Difference]: Without dead ends: 100612 [2019-09-10 08:47:31,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:47:31,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100612 states. [2019-09-10 08:47:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100612 to 100603. [2019-09-10 08:47:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100603 states. [2019-09-10 08:47:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100603 states to 100603 states and 157817 transitions. [2019-09-10 08:47:32,149 INFO L78 Accepts]: Start accepts. Automaton has 100603 states and 157817 transitions. Word has length 107 [2019-09-10 08:47:32,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:32,150 INFO L475 AbstractCegarLoop]: Abstraction has 100603 states and 157817 transitions. [2019-09-10 08:47:32,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 100603 states and 157817 transitions. [2019-09-10 08:47:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:47:32,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:32,153 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:32,153 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:32,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:32,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1363669356, now seen corresponding path program 1 times [2019-09-10 08:47:32,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:32,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:32,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:32,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:32,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:32,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:47:32,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:47:32,239 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 08:47:32,239 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [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], [117], [120], [123], [127], [155], [183], [186], [201], [204], [207], [209], [211], [214], [217], [220], [223], [230], [238], [240], [243], [244], [246], [255], [258], [269], [272], [282], [290], [294], [296], [299], [330], [340], [350], [366], [369], [400], [410], [420], [436], [439], [470], [480], [490], [565], [568], [574], [605], [606], [610], [611], [612] [2019-09-10 08:47:32,256 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:47:32,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:47:32,280 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:47:32,406 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:47:32,407 INFO L272 AbstractInterpreter]: Visited 89 different actions 285 times. Merged at 35 different actions 181 times. Widened at 16 different actions 19 times. Performed 990 root evaluator evaluations with a maximum evaluation depth of 5. Performed 990 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 174 variables. [2019-09-10 08:47:32,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:32,408 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:47:32,600 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 85.25% of their original sizes. [2019-09-10 08:47:32,600 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:47:37,680 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-09-10 08:47:37,680 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:47:37,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:47:37,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [5] total 65 [2019-09-10 08:47:37,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:37,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 08:47:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 08:47:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3302, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 08:47:37,682 INFO L87 Difference]: Start difference. First operand 100603 states and 157817 transitions. Second operand 62 states. [2019-09-10 08:48:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:56,454 INFO L93 Difference]: Finished difference Result 301882 states and 468368 transitions. [2019-09-10 08:48:56,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-10 08:48:56,454 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 107 [2019-09-10 08:48:56,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:56,911 INFO L225 Difference]: With dead ends: 301882 [2019-09-10 08:48:56,911 INFO L226 Difference]: Without dead ends: 301882 [2019-09-10 08:48:56,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10508 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=3872, Invalid=24520, Unknown=0, NotChecked=0, Total=28392 [2019-09-10 08:48:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301882 states. [2019-09-10 08:48:59,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301882 to 100605. [2019-09-10 08:48:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100605 states. [2019-09-10 08:48:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100605 states to 100605 states and 157819 transitions. [2019-09-10 08:48:59,980 INFO L78 Accepts]: Start accepts. Automaton has 100605 states and 157819 transitions. Word has length 107 [2019-09-10 08:48:59,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:59,980 INFO L475 AbstractCegarLoop]: Abstraction has 100605 states and 157819 transitions. [2019-09-10 08:48:59,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 08:48:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 100605 states and 157819 transitions. [2019-09-10 08:48:59,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:48:59,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:59,984 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1] [2019-09-10 08:48:59,984 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:59,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:59,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1864454230, now seen corresponding path program 1 times [2019-09-10 08:48:59,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:59,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:59,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:59,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:59,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:00,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:00,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:00,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:00,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:00,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:00,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:00,039 INFO L87 Difference]: Start difference. First operand 100605 states and 157819 transitions. Second operand 3 states. [2019-09-10 08:49:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:00,486 INFO L93 Difference]: Finished difference Result 195166 states and 303641 transitions. [2019-09-10 08:49:00,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:00,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:49:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:00,751 INFO L225 Difference]: With dead ends: 195166 [2019-09-10 08:49:00,751 INFO L226 Difference]: Without dead ends: 195166 [2019-09-10 08:49:00,752 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 08:49:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195166 states. [2019-09-10 08:49:03,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195166 to 195164. [2019-09-10 08:49:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195164 states. [2019-09-10 08:49:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195164 states to 195164 states and 303640 transitions. [2019-09-10 08:49:03,445 INFO L78 Accepts]: Start accepts. Automaton has 195164 states and 303640 transitions. Word has length 107 [2019-09-10 08:49:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:03,445 INFO L475 AbstractCegarLoop]: Abstraction has 195164 states and 303640 transitions. [2019-09-10 08:49:03,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 195164 states and 303640 transitions. [2019-09-10 08:49:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:49:03,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:03,453 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:03,453 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:03,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:03,453 INFO L82 PathProgramCache]: Analyzing trace with hash 720900890, now seen corresponding path program 1 times [2019-09-10 08:49:03,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:03,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:03,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:03,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:03,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:49:04,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:04,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:49:04,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:04,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:49:04,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:49:04,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:49:04,677 INFO L87 Difference]: Start difference. First operand 195164 states and 303640 transitions. Second operand 6 states. [2019-09-10 08:49:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:05,481 INFO L93 Difference]: Finished difference Result 316470 states and 492842 transitions. [2019-09-10 08:49:05,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:49:05,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2019-09-10 08:49:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:05,932 INFO L225 Difference]: With dead ends: 316470 [2019-09-10 08:49:05,932 INFO L226 Difference]: Without dead ends: 316470 [2019-09-10 08:49:05,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:49:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316470 states. [2019-09-10 08:49:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316470 to 282007. [2019-09-10 08:49:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282007 states. [2019-09-10 08:49:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282007 states to 282007 states and 439411 transitions. [2019-09-10 08:49:09,933 INFO L78 Accepts]: Start accepts. Automaton has 282007 states and 439411 transitions. Word has length 107 [2019-09-10 08:49:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:09,934 INFO L475 AbstractCegarLoop]: Abstraction has 282007 states and 439411 transitions. [2019-09-10 08:49:09,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:49:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 282007 states and 439411 transitions. [2019-09-10 08:49:09,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:49:09,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:09,938 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:09,939 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1871521224, now seen corresponding path program 1 times [2019-09-10 08:49:09,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:09,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:09,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:09,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:09,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:10,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:10,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:10,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:10,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:10,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:10,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:10,011 INFO L87 Difference]: Start difference. First operand 282007 states and 439411 transitions. Second operand 3 states. [2019-09-10 08:49:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:11,323 INFO L93 Difference]: Finished difference Result 240198 states and 371923 transitions. [2019-09-10 08:49:11,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:11,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:49:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:11,669 INFO L225 Difference]: With dead ends: 240198 [2019-09-10 08:49:11,669 INFO L226 Difference]: Without dead ends: 240198 [2019-09-10 08:49:11,670 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 08:49:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240198 states. [2019-09-10 08:49:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240198 to 239986. [2019-09-10 08:49:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239986 states. [2019-09-10 08:49:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239986 states to 239986 states and 371643 transitions. [2019-09-10 08:49:15,088 INFO L78 Accepts]: Start accepts. Automaton has 239986 states and 371643 transitions. Word has length 107 [2019-09-10 08:49:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:15,089 INFO L475 AbstractCegarLoop]: Abstraction has 239986 states and 371643 transitions. [2019-09-10 08:49:15,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 239986 states and 371643 transitions. [2019-09-10 08:49:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:49:15,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:15,092 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:15,092 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:15,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:15,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1819747193, now seen corresponding path program 1 times [2019-09-10 08:49:15,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:15,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:15,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:15,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:15,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:49:15,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:15,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:49:15,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:15,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:49:15,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:49:15,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:49:15,445 INFO L87 Difference]: Start difference. First operand 239986 states and 371643 transitions. Second operand 6 states. [2019-09-10 08:49:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:17,156 INFO L93 Difference]: Finished difference Result 416655 states and 646636 transitions. [2019-09-10 08:49:17,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:49:17,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-09-10 08:49:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:17,902 INFO L225 Difference]: With dead ends: 416655 [2019-09-10 08:49:17,902 INFO L226 Difference]: Without dead ends: 416655 [2019-09-10 08:49:17,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:49:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416655 states. [2019-09-10 08:49:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416655 to 363827. [2019-09-10 08:49:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363827 states. [2019-09-10 08:49:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363827 states to 363827 states and 564624 transitions. [2019-09-10 08:49:32,687 INFO L78 Accepts]: Start accepts. Automaton has 363827 states and 564624 transitions. Word has length 108 [2019-09-10 08:49:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:32,687 INFO L475 AbstractCegarLoop]: Abstraction has 363827 states and 564624 transitions. [2019-09-10 08:49:32,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:49:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 363827 states and 564624 transitions. [2019-09-10 08:49:32,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:49:32,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:32,690 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:32,690 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:32,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:32,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1697967367, now seen corresponding path program 1 times [2019-09-10 08:49:32,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:32,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:32,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:32,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:32,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:32,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:32,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:32,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:32,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:32,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:32,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:32,753 INFO L87 Difference]: Start difference. First operand 363827 states and 564624 transitions. Second operand 3 states. [2019-09-10 08:49:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:40,434 INFO L93 Difference]: Finished difference Result 707288 states and 1088299 transitions. [2019-09-10 08:49:40,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:40,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 08:49:40,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:41,714 INFO L225 Difference]: With dead ends: 707288 [2019-09-10 08:49:41,714 INFO L226 Difference]: Without dead ends: 707288 [2019-09-10 08:49:41,715 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 08:49:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707288 states. [2019-09-10 08:49:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707288 to 707286. [2019-09-10 08:49:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707286 states. [2019-09-10 08:49:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707286 states to 707286 states and 1088298 transitions. [2019-09-10 08:49:57,125 INFO L78 Accepts]: Start accepts. Automaton has 707286 states and 1088298 transitions. Word has length 108 [2019-09-10 08:49:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:57,125 INFO L475 AbstractCegarLoop]: Abstraction has 707286 states and 1088298 transitions. [2019-09-10 08:49:57,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 707286 states and 1088298 transitions. [2019-09-10 08:49:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:49:57,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:57,129 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:57,129 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:57,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2063874521, now seen corresponding path program 1 times [2019-09-10 08:49:57,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:57,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:57,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:57,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:57,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:50:05,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:05,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:05,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:05,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:05,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:05,885 INFO L87 Difference]: Start difference. First operand 707286 states and 1088298 transitions. Second operand 3 states. [2019-09-10 08:50:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:09,311 INFO L93 Difference]: Finished difference Result 992443 states and 1527500 transitions. [2019-09-10 08:50:09,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:09,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 08:50:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:10,928 INFO L225 Difference]: With dead ends: 992443 [2019-09-10 08:50:10,928 INFO L226 Difference]: Without dead ends: 992443 [2019-09-10 08:50:10,928 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 08:50:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992443 states. [2019-09-10 08:50:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992443 to 713169. [2019-09-10 08:50:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713169 states. [2019-09-10 08:50:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713169 states to 713169 states and 1097083 transitions. [2019-09-10 08:50:29,943 INFO L78 Accepts]: Start accepts. Automaton has 713169 states and 1097083 transitions. Word has length 109 [2019-09-10 08:50:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:29,943 INFO L475 AbstractCegarLoop]: Abstraction has 713169 states and 1097083 transitions. [2019-09-10 08:50:29,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 713169 states and 1097083 transitions. [2019-09-10 08:50:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:50:29,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:29,947 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:29,947 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1299926249, now seen corresponding path program 1 times [2019-09-10 08:50:29,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:29,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:29,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:29,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:50:29,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:29,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:29,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:30,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:30,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:30,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:30,001 INFO L87 Difference]: Start difference. First operand 713169 states and 1097083 transitions. Second operand 3 states. [2019-09-10 08:50:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:40,793 INFO L93 Difference]: Finished difference Result 1008327 states and 1553991 transitions. [2019-09-10 08:50:40,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:40,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 08:50:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:42,482 INFO L225 Difference]: With dead ends: 1008327 [2019-09-10 08:50:42,483 INFO L226 Difference]: Without dead ends: 1008327 [2019-09-10 08:50:42,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008327 states. [2019-09-10 08:51:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008327 to 976565. [2019-09-10 08:51:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976565 states. [2019-09-10 08:51:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976565 states to 976565 states and 1496678 transitions. [2019-09-10 08:51:18,603 INFO L78 Accepts]: Start accepts. Automaton has 976565 states and 1496678 transitions. Word has length 109 [2019-09-10 08:51:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:18,604 INFO L475 AbstractCegarLoop]: Abstraction has 976565 states and 1496678 transitions. [2019-09-10 08:51:18,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 976565 states and 1496678 transitions. [2019-09-10 08:51:18,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:51:18,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:18,609 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:18,609 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:18,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:18,610 INFO L82 PathProgramCache]: Analyzing trace with hash -652358726, now seen corresponding path program 1 times [2019-09-10 08:51:18,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:18,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:18,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:18,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:18,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:51:18,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:18,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:18,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:18,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:18,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:18,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:18,662 INFO L87 Difference]: Start difference. First operand 976565 states and 1496678 transitions. Second operand 3 states. [2019-09-10 08:51:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:37,808 INFO L93 Difference]: Finished difference Result 1291560 states and 1950939 transitions. [2019-09-10 08:51:37,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:37,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:51:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:40,265 INFO L225 Difference]: With dead ends: 1291560 [2019-09-10 08:51:40,265 INFO L226 Difference]: Without dead ends: 1291560 [2019-09-10 08:51:40,266 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 08:51:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291560 states. [2019-09-10 08:52:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291560 to 1291558. [2019-09-10 08:52:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291558 states. [2019-09-10 08:52:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291558 states to 1291558 states and 1950938 transitions. [2019-09-10 08:52:33,866 INFO L78 Accepts]: Start accepts. Automaton has 1291558 states and 1950938 transitions. Word has length 111 [2019-09-10 08:52:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:33,867 INFO L475 AbstractCegarLoop]: Abstraction has 1291558 states and 1950938 transitions. [2019-09-10 08:52:33,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1291558 states and 1950938 transitions. [2019-09-10 08:52:33,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:52:33,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:33,871 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:52:33,871 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:33,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:33,871 INFO L82 PathProgramCache]: Analyzing trace with hash 419198237, now seen corresponding path program 1 times [2019-09-10 08:52:33,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:33,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:33,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:52:33,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:33,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:33,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:33,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:33,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:33,930 INFO L87 Difference]: Start difference. First operand 1291558 states and 1950938 transitions. Second operand 3 states. [2019-09-10 08:52:42,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:42,817 INFO L93 Difference]: Finished difference Result 548331 states and 821489 transitions. [2019-09-10 08:52:42,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:42,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:52:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:43,592 INFO L225 Difference]: With dead ends: 548331 [2019-09-10 08:52:43,592 INFO L226 Difference]: Without dead ends: 548331 [2019-09-10 08:52:43,592 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 08:52:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548331 states. [2019-09-10 08:52:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548331 to 406192. [2019-09-10 08:52:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406192 states. [2019-09-10 08:52:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406192 states to 406192 states and 613246 transitions. [2019-09-10 08:52:49,942 INFO L78 Accepts]: Start accepts. Automaton has 406192 states and 613246 transitions. Word has length 111 [2019-09-10 08:52:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:49,942 INFO L475 AbstractCegarLoop]: Abstraction has 406192 states and 613246 transitions. [2019-09-10 08:52:49,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 406192 states and 613246 transitions. [2019-09-10 08:52:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:52:49,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:49,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:52:49,946 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:49,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:49,947 INFO L82 PathProgramCache]: Analyzing trace with hash -928839182, now seen corresponding path program 1 times [2019-09-10 08:52:49,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:49,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:49,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:49,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:49,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:52:50,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:52:50,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:52:50,105 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 08:52:50,105 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], [117], [120], [123], [127], [130], [145], [153], [155], [158], [173], [181], [183], [186], [201], [209], [211], [214], [217], [220], [223], [226], [230], [238], [240], [243], [244], [246], [255], [258], [262], [267], [269], [272], [286], [290], [294], [296], [299], [330], [340], [350], [356], [360], [364], [366], [369], [400], [410], [420], [426], [430], [434], [436], [439], [470], [480], [490], [605], [606], [610], [611], [612] [2019-09-10 08:52:50,108 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:52:50,108 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:52:50,129 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:52:50,357 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:52:50,357 INFO L272 AbstractInterpreter]: Visited 103 different actions 579 times. Merged at 54 different actions 422 times. Widened at 26 different actions 73 times. Performed 1729 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1729 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 16 different actions. Largest state had 174 variables. [2019-09-10 08:52:50,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:50,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:52:50,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:52:50,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:52:50,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:50,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:52:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:50,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:52:50,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:52:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:52:50,598 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:52:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:52:50,680 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:52:50,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 08:52:50,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:50,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:50,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:50,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:52:50,682 INFO L87 Difference]: Start difference. First operand 406192 states and 613246 transitions. Second operand 4 states. [2019-09-10 08:52:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:56,824 INFO L93 Difference]: Finished difference Result 406429 states and 609922 transitions. [2019-09-10 08:52:56,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:56,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 08:52:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:57,504 INFO L225 Difference]: With dead ends: 406429 [2019-09-10 08:52:57,504 INFO L226 Difference]: Without dead ends: 406429 [2019-09-10 08:52:57,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:52:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406429 states. [2019-09-10 08:53:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406429 to 406425. [2019-09-10 08:53:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406425 states. [2019-09-10 08:53:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406425 states to 406425 states and 609919 transitions. [2019-09-10 08:53:02,928 INFO L78 Accepts]: Start accepts. Automaton has 406425 states and 609919 transitions. Word has length 112 [2019-09-10 08:53:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:02,928 INFO L475 AbstractCegarLoop]: Abstraction has 406425 states and 609919 transitions. [2019-09-10 08:53:02,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:02,928 INFO L276 IsEmpty]: Start isEmpty. Operand 406425 states and 609919 transitions. [2019-09-10 08:53:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:53:02,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:02,932 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:53:02,932 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:02,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:02,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1267026466, now seen corresponding path program 1 times [2019-09-10 08:53:02,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:02,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:02,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:02,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:02,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:53:03,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:03,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:53:03,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:03,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:53:03,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:53:03,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:53:03,052 INFO L87 Difference]: Start difference. First operand 406425 states and 609919 transitions. Second operand 5 states. [2019-09-10 08:53:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:05,354 INFO L93 Difference]: Finished difference Result 406389 states and 603249 transitions. [2019-09-10 08:53:05,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:53:05,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:53:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:05,994 INFO L225 Difference]: With dead ends: 406389 [2019-09-10 08:53:05,994 INFO L226 Difference]: Without dead ends: 406389 [2019-09-10 08:53:05,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:53:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406389 states. [2019-09-10 08:53:15,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406389 to 406389. [2019-09-10 08:53:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406389 states. [2019-09-10 08:53:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406389 states to 406389 states and 603249 transitions. [2019-09-10 08:53:16,622 INFO L78 Accepts]: Start accepts. Automaton has 406389 states and 603249 transitions. Word has length 113 [2019-09-10 08:53:16,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:16,623 INFO L475 AbstractCegarLoop]: Abstraction has 406389 states and 603249 transitions. [2019-09-10 08:53:16,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:53:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 406389 states and 603249 transitions. [2019-09-10 08:53:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:53:16,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:16,627 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:53:16,627 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:16,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:16,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1810041533, now seen corresponding path program 1 times [2019-09-10 08:53:16,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:16,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:16,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:16,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:16,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:53:17,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:17,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:17,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:17,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:17,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:17,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:17,971 INFO L87 Difference]: Start difference. First operand 406389 states and 603249 transitions. Second operand 4 states. [2019-09-10 08:53:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:19,298 INFO L93 Difference]: Finished difference Result 428532 states and 638265 transitions. [2019-09-10 08:53:19,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:53:19,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-10 08:53:19,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:19,975 INFO L225 Difference]: With dead ends: 428532 [2019-09-10 08:53:19,975 INFO L226 Difference]: Without dead ends: 428532 [2019-09-10 08:53:19,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428532 states. [2019-09-10 08:53:31,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428532 to 393648. [2019-09-10 08:53:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393648 states. [2019-09-10 08:53:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393648 states to 393648 states and 585167 transitions. [2019-09-10 08:53:33,647 INFO L78 Accepts]: Start accepts. Automaton has 393648 states and 585167 transitions. Word has length 113 [2019-09-10 08:53:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:33,647 INFO L475 AbstractCegarLoop]: Abstraction has 393648 states and 585167 transitions. [2019-09-10 08:53:33,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 393648 states and 585167 transitions. [2019-09-10 08:53:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:53:33,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:33,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:53:33,651 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash 926903463, now seen corresponding path program 1 times [2019-09-10 08:53:33,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:33,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:33,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:33,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:33,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:53:33,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:33,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:33,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:33,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:33,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:33,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:33,714 INFO L87 Difference]: Start difference. First operand 393648 states and 585167 transitions. Second operand 3 states. [2019-09-10 08:53:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:34,586 INFO L93 Difference]: Finished difference Result 344607 states and 509462 transitions. [2019-09-10 08:53:34,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:34,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 08:53:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:35,122 INFO L225 Difference]: With dead ends: 344607 [2019-09-10 08:53:35,123 INFO L226 Difference]: Without dead ends: 344607 [2019-09-10 08:53:35,123 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 08:53:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344607 states. [2019-09-10 08:53:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344607 to 344605. [2019-09-10 08:53:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344605 states. [2019-09-10 08:53:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344605 states to 344605 states and 509461 transitions. [2019-09-10 08:53:45,637 INFO L78 Accepts]: Start accepts. Automaton has 344605 states and 509461 transitions. Word has length 114 [2019-09-10 08:53:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:45,637 INFO L475 AbstractCegarLoop]: Abstraction has 344605 states and 509461 transitions. [2019-09-10 08:53:45,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 344605 states and 509461 transitions. [2019-09-10 08:53:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:53:45,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:45,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:53:45,642 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:45,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1873159548, now seen corresponding path program 1 times [2019-09-10 08:53:45,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:45,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:45,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:45,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:45,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:53:45,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:53:45,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:53:45,771 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 08:53:45,773 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [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], [117], [120], [123], [127], [130], [145], [153], [155], [158], [173], [181], [183], [186], [201], [209], [211], [214], [217], [220], [223], [226], [230], [238], [240], [243], [244], [246], [255], [258], [262], [267], [269], [272], [286], [290], [294], [296], [299], [330], [340], [350], [356], [360], [364], [366], [369], [400], [410], [420], [426], [430], [434], [436], [439], [470], [480], [490], [565], [568], [574], [605], [606], [610], [611], [612] [2019-09-10 08:53:45,779 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:53:45,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:53:45,808 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:53:46,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:53:46,137 INFO L272 AbstractInterpreter]: Visited 105 different actions 712 times. Merged at 54 different actions 536 times. Widened at 28 different actions 107 times. Performed 2084 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2084 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 59 fixpoints after 24 different actions. Largest state had 174 variables. [2019-09-10 08:53:46,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:46,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:53:46,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:53:46,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:53:46,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:46,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:53:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:46,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:53:46,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:53:46,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:53:46,308 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:53:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:53:46,367 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:53:46,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 08:53:46,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:46,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:46,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:53:46,369 INFO L87 Difference]: Start difference. First operand 344605 states and 509461 transitions. Second operand 4 states. [2019-09-10 08:53:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:48,218 INFO L93 Difference]: Finished difference Result 338574 states and 500612 transitions. [2019-09-10 08:53:48,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:53:48,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 08:53:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:48,790 INFO L225 Difference]: With dead ends: 338574 [2019-09-10 08:53:48,790 INFO L226 Difference]: Without dead ends: 338289 [2019-09-10 08:53:48,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:53:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338289 states. [2019-09-10 08:53:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338289 to 338126. [2019-09-10 08:53:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338126 states. [2019-09-10 08:53:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338126 states to 338126 states and 500084 transitions. [2019-09-10 08:53:55,005 INFO L78 Accepts]: Start accepts. Automaton has 338126 states and 500084 transitions. Word has length 114 [2019-09-10 08:53:55,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:55,005 INFO L475 AbstractCegarLoop]: Abstraction has 338126 states and 500084 transitions. [2019-09-10 08:53:55,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 338126 states and 500084 transitions. [2019-09-10 08:53:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:53:55,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:55,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:53:55,008 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:55,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2095676933, now seen corresponding path program 1 times [2019-09-10 08:53:55,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:55,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:55,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:55,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:55,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:53:55,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:55,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:55,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:55,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:55,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:55,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:55,099 INFO L87 Difference]: Start difference. First operand 338126 states and 500084 transitions. Second operand 4 states. [2019-09-10 08:53:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:55,831 INFO L93 Difference]: Finished difference Result 304383 states and 450258 transitions. [2019-09-10 08:53:55,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:53:55,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-10 08:53:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:56,313 INFO L225 Difference]: With dead ends: 304383 [2019-09-10 08:53:56,314 INFO L226 Difference]: Without dead ends: 304248 [2019-09-10 08:53:56,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:53:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304248 states. [2019-09-10 08:54:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304248 to 304244. [2019-09-10 08:54:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304244 states. [2019-09-10 08:54:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304244 states to 304244 states and 450101 transitions. [2019-09-10 08:54:06,747 INFO L78 Accepts]: Start accepts. Automaton has 304244 states and 450101 transitions. Word has length 116 [2019-09-10 08:54:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:06,748 INFO L475 AbstractCegarLoop]: Abstraction has 304244 states and 450101 transitions. [2019-09-10 08:54:06,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 304244 states and 450101 transitions. [2019-09-10 08:54:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:54:06,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:06,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:54:06,750 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash 773343116, now seen corresponding path program 1 times [2019-09-10 08:54:06,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:06,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:06,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:06,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:06,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:54:06,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:54:06,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:54:06,869 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2019-09-10 08:54:06,870 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], [117], [120], [123], [127], [130], [133], [145], [153], [155], [158], [173], [181], [183], [186], [201], [209], [211], [214], [217], [220], [223], [226], [230], [238], [240], [243], [244], [246], [255], [258], [262], [267], [269], [272], [286], [290], [294], [296], [299], [330], [340], [350], [356], [360], [364], [366], [369], [372], [375], [378], [381], [383], [400], [410], [426], [430], [432], [436], [439], [470], [480], [490], [605], [606], [610], [611], [612] [2019-09-10 08:54:06,872 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:54:06,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:54:06,896 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:54:07,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:54:07,262 INFO L272 AbstractInterpreter]: Visited 108 different actions 740 times. Merged at 59 different actions 566 times. Widened at 26 different actions 135 times. Performed 2189 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2189 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 52 fixpoints after 19 different actions. Largest state had 175 variables. [2019-09-10 08:54:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:07,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:54:07,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:54:07,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:54:07,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:07,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:54:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:07,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:54:07,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:54:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:54:07,475 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:54:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:54:07,530 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:54:07,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 08:54:07,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:07,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:07,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:07,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:54:07,532 INFO L87 Difference]: Start difference. First operand 304244 states and 450101 transitions. Second operand 4 states. [2019-09-10 08:54:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:09,445 INFO L93 Difference]: Finished difference Result 304246 states and 450100 transitions. [2019-09-10 08:54:09,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:09,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-10 08:54:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:09,895 INFO L225 Difference]: With dead ends: 304246 [2019-09-10 08:54:09,895 INFO L226 Difference]: Without dead ends: 304246 [2019-09-10 08:54:09,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:54:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304246 states. [2019-09-10 08:54:13,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304246 to 304088. [2019-09-10 08:54:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304088 states. [2019-09-10 08:54:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304088 states to 304088 states and 449915 transitions. [2019-09-10 08:54:14,095 INFO L78 Accepts]: Start accepts. Automaton has 304088 states and 449915 transitions. Word has length 117 [2019-09-10 08:54:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:14,095 INFO L475 AbstractCegarLoop]: Abstraction has 304088 states and 449915 transitions. [2019-09-10 08:54:14,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 304088 states and 449915 transitions. [2019-09-10 08:54:14,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:54:14,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:14,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:54:14,098 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:14,098 INFO L82 PathProgramCache]: Analyzing trace with hash 450764102, now seen corresponding path program 1 times [2019-09-10 08:54:14,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:14,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:14,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:14,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:14,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:54:14,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:54:14,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:54:14,219 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-09-10 08:54:14,219 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [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], [117], [120], [123], [127], [130], [140], [145], [153], [155], [158], [173], [181], [183], [186], [201], [209], [211], [214], [217], [220], [223], [226], [230], [238], [240], [243], [244], [246], [255], [258], [262], [267], [269], [272], [286], [290], [294], [296], [299], [302], [305], [308], [311], [313], [330], [340], [356], [360], [364], [366], [369], [400], [410], [420], [426], [428], [434], [436], [439], [470], [480], [490], [565], [568], [571], [605], [606], [610], [611], [612] [2019-09-10 08:54:14,221 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:54:14,221 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:54:14,243 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:54:14,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:54:14,515 INFO L272 AbstractInterpreter]: Visited 110 different actions 701 times. Merged at 59 different actions 536 times. Widened at 26 different actions 117 times. Performed 2060 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2060 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 47 fixpoints after 15 different actions. Largest state had 175 variables. [2019-09-10 08:54:14,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:14,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:54:14,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:54:14,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:54:14,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:14,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:54:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:15,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:54:15,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:54:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:54:15,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:54:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:54:15,658 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:54:15,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 08:54:15,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:15,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:15,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:15,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:54:15,661 INFO L87 Difference]: Start difference. First operand 304088 states and 449915 transitions. Second operand 4 states.