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_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:45:58,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:45:58,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:45:58,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:45:58,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:45:58,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:45:58,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:45:58,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:45:58,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:45:58,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:45:58,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:45:58,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:45:58,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:45:58,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:45:58,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:45:58,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:45:58,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:45:58,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:45:58,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:45:58,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:45:58,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:45:58,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:45:58,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:45:58,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:45:58,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:45:58,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:45:58,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:45:58,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:45:58,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:45:58,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:45:58,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:45:58,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:45:58,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:45:58,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:45:58,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:45:58,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:45:58,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:45:58,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:45:58,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:45:58,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:45:58,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:45:58,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:45:58,570 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:45:58,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:45:58,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:45:58,572 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:45:58,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:45:58,573 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:45:58,573 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:45:58,573 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:45:58,574 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:45:58,574 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:45:58,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:45:58,576 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:45:58,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:45:58,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:45:58,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:45:58,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:45:58,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:45:58,578 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:45:58,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:45:58,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:45:58,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:45:58,579 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:45:58,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:45:58,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:45:58,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:45:58,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:45:58,580 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:45:58,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:45:58,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:45:58,581 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:45:58,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:45:58,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:45:58,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:45:58,659 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:45:58,660 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:45:58,661 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 06:45:58,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18d7699a9/e842acc0cb874badbc669fc816fcc9be/FLAG1e46a0479 [2019-09-10 06:45:59,230 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:45:59,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 06:45:59,255 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18d7699a9/e842acc0cb874badbc669fc816fcc9be/FLAG1e46a0479 [2019-09-10 06:45:59,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18d7699a9/e842acc0cb874badbc669fc816fcc9be [2019-09-10 06:45:59,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:45:59,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:45:59,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:45:59,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:45:59,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:45:59,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:45:59" (1/1) ... [2019-09-10 06:45:59,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc34360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:45:59, skipping insertion in model container [2019-09-10 06:45:59,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:45:59" (1/1) ... [2019-09-10 06:45:59,575 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:45:59,637 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:46:00,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:46:00,048 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:46:00,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:46:00,175 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:46:00,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:00 WrapperNode [2019-09-10 06:46:00,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:46:00,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:46:00,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:46:00,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:46:00,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:00" (1/1) ... [2019-09-10 06:46:00,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:00" (1/1) ... [2019-09-10 06:46:00,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:00" (1/1) ... [2019-09-10 06:46:00,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:00" (1/1) ... [2019-09-10 06:46:00,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:00" (1/1) ... [2019-09-10 06:46:00,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:00" (1/1) ... [2019-09-10 06:46:00,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:00" (1/1) ... [2019-09-10 06:46:00,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:46:00,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:46:00,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:46:00,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:46:00,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:46:00,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:46:00,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:46:00,292 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:46:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:46:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:46:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:46:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:46:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:46:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:46:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:46:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:46:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:46:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:46:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:46:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:46:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:46:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:46:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:46:01,132 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:46:01,132 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:46:01,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:46:01 BoogieIcfgContainer [2019-09-10 06:46:01,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:46:01,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:46:01,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:46:01,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:46:01,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:45:59" (1/3) ... [2019-09-10 06:46:01,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e8fc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:46:01, skipping insertion in model container [2019-09-10 06:46:01,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:00" (2/3) ... [2019-09-10 06:46:01,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e8fc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:46:01, skipping insertion in model container [2019-09-10 06:46:01,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:46:01" (3/3) ... [2019-09-10 06:46:01,145 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 06:46:01,153 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:46:01,166 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:46:01,180 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:46:01,207 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:46:01,207 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:46:01,207 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:46:01,207 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:46:01,208 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:46:01,208 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:46:01,208 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:46:01,208 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:46:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states. [2019-09-10 06:46:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 06:46:01,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:01,244 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:01,246 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:01,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:01,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1995893501, now seen corresponding path program 1 times [2019-09-10 06:46:01,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:01,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:01,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:01,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:01,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:01,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:46:01,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:01,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:46:01,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:46:01,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:46:01,768 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 6 states. [2019-09-10 06:46:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:02,148 INFO L93 Difference]: Finished difference Result 732 states and 1137 transitions. [2019-09-10 06:46:02,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:46:02,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-09-10 06:46:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:02,179 INFO L225 Difference]: With dead ends: 732 [2019-09-10 06:46:02,179 INFO L226 Difference]: Without dead ends: 696 [2019-09-10 06:46:02,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:46:02,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-10 06:46:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 469. [2019-09-10 06:46:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-09-10 06:46:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 711 transitions. [2019-09-10 06:46:02,269 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 711 transitions. Word has length 54 [2019-09-10 06:46:02,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:02,270 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 711 transitions. [2019-09-10 06:46:02,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:46:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 711 transitions. [2019-09-10 06:46:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:46:02,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:02,273 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] [2019-09-10 06:46:02,273 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:02,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1306112853, now seen corresponding path program 1 times [2019-09-10 06:46:02,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:02,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:02,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:02,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:02,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:02,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:02,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:02,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:02,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:02,428 INFO L87 Difference]: Start difference. First operand 469 states and 711 transitions. Second operand 3 states. [2019-09-10 06:46:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:02,466 INFO L93 Difference]: Finished difference Result 835 states and 1260 transitions. [2019-09-10 06:46:02,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:02,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-10 06:46:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:02,472 INFO L225 Difference]: With dead ends: 835 [2019-09-10 06:46:02,472 INFO L226 Difference]: Without dead ends: 835 [2019-09-10 06:46:02,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-09-10 06:46:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 833. [2019-09-10 06:46:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-10 06:46:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1259 transitions. [2019-09-10 06:46:02,524 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1259 transitions. Word has length 57 [2019-09-10 06:46:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:02,525 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1259 transitions. [2019-09-10 06:46:02,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1259 transitions. [2019-09-10 06:46:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:46:02,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:02,538 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] [2019-09-10 06:46:02,539 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:02,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1081311145, now seen corresponding path program 1 times [2019-09-10 06:46:02,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:02,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:02,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:02,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:02,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:02,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:02,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:02,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:02,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:02,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:02,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:02,669 INFO L87 Difference]: Start difference. First operand 833 states and 1259 transitions. Second operand 3 states. [2019-09-10 06:46:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:02,718 INFO L93 Difference]: Finished difference Result 1423 states and 2109 transitions. [2019-09-10 06:46:02,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:02,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-10 06:46:02,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:02,734 INFO L225 Difference]: With dead ends: 1423 [2019-09-10 06:46:02,740 INFO L226 Difference]: Without dead ends: 1423 [2019-09-10 06:46:02,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-09-10 06:46:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1421. [2019-09-10 06:46:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-09-10 06:46:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2108 transitions. [2019-09-10 06:46:02,784 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2108 transitions. Word has length 57 [2019-09-10 06:46:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:02,787 INFO L475 AbstractCegarLoop]: Abstraction has 1421 states and 2108 transitions. [2019-09-10 06:46:02,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2108 transitions. [2019-09-10 06:46:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:46:02,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:02,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:02,789 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:02,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:02,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1811397466, now seen corresponding path program 1 times [2019-09-10 06:46:02,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:02,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:02,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:02,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:02,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:02,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:02,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:46:02,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:02,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:46:02,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:46:02,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:02,917 INFO L87 Difference]: Start difference. First operand 1421 states and 2108 transitions. Second operand 5 states. [2019-09-10 06:46:03,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:03,232 INFO L93 Difference]: Finished difference Result 2038 states and 2982 transitions. [2019-09-10 06:46:03,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:03,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-10 06:46:03,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:03,242 INFO L225 Difference]: With dead ends: 2038 [2019-09-10 06:46:03,242 INFO L226 Difference]: Without dead ends: 2038 [2019-09-10 06:46:03,243 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 06:46:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2019-09-10 06:46:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 2021. [2019-09-10 06:46:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2019-09-10 06:46:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2966 transitions. [2019-09-10 06:46:03,295 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2966 transitions. Word has length 58 [2019-09-10 06:46:03,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:03,295 INFO L475 AbstractCegarLoop]: Abstraction has 2021 states and 2966 transitions. [2019-09-10 06:46:03,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:46:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2966 transitions. [2019-09-10 06:46:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:46:03,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:03,297 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:03,297 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:03,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:03,298 INFO L82 PathProgramCache]: Analyzing trace with hash -211164811, now seen corresponding path program 1 times [2019-09-10 06:46:03,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:03,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:03,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:03,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:03,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:03,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:03,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:46:03,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:03,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:46:03,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:46:03,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:46:03,395 INFO L87 Difference]: Start difference. First operand 2021 states and 2966 transitions. Second operand 6 states. [2019-09-10 06:46:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:03,728 INFO L93 Difference]: Finished difference Result 4492 states and 6570 transitions. [2019-09-10 06:46:03,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:03,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-09-10 06:46:03,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:03,751 INFO L225 Difference]: With dead ends: 4492 [2019-09-10 06:46:03,751 INFO L226 Difference]: Without dead ends: 4492 [2019-09-10 06:46:03,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:46:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4492 states. [2019-09-10 06:46:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4492 to 4458. [2019-09-10 06:46:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4458 states. [2019-09-10 06:46:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4458 states to 4458 states and 6538 transitions. [2019-09-10 06:46:03,895 INFO L78 Accepts]: Start accepts. Automaton has 4458 states and 6538 transitions. Word has length 58 [2019-09-10 06:46:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:03,895 INFO L475 AbstractCegarLoop]: Abstraction has 4458 states and 6538 transitions. [2019-09-10 06:46:03,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:46:03,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4458 states and 6538 transitions. [2019-09-10 06:46:03,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:46:03,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:03,897 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] [2019-09-10 06:46:03,898 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:03,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1182977442, now seen corresponding path program 1 times [2019-09-10 06:46:03,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:03,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:03,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:03,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:03,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:04,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:04,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:46:04,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:04,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:46:04,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:46:04,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:46:04,020 INFO L87 Difference]: Start difference. First operand 4458 states and 6538 transitions. Second operand 7 states. [2019-09-10 06:46:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:04,698 INFO L93 Difference]: Finished difference Result 15956 states and 23257 transitions. [2019-09-10 06:46:04,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:46:04,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-09-10 06:46:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:04,805 INFO L225 Difference]: With dead ends: 15956 [2019-09-10 06:46:04,806 INFO L226 Difference]: Without dead ends: 15956 [2019-09-10 06:46:04,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:46:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15956 states. [2019-09-10 06:46:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15956 to 4478. [2019-09-10 06:46:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4478 states. [2019-09-10 06:46:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4478 states to 4478 states and 6562 transitions. [2019-09-10 06:46:05,090 INFO L78 Accepts]: Start accepts. Automaton has 4478 states and 6562 transitions. Word has length 59 [2019-09-10 06:46:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:05,092 INFO L475 AbstractCegarLoop]: Abstraction has 4478 states and 6562 transitions. [2019-09-10 06:46:05,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:46:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4478 states and 6562 transitions. [2019-09-10 06:46:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:46:05,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:05,100 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] [2019-09-10 06:46:05,101 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:05,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:05,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1225107520, now seen corresponding path program 1 times [2019-09-10 06:46:05,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:05,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:05,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:05,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:05,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:46:05,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:05,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:46:05,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:46:05,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:46:05,217 INFO L87 Difference]: Start difference. First operand 4478 states and 6562 transitions. Second operand 7 states. [2019-09-10 06:46:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:05,849 INFO L93 Difference]: Finished difference Result 24055 states and 35718 transitions. [2019-09-10 06:46:05,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:46:05,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-09-10 06:46:05,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:05,905 INFO L225 Difference]: With dead ends: 24055 [2019-09-10 06:46:05,905 INFO L226 Difference]: Without dead ends: 24055 [2019-09-10 06:46:05,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:46:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24055 states. [2019-09-10 06:46:06,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24055 to 4514. [2019-09-10 06:46:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4514 states. [2019-09-10 06:46:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 6608 transitions. [2019-09-10 06:46:06,177 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 6608 transitions. Word has length 59 [2019-09-10 06:46:06,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:06,177 INFO L475 AbstractCegarLoop]: Abstraction has 4514 states and 6608 transitions. [2019-09-10 06:46:06,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:46:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 6608 transitions. [2019-09-10 06:46:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:46:06,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:06,179 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:06,180 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1930518435, now seen corresponding path program 1 times [2019-09-10 06:46:06,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:06,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:06,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:06,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:06,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:06,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:06,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:46:06,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:06,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:46:06,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:46:06,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:46:06,269 INFO L87 Difference]: Start difference. First operand 4514 states and 6608 transitions. Second operand 6 states. [2019-09-10 06:46:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:06,540 INFO L93 Difference]: Finished difference Result 11941 states and 17284 transitions. [2019-09-10 06:46:06,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:06,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-09-10 06:46:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:06,563 INFO L225 Difference]: With dead ends: 11941 [2019-09-10 06:46:06,563 INFO L226 Difference]: Without dead ends: 11941 [2019-09-10 06:46:06,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:46:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11941 states. [2019-09-10 06:46:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11941 to 11937. [2019-09-10 06:46:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11937 states. [2019-09-10 06:46:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11937 states to 11937 states and 17282 transitions. [2019-09-10 06:46:06,803 INFO L78 Accepts]: Start accepts. Automaton has 11937 states and 17282 transitions. Word has length 60 [2019-09-10 06:46:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:06,803 INFO L475 AbstractCegarLoop]: Abstraction has 11937 states and 17282 transitions. [2019-09-10 06:46:06,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:46:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 11937 states and 17282 transitions. [2019-09-10 06:46:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:46:06,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:06,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:06,807 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:06,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:06,807 INFO L82 PathProgramCache]: Analyzing trace with hash -341979445, now seen corresponding path program 1 times [2019-09-10 06:46:06,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:06,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:06,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:06,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:06,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:06,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:06,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:46:06,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:06,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:46:06,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:46:06,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:06,935 INFO L87 Difference]: Start difference. First operand 11937 states and 17282 transitions. Second operand 5 states. [2019-09-10 06:46:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:07,099 INFO L93 Difference]: Finished difference Result 24873 states and 36175 transitions. [2019-09-10 06:46:07,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:07,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-10 06:46:07,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:07,151 INFO L225 Difference]: With dead ends: 24873 [2019-09-10 06:46:07,152 INFO L226 Difference]: Without dead ends: 24873 [2019-09-10 06:46:07,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:46:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24873 states. [2019-09-10 06:46:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24873 to 14649. [2019-09-10 06:46:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14649 states. [2019-09-10 06:46:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14649 states to 14649 states and 21288 transitions. [2019-09-10 06:46:08,065 INFO L78 Accepts]: Start accepts. Automaton has 14649 states and 21288 transitions. Word has length 61 [2019-09-10 06:46:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:08,065 INFO L475 AbstractCegarLoop]: Abstraction has 14649 states and 21288 transitions. [2019-09-10 06:46:08,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:46:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 14649 states and 21288 transitions. [2019-09-10 06:46:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:46:08,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:08,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:08,068 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:08,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:08,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1558281363, now seen corresponding path program 1 times [2019-09-10 06:46:08,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:08,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:08,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:08,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:08,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:08,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:08,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:46:08,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:08,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:46:08,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:46:08,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:08,135 INFO L87 Difference]: Start difference. First operand 14649 states and 21288 transitions. Second operand 5 states. [2019-09-10 06:46:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:08,319 INFO L93 Difference]: Finished difference Result 26910 states and 39159 transitions. [2019-09-10 06:46:08,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:08,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-10 06:46:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:08,375 INFO L225 Difference]: With dead ends: 26910 [2019-09-10 06:46:08,376 INFO L226 Difference]: Without dead ends: 26910 [2019-09-10 06:46:08,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:46:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26910 states. [2019-09-10 06:46:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26910 to 16592. [2019-09-10 06:46:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16592 states. [2019-09-10 06:46:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16592 states to 16592 states and 24158 transitions. [2019-09-10 06:46:08,655 INFO L78 Accepts]: Start accepts. Automaton has 16592 states and 24158 transitions. Word has length 61 [2019-09-10 06:46:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:08,656 INFO L475 AbstractCegarLoop]: Abstraction has 16592 states and 24158 transitions. [2019-09-10 06:46:08,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:46:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 16592 states and 24158 transitions. [2019-09-10 06:46:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 06:46:08,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:08,660 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:08,660 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:08,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1561793871, now seen corresponding path program 1 times [2019-09-10 06:46:08,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:08,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:08,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:08,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:08,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:08,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:08,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:08,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:08,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:08,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:08,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:08,717 INFO L87 Difference]: Start difference. First operand 16592 states and 24158 transitions. Second operand 3 states. [2019-09-10 06:46:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:08,879 INFO L93 Difference]: Finished difference Result 24657 states and 35099 transitions. [2019-09-10 06:46:08,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:08,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 06:46:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:08,922 INFO L225 Difference]: With dead ends: 24657 [2019-09-10 06:46:08,923 INFO L226 Difference]: Without dead ends: 24657 [2019-09-10 06:46:08,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24657 states. [2019-09-10 06:46:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24657 to 19938. [2019-09-10 06:46:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19938 states. [2019-09-10 06:46:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19938 states to 19938 states and 28543 transitions. [2019-09-10 06:46:09,227 INFO L78 Accepts]: Start accepts. Automaton has 19938 states and 28543 transitions. Word has length 64 [2019-09-10 06:46:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:09,227 INFO L475 AbstractCegarLoop]: Abstraction has 19938 states and 28543 transitions. [2019-09-10 06:46:09,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 19938 states and 28543 transitions. [2019-09-10 06:46:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 06:46:09,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:09,233 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:09,234 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:09,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash -944536211, now seen corresponding path program 1 times [2019-09-10 06:46:09,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:09,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:09,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:09,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:09,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:46:09,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:09,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:46:09,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:46:09,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:46:09,321 INFO L87 Difference]: Start difference. First operand 19938 states and 28543 transitions. Second operand 7 states. [2019-09-10 06:46:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:10,144 INFO L93 Difference]: Finished difference Result 81575 states and 115961 transitions. [2019-09-10 06:46:10,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:46:10,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-09-10 06:46:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:10,240 INFO L225 Difference]: With dead ends: 81575 [2019-09-10 06:46:10,241 INFO L226 Difference]: Without dead ends: 81575 [2019-09-10 06:46:10,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:46:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81575 states. [2019-09-10 06:46:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81575 to 20032. [2019-09-10 06:46:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20032 states. [2019-09-10 06:46:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20032 states to 20032 states and 28664 transitions. [2019-09-10 06:46:10,845 INFO L78 Accepts]: Start accepts. Automaton has 20032 states and 28664 transitions. Word has length 64 [2019-09-10 06:46:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:10,845 INFO L475 AbstractCegarLoop]: Abstraction has 20032 states and 28664 transitions. [2019-09-10 06:46:10,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:46:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 20032 states and 28664 transitions. [2019-09-10 06:46:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:46:10,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:10,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:10,851 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:10,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:10,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2106073500, now seen corresponding path program 1 times [2019-09-10 06:46:10,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:10,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:10,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:10,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:10,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:11,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:11,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:46:11,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:11,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:46:11,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:46:11,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:46:11,211 INFO L87 Difference]: Start difference. First operand 20032 states and 28664 transitions. Second operand 10 states. [2019-09-10 06:46:12,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:12,900 INFO L93 Difference]: Finished difference Result 51670 states and 73253 transitions. [2019-09-10 06:46:12,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:46:12,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-10 06:46:12,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:12,962 INFO L225 Difference]: With dead ends: 51670 [2019-09-10 06:46:12,963 INFO L226 Difference]: Without dead ends: 51670 [2019-09-10 06:46:12,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:46:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51670 states. [2019-09-10 06:46:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51670 to 19835. [2019-09-10 06:46:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19835 states. [2019-09-10 06:46:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19835 states to 19835 states and 28397 transitions. [2019-09-10 06:46:13,982 INFO L78 Accepts]: Start accepts. Automaton has 19835 states and 28397 transitions. Word has length 66 [2019-09-10 06:46:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:13,982 INFO L475 AbstractCegarLoop]: Abstraction has 19835 states and 28397 transitions. [2019-09-10 06:46:13,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:46:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 19835 states and 28397 transitions. [2019-09-10 06:46:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:46:13,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:13,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:13,988 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1562834592, now seen corresponding path program 1 times [2019-09-10 06:46:13,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:13,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:13,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:13,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:13,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:14,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:14,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:46:14,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:14,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:46:14,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:46:14,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:46:14,181 INFO L87 Difference]: Start difference. First operand 19835 states and 28397 transitions. Second operand 10 states. [2019-09-10 06:46:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:16,119 INFO L93 Difference]: Finished difference Result 51225 states and 72647 transitions. [2019-09-10 06:46:16,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:46:16,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-10 06:46:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:16,175 INFO L225 Difference]: With dead ends: 51225 [2019-09-10 06:46:16,175 INFO L226 Difference]: Without dead ends: 51225 [2019-09-10 06:46:16,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:46:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51225 states. [2019-09-10 06:46:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51225 to 19629. [2019-09-10 06:46:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19629 states. [2019-09-10 06:46:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19629 states to 19629 states and 28096 transitions. [2019-09-10 06:46:16,632 INFO L78 Accepts]: Start accepts. Automaton has 19629 states and 28096 transitions. Word has length 66 [2019-09-10 06:46:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:16,632 INFO L475 AbstractCegarLoop]: Abstraction has 19629 states and 28096 transitions. [2019-09-10 06:46:16,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:46:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 19629 states and 28096 transitions. [2019-09-10 06:46:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:46:16,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:16,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:16,638 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1195976158, now seen corresponding path program 1 times [2019-09-10 06:46:16,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:16,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:16,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:16,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:16,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:16,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:16,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:46:16,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:16,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:46:16,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:46:16,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:46:16,810 INFO L87 Difference]: Start difference. First operand 19629 states and 28096 transitions. Second operand 10 states. [2019-09-10 06:46:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:19,236 INFO L93 Difference]: Finished difference Result 87495 states and 123779 transitions. [2019-09-10 06:46:19,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:46:19,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-10 06:46:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:19,321 INFO L225 Difference]: With dead ends: 87495 [2019-09-10 06:46:19,321 INFO L226 Difference]: Without dead ends: 87495 [2019-09-10 06:46:19,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:46:19,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87495 states. [2019-09-10 06:46:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87495 to 19379. [2019-09-10 06:46:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19379 states. [2019-09-10 06:46:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19379 states to 19379 states and 27737 transitions. [2019-09-10 06:46:19,943 INFO L78 Accepts]: Start accepts. Automaton has 19379 states and 27737 transitions. Word has length 66 [2019-09-10 06:46:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:19,943 INFO L475 AbstractCegarLoop]: Abstraction has 19379 states and 27737 transitions. [2019-09-10 06:46:19,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:46:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 19379 states and 27737 transitions. [2019-09-10 06:46:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:46:19,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:19,946 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:19,946 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:19,946 INFO L82 PathProgramCache]: Analyzing trace with hash -22489909, now seen corresponding path program 1 times [2019-09-10 06:46:19,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:19,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:19,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:19,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:19,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:20,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:20,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:20,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:20,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:20,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:20,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:20,005 INFO L87 Difference]: Start difference. First operand 19379 states and 27737 transitions. Second operand 3 states. [2019-09-10 06:46:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:20,066 INFO L93 Difference]: Finished difference Result 19381 states and 27297 transitions. [2019-09-10 06:46:20,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:20,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:46:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:20,087 INFO L225 Difference]: With dead ends: 19381 [2019-09-10 06:46:20,087 INFO L226 Difference]: Without dead ends: 19381 [2019-09-10 06:46:20,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19381 states. [2019-09-10 06:46:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19381 to 19379. [2019-09-10 06:46:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19379 states. [2019-09-10 06:46:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19379 states to 19379 states and 27296 transitions. [2019-09-10 06:46:20,282 INFO L78 Accepts]: Start accepts. Automaton has 19379 states and 27296 transitions. Word has length 67 [2019-09-10 06:46:20,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:20,282 INFO L475 AbstractCegarLoop]: Abstraction has 19379 states and 27296 transitions. [2019-09-10 06:46:20,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:20,283 INFO L276 IsEmpty]: Start isEmpty. Operand 19379 states and 27296 transitions. [2019-09-10 06:46:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:46:20,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:20,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:20,287 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash 910047089, now seen corresponding path program 1 times [2019-09-10 06:46:20,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:20,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:20,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:20,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:20,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:20,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:20,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:20,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:20,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:20,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:20,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:20,343 INFO L87 Difference]: Start difference. First operand 19379 states and 27296 transitions. Second operand 3 states. [2019-09-10 06:46:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:20,402 INFO L93 Difference]: Finished difference Result 17626 states and 24409 transitions. [2019-09-10 06:46:20,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:20,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:46:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:20,419 INFO L225 Difference]: With dead ends: 17626 [2019-09-10 06:46:20,419 INFO L226 Difference]: Without dead ends: 17626 [2019-09-10 06:46:20,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17626 states. [2019-09-10 06:46:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17626 to 17624. [2019-09-10 06:46:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17624 states. [2019-09-10 06:46:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17624 states to 17624 states and 24408 transitions. [2019-09-10 06:46:20,536 INFO L78 Accepts]: Start accepts. Automaton has 17624 states and 24408 transitions. Word has length 67 [2019-09-10 06:46:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:20,537 INFO L475 AbstractCegarLoop]: Abstraction has 17624 states and 24408 transitions. [2019-09-10 06:46:20,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 17624 states and 24408 transitions. [2019-09-10 06:46:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:46:20,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:20,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:20,540 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:20,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:20,541 INFO L82 PathProgramCache]: Analyzing trace with hash 807080215, now seen corresponding path program 1 times [2019-09-10 06:46:20,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:20,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:20,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:20,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:20,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:20,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:20,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:20,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:20,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:20,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:20,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:20,588 INFO L87 Difference]: Start difference. First operand 17624 states and 24408 transitions. Second operand 3 states. [2019-09-10 06:46:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:20,648 INFO L93 Difference]: Finished difference Result 13819 states and 18800 transitions. [2019-09-10 06:46:20,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:20,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:46:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:20,663 INFO L225 Difference]: With dead ends: 13819 [2019-09-10 06:46:20,664 INFO L226 Difference]: Without dead ends: 13819 [2019-09-10 06:46:20,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13819 states. [2019-09-10 06:46:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13819 to 13817. [2019-09-10 06:46:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13817 states. [2019-09-10 06:46:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13817 states to 13817 states and 18799 transitions. [2019-09-10 06:46:20,865 INFO L78 Accepts]: Start accepts. Automaton has 13817 states and 18799 transitions. Word has length 67 [2019-09-10 06:46:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:20,865 INFO L475 AbstractCegarLoop]: Abstraction has 13817 states and 18799 transitions. [2019-09-10 06:46:20,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 13817 states and 18799 transitions. [2019-09-10 06:46:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:46:20,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:20,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:20,870 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:20,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:20,871 INFO L82 PathProgramCache]: Analyzing trace with hash 951021968, now seen corresponding path program 1 times [2019-09-10 06:46:20,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:20,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:20,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:20,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:20,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:21,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:21,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:46:21,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:21,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:46:21,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:46:21,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:46:21,675 INFO L87 Difference]: Start difference. First operand 13817 states and 18799 transitions. Second operand 17 states. [2019-09-10 06:46:22,226 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 06:46:22,394 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 06:46:22,706 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-09-10 06:46:22,978 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-10 06:46:23,133 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:46:23,324 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:46:23,515 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 06:46:23,729 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 06:46:23,986 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 06:46:26,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:26,062 INFO L93 Difference]: Finished difference Result 37169 states and 50734 transitions. [2019-09-10 06:46:26,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:46:26,063 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-09-10 06:46:26,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:26,095 INFO L225 Difference]: With dead ends: 37169 [2019-09-10 06:46:26,096 INFO L226 Difference]: Without dead ends: 37169 [2019-09-10 06:46:26,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:46:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37169 states. [2019-09-10 06:46:26,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37169 to 13737. [2019-09-10 06:46:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13737 states. [2019-09-10 06:46:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13737 states to 13737 states and 18691 transitions. [2019-09-10 06:46:26,328 INFO L78 Accepts]: Start accepts. Automaton has 13737 states and 18691 transitions. Word has length 68 [2019-09-10 06:46:26,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:26,328 INFO L475 AbstractCegarLoop]: Abstraction has 13737 states and 18691 transitions. [2019-09-10 06:46:26,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:46:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 13737 states and 18691 transitions. [2019-09-10 06:46:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:46:26,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:26,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:26,331 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:26,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:26,332 INFO L82 PathProgramCache]: Analyzing trace with hash 313084076, now seen corresponding path program 1 times [2019-09-10 06:46:26,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:26,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:26,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:26,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:26,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:27,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:27,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:46:27,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:27,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:46:27,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:46:27,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:46:27,216 INFO L87 Difference]: Start difference. First operand 13737 states and 18691 transitions. Second operand 16 states. [2019-09-10 06:46:27,554 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-09-10 06:46:27,707 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 06:46:27,938 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 06:46:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:29,702 INFO L93 Difference]: Finished difference Result 25427 states and 34767 transitions. [2019-09-10 06:46:29,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:46:29,703 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-09-10 06:46:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:29,727 INFO L225 Difference]: With dead ends: 25427 [2019-09-10 06:46:29,727 INFO L226 Difference]: Without dead ends: 25427 [2019-09-10 06:46:29,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:46:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25427 states. [2019-09-10 06:46:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25427 to 13624. [2019-09-10 06:46:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13624 states. [2019-09-10 06:46:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13624 states to 13624 states and 18539 transitions. [2019-09-10 06:46:29,860 INFO L78 Accepts]: Start accepts. Automaton has 13624 states and 18539 transitions. Word has length 68 [2019-09-10 06:46:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:29,861 INFO L475 AbstractCegarLoop]: Abstraction has 13624 states and 18539 transitions. [2019-09-10 06:46:29,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:46:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 13624 states and 18539 transitions. [2019-09-10 06:46:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:46:29,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:29,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:29,864 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:29,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:29,864 INFO L82 PathProgramCache]: Analyzing trace with hash 717078376, now seen corresponding path program 1 times [2019-09-10 06:46:29,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:29,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:29,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:29,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:29,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:29,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:29,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:29,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:29,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:29,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:29,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:29,907 INFO L87 Difference]: Start difference. First operand 13624 states and 18539 transitions. Second operand 3 states. [2019-09-10 06:46:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:29,988 INFO L93 Difference]: Finished difference Result 20187 states and 27510 transitions. [2019-09-10 06:46:29,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:29,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:46:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:30,015 INFO L225 Difference]: With dead ends: 20187 [2019-09-10 06:46:30,015 INFO L226 Difference]: Without dead ends: 20187 [2019-09-10 06:46:30,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:30,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20187 states. [2019-09-10 06:46:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20187 to 13481. [2019-09-10 06:46:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13481 states. [2019-09-10 06:46:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13481 states to 13481 states and 18320 transitions. [2019-09-10 06:46:30,268 INFO L78 Accepts]: Start accepts. Automaton has 13481 states and 18320 transitions. Word has length 68 [2019-09-10 06:46:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:30,268 INFO L475 AbstractCegarLoop]: Abstraction has 13481 states and 18320 transitions. [2019-09-10 06:46:30,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 13481 states and 18320 transitions. [2019-09-10 06:46:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:46:30,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:30,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:30,272 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:30,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:30,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1369153575, now seen corresponding path program 1 times [2019-09-10 06:46:30,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:30,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:30,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:30,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:30,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:30,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:30,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:30,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:30,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:30,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:30,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:30,313 INFO L87 Difference]: Start difference. First operand 13481 states and 18320 transitions. Second operand 3 states. [2019-09-10 06:46:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:30,402 INFO L93 Difference]: Finished difference Result 19965 states and 27172 transitions. [2019-09-10 06:46:30,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:30,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:46:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:30,427 INFO L225 Difference]: With dead ends: 19965 [2019-09-10 06:46:30,427 INFO L226 Difference]: Without dead ends: 19965 [2019-09-10 06:46:30,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19965 states. [2019-09-10 06:46:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19965 to 13259. [2019-09-10 06:46:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13259 states. [2019-09-10 06:46:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13259 states to 13259 states and 18002 transitions. [2019-09-10 06:46:30,583 INFO L78 Accepts]: Start accepts. Automaton has 13259 states and 18002 transitions. Word has length 68 [2019-09-10 06:46:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:30,584 INFO L475 AbstractCegarLoop]: Abstraction has 13259 states and 18002 transitions. [2019-09-10 06:46:30,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 13259 states and 18002 transitions. [2019-09-10 06:46:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:46:30,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:30,587 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 06:46:30,587 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:30,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:30,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1358366886, now seen corresponding path program 1 times [2019-09-10 06:46:30,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:30,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:30,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:30,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:30,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:30,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:30,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:46:30,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:30,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:46:30,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:46:30,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:30,653 INFO L87 Difference]: Start difference. First operand 13259 states and 18002 transitions. Second operand 5 states. [2019-09-10 06:46:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:30,743 INFO L93 Difference]: Finished difference Result 12399 states and 16859 transitions. [2019-09-10 06:46:30,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:30,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-09-10 06:46:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:30,757 INFO L225 Difference]: With dead ends: 12399 [2019-09-10 06:46:30,757 INFO L226 Difference]: Without dead ends: 12399 [2019-09-10 06:46:30,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12399 states. [2019-09-10 06:46:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12399 to 12395. [2019-09-10 06:46:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12395 states. [2019-09-10 06:46:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12395 states to 12395 states and 16857 transitions. [2019-09-10 06:46:30,919 INFO L78 Accepts]: Start accepts. Automaton has 12395 states and 16857 transitions. Word has length 73 [2019-09-10 06:46:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:30,919 INFO L475 AbstractCegarLoop]: Abstraction has 12395 states and 16857 transitions. [2019-09-10 06:46:30,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:46:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 12395 states and 16857 transitions. [2019-09-10 06:46:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:46:30,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:30,924 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:30,924 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash -168810636, now seen corresponding path program 1 times [2019-09-10 06:46:30,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:30,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:30,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:30,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:30,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:31,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:31,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:46:31,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:31,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:46:31,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:46:31,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:46:31,033 INFO L87 Difference]: Start difference. First operand 12395 states and 16857 transitions. Second operand 6 states. [2019-09-10 06:46:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:31,208 INFO L93 Difference]: Finished difference Result 23402 states and 31285 transitions. [2019-09-10 06:46:31,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:46:31,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 06:46:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:31,241 INFO L225 Difference]: With dead ends: 23402 [2019-09-10 06:46:31,241 INFO L226 Difference]: Without dead ends: 23402 [2019-09-10 06:46:31,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:46:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23402 states. [2019-09-10 06:46:31,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23402 to 12794. [2019-09-10 06:46:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12794 states. [2019-09-10 06:46:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12794 states to 12794 states and 17147 transitions. [2019-09-10 06:46:31,477 INFO L78 Accepts]: Start accepts. Automaton has 12794 states and 17147 transitions. Word has length 76 [2019-09-10 06:46:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:31,477 INFO L475 AbstractCegarLoop]: Abstraction has 12794 states and 17147 transitions. [2019-09-10 06:46:31,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:46:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 12794 states and 17147 transitions. [2019-09-10 06:46:31,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:46:31,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:31,482 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 06:46:31,482 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:31,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1576523007, now seen corresponding path program 1 times [2019-09-10 06:46:31,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:31,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:31,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:31,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:31,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:31,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:31,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:31,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:31,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:31,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:31,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:31,536 INFO L87 Difference]: Start difference. First operand 12794 states and 17147 transitions. Second operand 3 states. [2019-09-10 06:46:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:31,616 INFO L93 Difference]: Finished difference Result 23523 states and 31113 transitions. [2019-09-10 06:46:31,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:31,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:46:31,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:31,646 INFO L225 Difference]: With dead ends: 23523 [2019-09-10 06:46:31,646 INFO L226 Difference]: Without dead ends: 23523 [2019-09-10 06:46:31,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23523 states. [2019-09-10 06:46:31,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23523 to 21813. [2019-09-10 06:46:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21813 states. [2019-09-10 06:46:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21813 states to 21813 states and 28970 transitions. [2019-09-10 06:46:31,862 INFO L78 Accepts]: Start accepts. Automaton has 21813 states and 28970 transitions. Word has length 77 [2019-09-10 06:46:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:31,862 INFO L475 AbstractCegarLoop]: Abstraction has 21813 states and 28970 transitions. [2019-09-10 06:46:31,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 21813 states and 28970 transitions. [2019-09-10 06:46:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:46:31,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:31,865 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] [2019-09-10 06:46:31,865 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:31,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:31,866 INFO L82 PathProgramCache]: Analyzing trace with hash 175965857, now seen corresponding path program 1 times [2019-09-10 06:46:31,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:31,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:31,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:31,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:31,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:31,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:31,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:31,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:31,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:31,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:31,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:31,905 INFO L87 Difference]: Start difference. First operand 21813 states and 28970 transitions. Second operand 3 states. [2019-09-10 06:46:31,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:31,995 INFO L93 Difference]: Finished difference Result 32445 states and 42709 transitions. [2019-09-10 06:46:31,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:31,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:46:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:32,035 INFO L225 Difference]: With dead ends: 32445 [2019-09-10 06:46:32,035 INFO L226 Difference]: Without dead ends: 32445 [2019-09-10 06:46:32,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32445 states. [2019-09-10 06:46:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32445 to 32443. [2019-09-10 06:46:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32443 states. [2019-09-10 06:46:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32443 states to 32443 states and 42708 transitions. [2019-09-10 06:46:32,438 INFO L78 Accepts]: Start accepts. Automaton has 32443 states and 42708 transitions. Word has length 78 [2019-09-10 06:46:32,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:32,438 INFO L475 AbstractCegarLoop]: Abstraction has 32443 states and 42708 transitions. [2019-09-10 06:46:32,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 32443 states and 42708 transitions. [2019-09-10 06:46:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 06:46:32,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:32,443 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, 1, 1, 1, 1, 1] [2019-09-10 06:46:32,443 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:32,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:32,444 INFO L82 PathProgramCache]: Analyzing trace with hash -847980887, now seen corresponding path program 1 times [2019-09-10 06:46:32,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:32,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:32,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:32,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:32,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:32,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 06:46:32,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:32,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:46:32,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:32,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:46:32,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:46:32,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:32,497 INFO L87 Difference]: Start difference. First operand 32443 states and 42708 transitions. Second operand 5 states. [2019-09-10 06:46:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:32,989 INFO L93 Difference]: Finished difference Result 110354 states and 141532 transitions. [2019-09-10 06:46:32,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:46:32,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 06:46:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:33,099 INFO L225 Difference]: With dead ends: 110354 [2019-09-10 06:46:33,100 INFO L226 Difference]: Without dead ends: 110354 [2019-09-10 06:46:33,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:46:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110354 states. [2019-09-10 06:46:33,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110354 to 64823. [2019-09-10 06:46:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64823 states. [2019-09-10 06:46:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64823 states to 64823 states and 85110 transitions. [2019-09-10 06:46:33,743 INFO L78 Accepts]: Start accepts. Automaton has 64823 states and 85110 transitions. Word has length 86 [2019-09-10 06:46:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:33,743 INFO L475 AbstractCegarLoop]: Abstraction has 64823 states and 85110 transitions. [2019-09-10 06:46:33,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:46:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 64823 states and 85110 transitions. [2019-09-10 06:46:33,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 06:46:33,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:33,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:33,750 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:33,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:33,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1083848738, now seen corresponding path program 1 times [2019-09-10 06:46:33,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:33,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:33,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:33,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:33,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:33,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:33,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:46:33,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:33,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:46:33,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:46:33,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:33,802 INFO L87 Difference]: Start difference. First operand 64823 states and 85110 transitions. Second operand 5 states. [2019-09-10 06:46:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:34,555 INFO L93 Difference]: Finished difference Result 129860 states and 165259 transitions. [2019-09-10 06:46:34,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:46:34,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-10 06:46:34,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:34,683 INFO L225 Difference]: With dead ends: 129860 [2019-09-10 06:46:34,683 INFO L226 Difference]: Without dead ends: 129860 [2019-09-10 06:46:34,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:46:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129860 states. [2019-09-10 06:46:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129860 to 83693. [2019-09-10 06:46:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83693 states. [2019-09-10 06:46:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83693 states to 83693 states and 107669 transitions. [2019-09-10 06:46:35,482 INFO L78 Accepts]: Start accepts. Automaton has 83693 states and 107669 transitions. Word has length 92 [2019-09-10 06:46:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:35,482 INFO L475 AbstractCegarLoop]: Abstraction has 83693 states and 107669 transitions. [2019-09-10 06:46:35,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:46:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 83693 states and 107669 transitions. [2019-09-10 06:46:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:46:35,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:35,496 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:35,496 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:35,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:35,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1080560380, now seen corresponding path program 1 times [2019-09-10 06:46:35,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:35,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:35,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:35,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:35,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:46:35,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:35,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:35,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:35,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:35,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:35,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:35,560 INFO L87 Difference]: Start difference. First operand 83693 states and 107669 transitions. Second operand 3 states. [2019-09-10 06:46:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:35,924 INFO L93 Difference]: Finished difference Result 157835 states and 198246 transitions. [2019-09-10 06:46:35,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:35,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:46:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:36,084 INFO L225 Difference]: With dead ends: 157835 [2019-09-10 06:46:36,085 INFO L226 Difference]: Without dead ends: 157835 [2019-09-10 06:46:36,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157835 states. [2019-09-10 06:46:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157835 to 113319. [2019-09-10 06:46:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113319 states. [2019-09-10 06:46:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113319 states to 113319 states and 142971 transitions. [2019-09-10 06:46:38,946 INFO L78 Accepts]: Start accepts. Automaton has 113319 states and 142971 transitions. Word has length 97 [2019-09-10 06:46:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:38,946 INFO L475 AbstractCegarLoop]: Abstraction has 113319 states and 142971 transitions. [2019-09-10 06:46:38,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 113319 states and 142971 transitions. [2019-09-10 06:46:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:46:38,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:38,958 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:38,958 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:38,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:38,958 INFO L82 PathProgramCache]: Analyzing trace with hash 143028520, now seen corresponding path program 1 times [2019-09-10 06:46:38,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:38,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:38,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:39,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:39,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:39,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:39,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:39,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:39,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:39,017 INFO L87 Difference]: Start difference. First operand 113319 states and 142971 transitions. Second operand 3 states. [2019-09-10 06:46:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:39,429 INFO L93 Difference]: Finished difference Result 140807 states and 172410 transitions. [2019-09-10 06:46:39,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:39,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:46:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:39,627 INFO L225 Difference]: With dead ends: 140807 [2019-09-10 06:46:39,627 INFO L226 Difference]: Without dead ends: 140807 [2019-09-10 06:46:39,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140807 states. [2019-09-10 06:46:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140807 to 120429. [2019-09-10 06:46:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120429 states. [2019-09-10 06:46:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120429 states to 120429 states and 149119 transitions. [2019-09-10 06:46:43,052 INFO L78 Accepts]: Start accepts. Automaton has 120429 states and 149119 transitions. Word has length 98 [2019-09-10 06:46:43,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:43,052 INFO L475 AbstractCegarLoop]: Abstraction has 120429 states and 149119 transitions. [2019-09-10 06:46:43,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 120429 states and 149119 transitions. [2019-09-10 06:46:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:46:43,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:43,061 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] [2019-09-10 06:46:43,061 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:43,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:43,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1368780627, now seen corresponding path program 1 times [2019-09-10 06:46:43,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:43,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:43,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:43,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:43,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:43,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:43,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:46:43,163 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-10 06:46:43,165 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [317], [322], [335], [337], [350], [358], [377], [388], [390], [403], [411], [430], [443], [446], [449], [452], [454], [456], [498], [508], [522], [531], [547], [552], [568], [611], [612], [616], [617], [618] [2019-09-10 06:46:43,215 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:46:43,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:46:43,330 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:46:43,689 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:46:43,692 INFO L272 AbstractInterpreter]: Visited 95 different actions 334 times. Merged at 31 different actions 209 times. Widened at 10 different actions 26 times. Performed 1281 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1281 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 8 different actions. Largest state had 123 variables. [2019-09-10 06:46:43,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:43,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:46:43,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:43,698 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 06:46:43,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:43,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:46:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:43,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:46:43,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:46:43,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:44,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:44,882 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:46:45,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:45,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:46:45,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 11] total 24 [2019-09-10 06:46:45,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:46:45,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:46:45,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:46:45,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:46:45,225 INFO L87 Difference]: Start difference. First operand 120429 states and 149119 transitions. Second operand 15 states. [2019-09-10 06:46:45,363 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 06:46:48,063 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 06:46:48,774 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-09-10 06:46:49,287 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-09-10 06:46:49,457 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:46:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:54,352 INFO L93 Difference]: Finished difference Result 292588 states and 361432 transitions. [2019-09-10 06:46:54,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:46:54,352 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 101 [2019-09-10 06:46:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:54,955 INFO L225 Difference]: With dead ends: 292588 [2019-09-10 06:46:54,955 INFO L226 Difference]: Without dead ends: 292588 [2019-09-10 06:46:54,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 172 SyntacticMatches, 12 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=414, Invalid=1748, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:46:55,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292588 states. [2019-09-10 06:47:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292588 to 163881. [2019-09-10 06:47:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163881 states. [2019-09-10 06:47:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163881 states to 163881 states and 203040 transitions. [2019-09-10 06:47:00,488 INFO L78 Accepts]: Start accepts. Automaton has 163881 states and 203040 transitions. Word has length 101 [2019-09-10 06:47:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:00,488 INFO L475 AbstractCegarLoop]: Abstraction has 163881 states and 203040 transitions. [2019-09-10 06:47:00,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:47:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 163881 states and 203040 transitions. [2019-09-10 06:47:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:47:00,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:00,515 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, 1, 1, 1] [2019-09-10 06:47:00,515 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:00,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash -498710089, now seen corresponding path program 1 times [2019-09-10 06:47:00,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:00,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:00,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:00,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:00,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:47:00,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:00,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:47:00,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:00,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:47:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:47:00,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:47:00,580 INFO L87 Difference]: Start difference. First operand 163881 states and 203040 transitions. Second operand 4 states. [2019-09-10 06:47:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:01,279 INFO L93 Difference]: Finished difference Result 267052 states and 330678 transitions. [2019-09-10 06:47:01,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:01,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-10 06:47:01,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:01,641 INFO L225 Difference]: With dead ends: 267052 [2019-09-10 06:47:01,641 INFO L226 Difference]: Without dead ends: 267052 [2019-09-10 06:47:01,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:01,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267052 states. [2019-09-10 06:47:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267052 to 163349. [2019-09-10 06:47:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163349 states. [2019-09-10 06:47:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163349 states to 163349 states and 202413 transitions. [2019-09-10 06:47:04,068 INFO L78 Accepts]: Start accepts. Automaton has 163349 states and 202413 transitions. Word has length 111 [2019-09-10 06:47:04,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:04,068 INFO L475 AbstractCegarLoop]: Abstraction has 163349 states and 202413 transitions. [2019-09-10 06:47:04,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:47:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 163349 states and 202413 transitions. [2019-09-10 06:47:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:47:04,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:04,078 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, 1, 1, 1] [2019-09-10 06:47:04,079 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:04,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:04,079 INFO L82 PathProgramCache]: Analyzing trace with hash 767120476, now seen corresponding path program 1 times [2019-09-10 06:47:04,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:04,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:04,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:04,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:04,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:47:04,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:04,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:47:04,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:47:04,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:04,140 INFO L87 Difference]: Start difference. First operand 163349 states and 202413 transitions. Second operand 5 states. [2019-09-10 06:47:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:04,966 INFO L93 Difference]: Finished difference Result 193832 states and 236209 transitions. [2019-09-10 06:47:04,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:47:04,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-10 06:47:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:05,235 INFO L225 Difference]: With dead ends: 193832 [2019-09-10 06:47:05,236 INFO L226 Difference]: Without dead ends: 193832 [2019-09-10 06:47:05,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:47:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193832 states. [2019-09-10 06:47:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193832 to 159025. [2019-09-10 06:47:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159025 states. [2019-09-10 06:47:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159025 states to 159025 states and 194618 transitions. [2019-09-10 06:47:09,934 INFO L78 Accepts]: Start accepts. Automaton has 159025 states and 194618 transitions. Word has length 111 [2019-09-10 06:47:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:09,934 INFO L475 AbstractCegarLoop]: Abstraction has 159025 states and 194618 transitions. [2019-09-10 06:47:09,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 159025 states and 194618 transitions. [2019-09-10 06:47:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:47:09,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:09,947 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, 1, 1, 1, 1, 1] [2019-09-10 06:47:09,947 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1656308014, now seen corresponding path program 1 times [2019-09-10 06:47:09,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:09,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:09,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:09,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:10,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:10,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:47:10,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:10,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:47:10,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:47:10,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:47:10,220 INFO L87 Difference]: Start difference. First operand 159025 states and 194618 transitions. Second operand 10 states. [2019-09-10 06:47:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:12,620 INFO L93 Difference]: Finished difference Result 429544 states and 520919 transitions. [2019-09-10 06:47:12,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:47:12,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-09-10 06:47:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:14,143 INFO L225 Difference]: With dead ends: 429544 [2019-09-10 06:47:14,143 INFO L226 Difference]: Without dead ends: 429544 [2019-09-10 06:47:14,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:47:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429544 states. [2019-09-10 06:47:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429544 to 210901. [2019-09-10 06:47:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210901 states. [2019-09-10 06:47:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210901 states to 210901 states and 257657 transitions. [2019-09-10 06:47:21,035 INFO L78 Accepts]: Start accepts. Automaton has 210901 states and 257657 transitions. Word has length 113 [2019-09-10 06:47:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:21,036 INFO L475 AbstractCegarLoop]: Abstraction has 210901 states and 257657 transitions. [2019-09-10 06:47:21,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:47:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand 210901 states and 257657 transitions. [2019-09-10 06:47:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:47:21,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:21,051 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:21,051 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash 733084191, now seen corresponding path program 1 times [2019-09-10 06:47:21,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:21,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:21,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:21,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:21,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:47:21,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:21,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:47:21,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:21,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:47:21,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:47:21,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:47:21,099 INFO L87 Difference]: Start difference. First operand 210901 states and 257657 transitions. Second operand 4 states. [2019-09-10 06:47:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:22,214 INFO L93 Difference]: Finished difference Result 302852 states and 368543 transitions. [2019-09-10 06:47:22,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:22,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 06:47:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:22,600 INFO L225 Difference]: With dead ends: 302852 [2019-09-10 06:47:22,601 INFO L226 Difference]: Without dead ends: 302852 [2019-09-10 06:47:22,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302852 states. [2019-09-10 06:47:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302852 to 210673. [2019-09-10 06:47:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210673 states. [2019-09-10 06:47:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210673 states to 210673 states and 257375 transitions. [2019-09-10 06:47:25,337 INFO L78 Accepts]: Start accepts. Automaton has 210673 states and 257375 transitions. Word has length 114 [2019-09-10 06:47:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:25,338 INFO L475 AbstractCegarLoop]: Abstraction has 210673 states and 257375 transitions. [2019-09-10 06:47:25,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:47:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 210673 states and 257375 transitions. [2019-09-10 06:47:25,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:47:25,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:25,347 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:25,347 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:25,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:25,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1369646106, now seen corresponding path program 1 times [2019-09-10 06:47:25,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:25,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:25,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:25,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:25,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:25,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:25,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:47:25,602 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:47:25,603 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [144], [147], [149], [152], [155], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [335], [337], [350], [358], [361], [364], [367], [369], [379], [382], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [496], [522], [531], [547], [611], [612], [616], [617], [618] [2019-09-10 06:47:25,608 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:47:25,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:47:25,626 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:47:25,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:47:25,959 INFO L272 AbstractInterpreter]: Visited 109 different actions 465 times. Merged at 41 different actions 326 times. Widened at 14 different actions 51 times. Performed 1666 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1666 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 10 different actions. Largest state had 126 variables. [2019-09-10 06:47:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:25,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:47:25,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:25,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:47:25,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:25,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:47:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:26,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:47:26,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:47:26,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:26,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:26,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:26,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:26,485 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:47:26,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:26,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:26,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:26,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:26,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:26,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:26,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:26,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:27,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:47:27,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 06:47:27,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:47:27,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:47:27,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:47:27,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:47:27,006 INFO L87 Difference]: Start difference. First operand 210673 states and 257375 transitions. Second operand 22 states. [2019-09-10 06:47:30,351 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-10 06:47:33,423 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-09-10 06:47:33,760 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2019-09-10 06:47:34,060 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-09-10 06:47:34,517 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-09-10 06:47:35,176 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-09-10 06:47:35,353 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-09-10 06:47:35,581 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-09-10 06:47:36,078 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2019-09-10 06:47:36,490 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-09-10 06:47:36,666 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-09-10 06:47:37,100 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-09-10 06:47:37,295 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-09-10 06:47:37,526 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-09-10 06:47:37,720 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 43 [2019-09-10 06:47:38,082 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-09-10 06:47:38,254 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2019-09-10 06:47:38,433 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 45 [2019-09-10 06:47:38,666 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-09-10 06:47:39,059 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-09-10 06:47:39,222 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-09-10 06:47:39,620 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-09-10 06:47:39,836 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-09-10 06:47:40,130 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 06:47:40,294 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-09-10 06:47:41,267 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-09-10 06:47:41,687 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-09-10 06:47:41,895 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-09-10 06:47:42,333 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-09-10 06:47:42,708 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-10 06:47:42,878 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-09-10 06:47:43,078 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-09-10 06:47:43,284 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-09-10 06:47:43,713 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-10 06:47:43,905 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 06:47:44,334 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2019-09-10 06:47:44,495 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2019-09-10 06:47:44,777 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-10 06:47:44,986 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-10 06:47:45,480 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2019-09-10 06:47:45,654 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2019-09-10 06:47:46,327 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 06:47:46,484 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2019-09-10 06:47:46,802 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-09-10 06:47:46,971 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-09-10 06:47:47,491 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-09-10 06:47:47,700 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-09-10 06:47:48,051 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-09-10 06:47:48,397 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-09-10 06:47:48,570 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-10 06:47:48,767 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-09-10 06:47:48,978 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-09-10 06:47:49,209 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-09-10 06:47:50,103 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-10 06:47:50,298 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 06:47:50,463 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-09-10 06:47:50,794 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-09-10 06:47:51,060 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 06:47:51,303 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-09-10 06:47:51,554 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 06:47:51,727 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-09-10 06:47:52,108 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-09-10 06:47:52,296 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-09-10 06:47:52,492 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-09-10 06:47:54,262 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2019-09-10 06:47:54,497 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2019-09-10 06:47:54,689 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-10 06:47:55,524 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2019-09-10 06:47:55,749 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2019-09-10 06:47:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:57,809 INFO L93 Difference]: Finished difference Result 720076 states and 862691 transitions. [2019-09-10 06:47:57,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-10 06:47:57,810 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 114 [2019-09-10 06:47:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:58,938 INFO L225 Difference]: With dead ends: 720076 [2019-09-10 06:47:58,939 INFO L226 Difference]: Without dead ends: 720076 [2019-09-10 06:47:58,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8863 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=5368, Invalid=22688, Unknown=0, NotChecked=0, Total=28056 [2019-09-10 06:48:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720076 states. [2019-09-10 06:48:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720076 to 278347. [2019-09-10 06:48:05,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278347 states. [2019-09-10 06:48:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278347 states to 278347 states and 338933 transitions. [2019-09-10 06:48:06,093 INFO L78 Accepts]: Start accepts. Automaton has 278347 states and 338933 transitions. Word has length 114 [2019-09-10 06:48:06,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:06,093 INFO L475 AbstractCegarLoop]: Abstraction has 278347 states and 338933 transitions. [2019-09-10 06:48:06,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:48:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 278347 states and 338933 transitions. [2019-09-10 06:48:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:48:06,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:06,104 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:06,104 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:06,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash -491135301, now seen corresponding path program 1 times [2019-09-10 06:48:06,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:06,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:06,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:06,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:06,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:06,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:06,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:48:06,293 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:48:06,295 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [144], [149], [152], [155], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [206], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [335], [337], [350], [358], [361], [364], [367], [369], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [496], [501], [504], [522], [531], [547], [611], [612], [616], [617], [618] [2019-09-10 06:48:06,303 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:48:06,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:48:06,322 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:48:06,653 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:48:06,654 INFO L272 AbstractInterpreter]: Visited 109 different actions 522 times. Merged at 40 different actions 380 times. Widened at 15 different actions 70 times. Performed 1856 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1856 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 11 different actions. Largest state had 126 variables. [2019-09-10 06:48:06,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:06,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:48:06,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:06,655 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 06:48:06,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:06,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:48:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:06,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:48:06,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:48:06,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:07,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:07,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:48:07,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:07,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:48:07,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 25 [2019-09-10 06:48:07,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:48:07,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:48:07,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:48:07,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:48:07,968 INFO L87 Difference]: Start difference. First operand 278347 states and 338933 transitions. Second operand 20 states. [2019-09-10 06:48:09,545 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-10 06:48:10,382 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 06:48:11,036 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 06:48:11,372 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 06:48:11,770 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:48:13,063 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:48:13,628 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 06:48:14,086 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:48:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:18,195 INFO L93 Difference]: Finished difference Result 508789 states and 611102 transitions. [2019-09-10 06:48:18,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:48:18,195 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 114 [2019-09-10 06:48:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:18,756 INFO L225 Difference]: With dead ends: 508789 [2019-09-10 06:48:18,756 INFO L226 Difference]: Without dead ends: 508789 [2019-09-10 06:48:18,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 203 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=708, Invalid=2262, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 06:48:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508789 states. [2019-09-10 06:48:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508789 to 278716. [2019-09-10 06:48:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278716 states. [2019-09-10 06:48:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278716 states to 278716 states and 339383 transitions. [2019-09-10 06:48:26,315 INFO L78 Accepts]: Start accepts. Automaton has 278716 states and 339383 transitions. Word has length 114 [2019-09-10 06:48:26,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:26,315 INFO L475 AbstractCegarLoop]: Abstraction has 278716 states and 339383 transitions. [2019-09-10 06:48:26,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:48:26,316 INFO L276 IsEmpty]: Start isEmpty. Operand 278716 states and 339383 transitions. [2019-09-10 06:48:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:48:26,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:26,324 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:26,324 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:26,325 INFO L82 PathProgramCache]: Analyzing trace with hash -269638336, now seen corresponding path program 1 times [2019-09-10 06:48:26,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:26,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:26,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:26,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:26,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:27,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:27,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:48:27,271 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:48:27,271 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [133], [135], [138], [141], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [414], [417], [420], [422], [443], [446], [449], [452], [454], [456], [498], [508], [552], [568], [611], [612], [616], [617], [618] [2019-09-10 06:48:27,275 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:48:27,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:48:27,294 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:48:27,535 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:48:27,535 INFO L272 AbstractInterpreter]: Visited 109 different actions 476 times. Merged at 41 different actions 335 times. Widened at 14 different actions 50 times. Performed 1700 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1700 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 11 different actions. Largest state had 126 variables. [2019-09-10 06:48:27,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:27,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:48:27,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:27,536 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 06:48:27,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:27,550 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 06:48:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:27,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:48:27,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:48:27,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:27,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:27,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:27,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:28,065 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:48:28,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:28,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:28,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:28,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:28,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:28,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:28,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:28,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:28,531 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:48:28,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [12] total 32 [2019-09-10 06:48:28,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:28,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:48:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:48:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:48:28,532 INFO L87 Difference]: Start difference. First operand 278716 states and 339383 transitions. Second operand 12 states. [2019-09-10 06:48:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:30,580 INFO L93 Difference]: Finished difference Result 306482 states and 371846 transitions. [2019-09-10 06:48:30,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:48:30,580 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-09-10 06:48:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:30,873 INFO L225 Difference]: With dead ends: 306482 [2019-09-10 06:48:30,874 INFO L226 Difference]: Without dead ends: 306482 [2019-09-10 06:48:30,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=321, Invalid=1935, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:48:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306482 states. [2019-09-10 06:48:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306482 to 296740. [2019-09-10 06:48:37,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296740 states. [2019-09-10 06:48:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296740 states to 296740 states and 360887 transitions. [2019-09-10 06:48:37,412 INFO L78 Accepts]: Start accepts. Automaton has 296740 states and 360887 transitions. Word has length 114 [2019-09-10 06:48:37,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:37,413 INFO L475 AbstractCegarLoop]: Abstraction has 296740 states and 360887 transitions. [2019-09-10 06:48:37,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:48:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 296740 states and 360887 transitions. [2019-09-10 06:48:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:48:37,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:37,421 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:37,421 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:37,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:37,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1287782089, now seen corresponding path program 1 times [2019-09-10 06:48:37,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:37,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:37,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:37,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:37,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:48:37,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:37,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:37,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:37,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:37,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:37,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:37,461 INFO L87 Difference]: Start difference. First operand 296740 states and 360887 transitions. Second operand 3 states. [2019-09-10 06:48:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:39,309 INFO L93 Difference]: Finished difference Result 380703 states and 461611 transitions. [2019-09-10 06:48:39,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:39,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 06:48:39,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:39,678 INFO L225 Difference]: With dead ends: 380703 [2019-09-10 06:48:39,679 INFO L226 Difference]: Without dead ends: 380703 [2019-09-10 06:48:39,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380703 states. [2019-09-10 06:48:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380703 to 265849. [2019-09-10 06:48:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265849 states. [2019-09-10 06:48:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265849 states to 265849 states and 322722 transitions. [2019-09-10 06:48:49,202 INFO L78 Accepts]: Start accepts. Automaton has 265849 states and 322722 transitions. Word has length 114 [2019-09-10 06:48:49,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:49,202 INFO L475 AbstractCegarLoop]: Abstraction has 265849 states and 322722 transitions. [2019-09-10 06:48:49,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 265849 states and 322722 transitions. [2019-09-10 06:48:49,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:48:49,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:49,211 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:49,211 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:49,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:49,211 INFO L82 PathProgramCache]: Analyzing trace with hash 924700564, now seen corresponding path program 1 times [2019-09-10 06:48:49,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:49,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:49,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:49,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:49,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:48:49,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:49,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:48:49,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:49,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:48:49,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:48:49,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:48:49,265 INFO L87 Difference]: Start difference. First operand 265849 states and 322722 transitions. Second operand 4 states. [2019-09-10 06:48:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:51,130 INFO L93 Difference]: Finished difference Result 463609 states and 560856 transitions. [2019-09-10 06:48:51,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:51,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 06:48:51,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:51,605 INFO L225 Difference]: With dead ends: 463609 [2019-09-10 06:48:51,605 INFO L226 Difference]: Without dead ends: 463609 [2019-09-10 06:48:51,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:51,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463609 states. [2019-09-10 06:48:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463609 to 310760. [2019-09-10 06:48:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310760 states. [2019-09-10 06:48:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310760 states to 310760 states and 377706 transitions. [2019-09-10 06:48:58,728 INFO L78 Accepts]: Start accepts. Automaton has 310760 states and 377706 transitions. Word has length 114 [2019-09-10 06:48:58,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:58,728 INFO L475 AbstractCegarLoop]: Abstraction has 310760 states and 377706 transitions. [2019-09-10 06:48:58,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:48:58,728 INFO L276 IsEmpty]: Start isEmpty. Operand 310760 states and 377706 transitions. [2019-09-10 06:48:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:48:58,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:58,736 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:58,736 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:58,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:58,736 INFO L82 PathProgramCache]: Analyzing trace with hash -677769159, now seen corresponding path program 1 times [2019-09-10 06:48:58,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:58,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:58,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:58,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:58,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:59,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:59,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:48:59,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:59,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:48:59,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:48:59,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:48:59,007 INFO L87 Difference]: Start difference. First operand 310760 states and 377706 transitions. Second operand 12 states. [2019-09-10 06:48:59,891 WARN L188 SmtUtils]: Spent 774.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-09-10 06:49:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:02,242 INFO L93 Difference]: Finished difference Result 418213 states and 506265 transitions. [2019-09-10 06:49:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:49:02,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-09-10 06:49:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:02,697 INFO L225 Difference]: With dead ends: 418213 [2019-09-10 06:49:02,697 INFO L226 Difference]: Without dead ends: 418213 [2019-09-10 06:49:02,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:49:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418213 states. [2019-09-10 06:49:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418213 to 310521. [2019-09-10 06:49:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310521 states. [2019-09-10 06:49:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310521 states to 310521 states and 377440 transitions. [2019-09-10 06:49:12,162 INFO L78 Accepts]: Start accepts. Automaton has 310521 states and 377440 transitions. Word has length 114 [2019-09-10 06:49:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:12,162 INFO L475 AbstractCegarLoop]: Abstraction has 310521 states and 377440 transitions. [2019-09-10 06:49:12,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:49:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 310521 states and 377440 transitions. [2019-09-10 06:49:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:49:12,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:12,169 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:12,169 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:12,170 INFO L82 PathProgramCache]: Analyzing trace with hash 755737807, now seen corresponding path program 1 times [2019-09-10 06:49:12,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:12,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:12,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:12,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:12,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:12,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:49:12,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:12,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:49:12,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:49:12,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:12,223 INFO L87 Difference]: Start difference. First operand 310521 states and 377440 transitions. Second operand 3 states. [2019-09-10 06:49:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:12,993 INFO L93 Difference]: Finished difference Result 369226 states and 447581 transitions. [2019-09-10 06:49:12,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:49:12,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 06:49:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:14,483 INFO L225 Difference]: With dead ends: 369226 [2019-09-10 06:49:14,483 INFO L226 Difference]: Without dead ends: 369226 [2019-09-10 06:49:14,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369226 states. [2019-09-10 06:49:21,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369226 to 319855. [2019-09-10 06:49:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319855 states. [2019-09-10 06:49:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319855 states to 319855 states and 387810 transitions. [2019-09-10 06:49:21,890 INFO L78 Accepts]: Start accepts. Automaton has 319855 states and 387810 transitions. Word has length 115 [2019-09-10 06:49:21,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:21,890 INFO L475 AbstractCegarLoop]: Abstraction has 319855 states and 387810 transitions. [2019-09-10 06:49:21,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:49:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 319855 states and 387810 transitions. [2019-09-10 06:49:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:49:21,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:21,897 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:21,897 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1216452885, now seen corresponding path program 1 times [2019-09-10 06:49:21,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:21,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:21,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:21,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:21,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:22,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:22,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:49:22,323 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:49:22,324 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [144], [149], [152], [155], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [206], [208], [210], [213], [216], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [333], [337], [350], [358], [361], [364], [367], [369], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [496], [501], [504], [522], [531], [547], [611], [612], [616], [617], [618] [2019-09-10 06:49:22,325 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:49:22,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:49:22,346 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:49:22,642 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:49:22,642 INFO L272 AbstractInterpreter]: Visited 110 different actions 558 times. Merged at 41 different actions 414 times. Widened at 16 different actions 77 times. Performed 1976 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1976 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 13 different actions. Largest state had 126 variables. [2019-09-10 06:49:22,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:22,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:49:22,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:22,643 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:49:22,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:22,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:49:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:22,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:49:22,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:49:22,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:22,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:22,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:24,102 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:49:24,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:24,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:24,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:24,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:24,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:24,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:49:24,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 30 [2019-09-10 06:49:24,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:49:24,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:49:24,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:49:24,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:49:24,451 INFO L87 Difference]: Start difference. First operand 319855 states and 387810 transitions. Second operand 24 states. [2019-09-10 06:49:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:29,698 INFO L93 Difference]: Finished difference Result 761698 states and 915172 transitions. [2019-09-10 06:49:29,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:49:29,699 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 115 [2019-09-10 06:49:29,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:30,565 INFO L225 Difference]: With dead ends: 761698 [2019-09-10 06:49:30,565 INFO L226 Difference]: Without dead ends: 761698 [2019-09-10 06:49:30,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=368, Invalid=1702, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 06:49:31,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761698 states. [2019-09-10 06:49:42,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761698 to 319889. [2019-09-10 06:49:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319889 states. [2019-09-10 06:49:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319889 states to 319889 states and 387844 transitions. [2019-09-10 06:49:42,519 INFO L78 Accepts]: Start accepts. Automaton has 319889 states and 387844 transitions. Word has length 115 [2019-09-10 06:49:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:42,520 INFO L475 AbstractCegarLoop]: Abstraction has 319889 states and 387844 transitions. [2019-09-10 06:49:42,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:49:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 319889 states and 387844 transitions. [2019-09-10 06:49:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:49:42,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:42,526 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:42,526 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:42,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:42,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2009447844, now seen corresponding path program 1 times [2019-09-10 06:49:42,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:42,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:42,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:42,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:42,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:42,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:42,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:49:42,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:42,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:49:42,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:49:42,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:49:42,918 INFO L87 Difference]: Start difference. First operand 319889 states and 387844 transitions. Second operand 15 states. [2019-09-10 06:49:46,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:46,801 INFO L93 Difference]: Finished difference Result 425798 states and 515445 transitions. [2019-09-10 06:49:46,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:49:46,801 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2019-09-10 06:49:46,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:47,263 INFO L225 Difference]: With dead ends: 425798 [2019-09-10 06:49:47,263 INFO L226 Difference]: Without dead ends: 425798 [2019-09-10 06:49:47,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=400, Invalid=1006, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:49:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425798 states. [2019-09-10 06:49:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425798 to 334477. [2019-09-10 06:49:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334477 states. [2019-09-10 06:49:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334477 states to 334477 states and 405369 transitions. [2019-09-10 06:49:55,966 INFO L78 Accepts]: Start accepts. Automaton has 334477 states and 405369 transitions. Word has length 115 [2019-09-10 06:49:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:55,966 INFO L475 AbstractCegarLoop]: Abstraction has 334477 states and 405369 transitions. [2019-09-10 06:49:55,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:49:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 334477 states and 405369 transitions. [2019-09-10 06:49:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:49:55,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:55,972 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:55,973 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:55,973 INFO L82 PathProgramCache]: Analyzing trace with hash -238911434, now seen corresponding path program 1 times [2019-09-10 06:49:55,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:55,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:55,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:55,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:55,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:56,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:56,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:49:56,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:56,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:49:56,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:49:56,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:56,022 INFO L87 Difference]: Start difference. First operand 334477 states and 405369 transitions. Second operand 3 states. [2019-09-10 06:49:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:56,928 INFO L93 Difference]: Finished difference Result 449640 states and 540870 transitions. [2019-09-10 06:49:56,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:49:56,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 06:49:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:58,656 INFO L225 Difference]: With dead ends: 449640 [2019-09-10 06:49:58,656 INFO L226 Difference]: Without dead ends: 449640 [2019-09-10 06:49:58,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449640 states. [2019-09-10 06:50:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449640 to 328453. [2019-09-10 06:50:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328453 states. [2019-09-10 06:50:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328453 states to 328453 states and 394804 transitions. [2019-09-10 06:50:08,392 INFO L78 Accepts]: Start accepts. Automaton has 328453 states and 394804 transitions. Word has length 115 [2019-09-10 06:50:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:08,393 INFO L475 AbstractCegarLoop]: Abstraction has 328453 states and 394804 transitions. [2019-09-10 06:50:08,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:50:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 328453 states and 394804 transitions. [2019-09-10 06:50:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:50:08,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:08,399 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:08,399 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1116774600, now seen corresponding path program 1 times [2019-09-10 06:50:08,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:08,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:08,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:09,297 WARN L188 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-09-10 06:50:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:09,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:09,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:50:09,404 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:50:09,404 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [135], [138], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [259], [261], [270], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [467], [470], [473], [475], [510], [520], [573], [589], [611], [612], [616], [617], [618] [2019-09-10 06:50:09,406 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:50:09,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:50:09,422 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:50:09,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:50:09,614 INFO L272 AbstractInterpreter]: Visited 110 different actions 425 times. Merged at 41 different actions 288 times. Widened at 11 different actions 34 times. Performed 1503 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1503 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 11 different actions. Largest state had 126 variables. [2019-09-10 06:50:09,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:09,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:50:09,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:09,615 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:50:09,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:09,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:50:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:09,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:50:09,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:50:09,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:09,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:09,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:10,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:50:10,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:10,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:50:10,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 32 [2019-09-10 06:50:10,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:50:10,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:50:10,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:50:10,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:50:10,702 INFO L87 Difference]: Start difference. First operand 328453 states and 394804 transitions. Second operand 26 states. [2019-09-10 06:50:13,853 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2019-09-10 06:50:15,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:15,669 INFO L93 Difference]: Finished difference Result 527626 states and 627109 transitions. [2019-09-10 06:50:15,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:50:15,670 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 115 [2019-09-10 06:50:15,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:16,295 INFO L225 Difference]: With dead ends: 527626 [2019-09-10 06:50:16,295 INFO L226 Difference]: Without dead ends: 527626 [2019-09-10 06:50:16,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=715, Invalid=2825, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:50:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527626 states. [2019-09-10 06:50:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527626 to 352214. [2019-09-10 06:50:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352214 states. [2019-09-10 06:50:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352214 states to 352214 states and 422710 transitions. [2019-09-10 06:50:25,944 INFO L78 Accepts]: Start accepts. Automaton has 352214 states and 422710 transitions. Word has length 115 [2019-09-10 06:50:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:25,945 INFO L475 AbstractCegarLoop]: Abstraction has 352214 states and 422710 transitions. [2019-09-10 06:50:25,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:50:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 352214 states and 422710 transitions. [2019-09-10 06:50:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:50:25,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:25,953 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:25,953 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:25,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:25,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1780759166, now seen corresponding path program 1 times [2019-09-10 06:50:25,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:25,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:25,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:26,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:26,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:50:26,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 06:50:27,137 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [144], [149], [152], [155], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [333], [337], [350], [358], [361], [364], [367], [369], [379], [384], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [496], [501], [504], [522], [531], [547], [611], [612], [616], [617], [618] [2019-09-10 06:50:27,140 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:50:27,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:50:27,151 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:50:27,385 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:50:27,386 INFO L272 AbstractInterpreter]: Visited 111 different actions 463 times. Merged at 42 different actions 325 times. Widened at 15 different actions 48 times. Performed 1746 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1746 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 10 different actions. Largest state had 126 variables. [2019-09-10 06:50:27,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:27,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:50:27,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:27,387 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:50:27,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:27,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:50:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:27,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:50:27,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:50:27,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:27,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:27,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:27,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:28,821 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:50:29,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:50:29,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:50:29,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:50:29,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:50:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:29,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:50:29,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 30 [2019-09-10 06:50:29,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:50:29,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:50:29,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:50:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:50:29,197 INFO L87 Difference]: Start difference. First operand 352214 states and 422710 transitions. Second operand 26 states. [2019-09-10 06:50:30,762 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2019-09-10 06:50:30,983 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 38 [2019-09-10 06:50:31,326 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 35 [2019-09-10 06:50:33,837 WARN L188 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2019-09-10 06:50:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:36,627 INFO L93 Difference]: Finished difference Result 893055 states and 1069856 transitions. [2019-09-10 06:50:36,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 06:50:36,628 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 116 [2019-09-10 06:50:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:37,750 INFO L225 Difference]: With dead ends: 893055 [2019-09-10 06:50:37,750 INFO L226 Difference]: Without dead ends: 893055 [2019-09-10 06:50:37,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 200 SyntacticMatches, 20 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=542, Invalid=2764, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 06:50:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893055 states. [2019-09-10 06:50:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893055 to 352225. [2019-09-10 06:50:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352225 states. [2019-09-10 06:50:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352225 states to 352225 states and 422721 transitions. [2019-09-10 06:50:50,205 INFO L78 Accepts]: Start accepts. Automaton has 352225 states and 422721 transitions. Word has length 116 [2019-09-10 06:50:50,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:50,205 INFO L475 AbstractCegarLoop]: Abstraction has 352225 states and 422721 transitions. [2019-09-10 06:50:50,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:50:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 352225 states and 422721 transitions. [2019-09-10 06:50:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:50:50,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:50,212 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:50,212 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:50,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:50,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1193953152, now seen corresponding path program 1 times [2019-09-10 06:50:50,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:50,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:50,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:50,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:50,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:50:50,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:50,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:50:50,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:50,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:50:50,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:50:50,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:50:50,594 INFO L87 Difference]: Start difference. First operand 352225 states and 422721 transitions. Second operand 11 states. [2019-09-10 06:50:50,883 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 06:50:51,019 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 06:50:51,158 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 06:50:51,445 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 06:50:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:54,255 INFO L93 Difference]: Finished difference Result 808000 states and 970823 transitions. [2019-09-10 06:50:54,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:50:54,256 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2019-09-10 06:50:54,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:56,911 INFO L225 Difference]: With dead ends: 808000 [2019-09-10 06:50:56,911 INFO L226 Difference]: Without dead ends: 808000 [2019-09-10 06:50:56,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:50:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808000 states. [2019-09-10 06:51:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808000 to 351954. [2019-09-10 06:51:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351954 states. [2019-09-10 06:51:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351954 states to 351954 states and 422422 transitions. [2019-09-10 06:51:12,502 INFO L78 Accepts]: Start accepts. Automaton has 351954 states and 422422 transitions. Word has length 116 [2019-09-10 06:51:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:12,503 INFO L475 AbstractCegarLoop]: Abstraction has 351954 states and 422422 transitions. [2019-09-10 06:51:12,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:51:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 351954 states and 422422 transitions. [2019-09-10 06:51:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:51:12,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:12,512 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:12,512 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1248346050, now seen corresponding path program 1 times [2019-09-10 06:51:12,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:12,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:12,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:12,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:12,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:13,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:13,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:51:13,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:13,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:51:13,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:51:13,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:51:13,910 INFO L87 Difference]: Start difference. First operand 351954 states and 422422 transitions. Second operand 21 states. [2019-09-10 06:51:14,871 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:51:15,121 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 06:51:15,339 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 06:51:15,572 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 06:51:15,930 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:51:16,386 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 06:51:16,542 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:51:16,782 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 06:51:17,151 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 06:51:17,449 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-09-10 06:51:18,231 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 06:51:18,542 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-09-10 06:51:19,344 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-09-10 06:51:19,704 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-10 06:51:20,098 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-10 06:51:20,783 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-10 06:51:21,592 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2019-09-10 06:51:21,941 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2019-09-10 06:51:22,440 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-09-10 06:51:22,697 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 06:51:23,041 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-09-10 06:51:23,350 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 06:51:23,891 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-09-10 06:51:24,181 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 06:51:24,376 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-10 06:51:25,002 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-10 06:51:25,319 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-09-10 06:51:25,572 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 06:51:26,057 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 110 [2019-09-10 06:51:26,326 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-09-10 06:51:26,573 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-10 06:51:26,923 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 06:51:27,295 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 110 [2019-09-10 06:51:27,641 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-09-10 06:51:28,036 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 110 [2019-09-10 06:51:28,396 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-09-10 06:51:28,754 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-09-10 06:51:29,178 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-09-10 06:51:29,455 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 06:51:29,812 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2019-09-10 06:51:30,153 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 06:51:30,555 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 06:51:30,962 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:51:31,314 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 06:51:31,681 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:51:32,033 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-09-10 06:51:32,294 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-09-10 06:51:32,520 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 06:51:32,773 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-09-10 06:51:33,019 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-10 06:51:33,327 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:51:33,490 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 06:51:33,717 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-09-10 06:51:33,943 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 06:51:34,313 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 06:51:34,540 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-09-10 06:51:34,768 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-09-10 06:51:35,104 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-09-10 06:51:35,430 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2019-09-10 06:51:35,793 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 06:51:36,096 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 06:51:36,454 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 06:51:36,786 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2019-09-10 06:51:37,123 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 06:51:37,496 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2019-09-10 06:51:37,735 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 06:51:38,081 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 06:51:38,497 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-09-10 06:51:38,862 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-09-10 06:51:39,219 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 06:51:39,834 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:51:40,149 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2019-09-10 06:51:40,626 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-09-10 06:51:40,981 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 06:51:41,278 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-09-10 06:51:41,507 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 06:51:41,776 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-09-10 06:51:42,007 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:51:42,221 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 06:51:42,435 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 06:51:42,796 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-10 06:51:43,148 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 06:51:43,486 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-10 06:51:43,787 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:51:44,129 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:51:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:45,962 INFO L93 Difference]: Finished difference Result 795514 states and 953911 transitions. [2019-09-10 06:51:45,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-10 06:51:45,962 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 116 [2019-09-10 06:51:45,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:46,973 INFO L225 Difference]: With dead ends: 795514 [2019-09-10 06:51:46,973 INFO L226 Difference]: Without dead ends: 795514 [2019-09-10 06:51:46,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4966 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=2393, Invalid=12127, Unknown=0, NotChecked=0, Total=14520 [2019-09-10 06:51:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795514 states. [2019-09-10 06:51:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795514 to 356633. [2019-09-10 06:51:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356633 states. [2019-09-10 06:51:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356633 states to 356633 states and 427948 transitions. [2019-09-10 06:51:59,345 INFO L78 Accepts]: Start accepts. Automaton has 356633 states and 427948 transitions. Word has length 116 [2019-09-10 06:51:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:59,346 INFO L475 AbstractCegarLoop]: Abstraction has 356633 states and 427948 transitions. [2019-09-10 06:51:59,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:51:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 356633 states and 427948 transitions. [2019-09-10 06:51:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:51:59,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:59,353 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:59,353 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:59,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:59,353 INFO L82 PathProgramCache]: Analyzing trace with hash 32418267, now seen corresponding path program 1 times [2019-09-10 06:51:59,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:59,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:59,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:59,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:59,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:59,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:59,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:51:59,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:59,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:51:59,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:51:59,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:59,407 INFO L87 Difference]: Start difference. First operand 356633 states and 427948 transitions. Second operand 3 states. [2019-09-10 06:51:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:59,996 INFO L93 Difference]: Finished difference Result 256464 states and 299030 transitions. [2019-09-10 06:51:59,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:51:59,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 06:51:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:00,245 INFO L225 Difference]: With dead ends: 256464 [2019-09-10 06:52:00,245 INFO L226 Difference]: Without dead ends: 256464 [2019-09-10 06:52:00,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256464 states. [2019-09-10 06:52:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256464 to 243537. [2019-09-10 06:52:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243537 states. [2019-09-10 06:52:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243537 states to 243537 states and 285685 transitions. [2019-09-10 06:52:04,080 INFO L78 Accepts]: Start accepts. Automaton has 243537 states and 285685 transitions. Word has length 116 [2019-09-10 06:52:04,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:04,080 INFO L475 AbstractCegarLoop]: Abstraction has 243537 states and 285685 transitions. [2019-09-10 06:52:04,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:52:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 243537 states and 285685 transitions. [2019-09-10 06:52:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:52:04,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:04,084 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:04,085 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:04,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1403747042, now seen corresponding path program 1 times [2019-09-10 06:52:04,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:04,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:04,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:04,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:04,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:52:04,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:04,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:52:04,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:04,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:52:04,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:52:04,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:52:04,611 INFO L87 Difference]: Start difference. First operand 243537 states and 285685 transitions. Second operand 12 states. [2019-09-10 06:52:05,965 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 06:52:06,172 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:52:06,381 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 06:52:06,598 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:52:06,809 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 06:52:07,037 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:52:07,243 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:52:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:08,103 INFO L93 Difference]: Finished difference Result 321155 states and 376849 transitions. [2019-09-10 06:52:08,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:52:08,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 116 [2019-09-10 06:52:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:08,396 INFO L225 Difference]: With dead ends: 321155 [2019-09-10 06:52:08,396 INFO L226 Difference]: Without dead ends: 321155 [2019-09-10 06:52:08,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:52:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321155 states. [2019-09-10 06:52:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321155 to 233244. [2019-09-10 06:52:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233244 states. [2019-09-10 06:52:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233244 states to 233244 states and 273625 transitions. [2019-09-10 06:52:14,138 INFO L78 Accepts]: Start accepts. Automaton has 233244 states and 273625 transitions. Word has length 116 [2019-09-10 06:52:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:14,138 INFO L475 AbstractCegarLoop]: Abstraction has 233244 states and 273625 transitions. [2019-09-10 06:52:14,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:52:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 233244 states and 273625 transitions. [2019-09-10 06:52:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:52:14,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:14,142 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:14,142 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:14,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1675066528, now seen corresponding path program 1 times [2019-09-10 06:52:14,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:14,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:14,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:14,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:14,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:52:14,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:14,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:52:14,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:52:14,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:52:14,517 INFO L87 Difference]: Start difference. First operand 233244 states and 273625 transitions. Second operand 18 states. [2019-09-10 06:52:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:21,108 INFO L93 Difference]: Finished difference Result 420334 states and 493960 transitions. [2019-09-10 06:52:21,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 06:52:21,109 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 116 [2019-09-10 06:52:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:21,551 INFO L225 Difference]: With dead ends: 420334 [2019-09-10 06:52:21,551 INFO L226 Difference]: Without dead ends: 420334 [2019-09-10 06:52:21,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=795, Invalid=2745, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:52:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420334 states. [2019-09-10 06:52:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420334 to 236554. [2019-09-10 06:52:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236554 states. [2019-09-10 06:52:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236554 states to 236554 states and 277381 transitions. [2019-09-10 06:52:24,687 INFO L78 Accepts]: Start accepts. Automaton has 236554 states and 277381 transitions. Word has length 116 [2019-09-10 06:52:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:24,688 INFO L475 AbstractCegarLoop]: Abstraction has 236554 states and 277381 transitions. [2019-09-10 06:52:24,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:52:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 236554 states and 277381 transitions. [2019-09-10 06:52:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:52:24,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:24,691 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:24,691 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash 882679816, now seen corresponding path program 1 times [2019-09-10 06:52:24,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:24,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:24,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:24,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:24,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:25,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:25,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:52:25,073 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 06:52:25,074 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [135], [138], [149], [152], [155], [158], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [259], [261], [270], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [467], [470], [473], [475], [489], [494], [510], [520], [573], [589], [611], [612], [616], [617], [618] [2019-09-10 06:52:25,076 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:52:25,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:52:25,087 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:52:25,238 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:52:25,238 INFO L272 AbstractInterpreter]: Visited 111 different actions 393 times. Merged at 41 different actions 256 times. Widened at 10 different actions 27 times. Performed 1423 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1423 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 11 different actions. Largest state had 126 variables. [2019-09-10 06:52:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:25,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:52:25,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:25,239 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:52:25,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:25,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:52:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:25,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 06:52:25,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:52:25,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:25,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:25,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:25,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:25,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:25,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:25,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:25,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:26,017 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:52:26,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:26,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:26,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:26,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:26,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:26,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:52:26,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 31 [2019-09-10 06:52:26,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:52:26,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:52:26,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:52:26,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:52:26,406 INFO L87 Difference]: Start difference. First operand 236554 states and 277381 transitions. Second operand 22 states. [2019-09-10 06:52:27,375 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 06:52:27,582 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 06:52:28,346 WARN L188 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 06:52:28,613 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:52:28,849 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 06:52:29,127 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 06:52:29,418 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 06:52:29,635 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 06:52:29,928 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 06:52:30,224 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:52:30,608 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 06:52:30,867 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 06:52:31,237 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:52:31,612 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-10 06:52:32,325 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:52:32,555 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-10 06:52:32,980 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 06:52:33,533 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-09-10 06:52:33,738 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:52:34,008 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:52:34,608 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-09-10 06:52:35,067 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-09-10 06:52:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:35,552 INFO L93 Difference]: Finished difference Result 302518 states and 350467 transitions. [2019-09-10 06:52:35,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 06:52:35,552 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 116 [2019-09-10 06:52:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:35,844 INFO L225 Difference]: With dead ends: 302518 [2019-09-10 06:52:35,844 INFO L226 Difference]: Without dead ends: 302518 [2019-09-10 06:52:35,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 204 SyntacticMatches, 10 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1032, Invalid=4224, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 06:52:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302518 states. [2019-09-10 06:52:40,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302518 to 216820. [2019-09-10 06:52:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216820 states. [2019-09-10 06:52:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216820 states to 216820 states and 254104 transitions. [2019-09-10 06:52:41,025 INFO L78 Accepts]: Start accepts. Automaton has 216820 states and 254104 transitions. Word has length 116 [2019-09-10 06:52:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:41,025 INFO L475 AbstractCegarLoop]: Abstraction has 216820 states and 254104 transitions. [2019-09-10 06:52:41,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:52:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 216820 states and 254104 transitions. [2019-09-10 06:52:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:52:41,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:41,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:41,029 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:41,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:41,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1930221503, now seen corresponding path program 1 times [2019-09-10 06:52:41,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:41,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:41,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:41,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:41,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:41,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:41,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:52:41,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 06:52:41,285 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [133], [135], [138], [141], [144], [147], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [611], [612], [616], [617], [618] [2019-09-10 06:52:41,286 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:52:41,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:52:41,298 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:52:41,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:52:41,477 INFO L272 AbstractInterpreter]: Visited 113 different actions 456 times. Merged at 40 different actions 311 times. Widened at 14 different actions 49 times. Performed 1650 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1650 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 13 different actions. Largest state had 127 variables. [2019-09-10 06:52:41,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:41,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:52:41,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:41,477 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:52:41,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:41,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:52:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:41,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:52:41,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:52:41,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:41,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:42,117 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:52:42,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,881 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-09-10 06:52:45,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:46,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:52:46,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 06:52:46,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:52:46,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:52:46,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:52:46,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:52:46,257 INFO L87 Difference]: Start difference. First operand 216820 states and 254104 transitions. Second operand 20 states. [2019-09-10 06:52:46,791 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 06:52:47,093 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:52:47,487 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:52:48,064 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:52:48,273 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:52:48,686 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:52:49,149 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:52:49,442 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:52:49,929 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:52:50,378 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:52:50,779 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:52:51,634 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:52:52,001 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:52:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:52,678 INFO L93 Difference]: Finished difference Result 359759 states and 419378 transitions. [2019-09-10 06:52:52,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:52:52,679 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 118 [2019-09-10 06:52:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:53,038 INFO L225 Difference]: With dead ends: 359759 [2019-09-10 06:52:53,038 INFO L226 Difference]: Without dead ends: 359759 [2019-09-10 06:52:53,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 188 SyntacticMatches, 35 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=414, Invalid=1308, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:52:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359759 states. [2019-09-10 06:52:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359759 to 216777. [2019-09-10 06:52:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216777 states. [2019-09-10 06:52:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216777 states to 216777 states and 254048 transitions. [2019-09-10 06:52:57,091 INFO L78 Accepts]: Start accepts. Automaton has 216777 states and 254048 transitions. Word has length 118 [2019-09-10 06:52:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:57,091 INFO L475 AbstractCegarLoop]: Abstraction has 216777 states and 254048 transitions. [2019-09-10 06:52:57,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:52:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 216777 states and 254048 transitions. [2019-09-10 06:52:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:52:57,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:57,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:57,096 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:57,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:57,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1975636047, now seen corresponding path program 1 times [2019-09-10 06:52:57,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:57,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:57,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:57,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:57,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:57,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:57,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:52:57,706 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2019-09-10 06:52:57,706 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [133], [135], [138], [141], [144], [147], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [257], [259], [261], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [611], [612], [616], [617], [618] [2019-09-10 06:52:57,710 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:52:57,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:52:57,722 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:52:57,932 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:52:57,933 INFO L272 AbstractInterpreter]: Visited 115 different actions 462 times. Merged at 42 different actions 320 times. Widened at 11 different actions 36 times. Performed 1604 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1604 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 9 different actions. Largest state had 127 variables. [2019-09-10 06:52:57,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:57,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:52:57,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:57,934 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:52:57,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:57,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:52:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:58,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 06:52:58,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:52:58,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:58,979 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-09-10 06:52:58,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:52:59,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:52:59,455 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-10 06:52:59,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:52:59,847 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 06:53:00,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:00,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:53:00,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:53:01,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:01,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:01,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:02,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:53:03,550 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:53:03,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21, 21] imperfect sequences [22] total 60 [2019-09-10 06:53:03,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:03,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:53:03,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:53:03,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=3299, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:53:03,551 INFO L87 Difference]: Start difference. First operand 216777 states and 254048 transitions. Second operand 21 states. [2019-09-10 06:53:03,970 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-09-10 06:53:05,272 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:53:05,578 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-09-10 06:53:07,288 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-09-10 06:53:07,925 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 06:53:08,756 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 06:53:14,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:14,333 INFO L93 Difference]: Finished difference Result 322791 states and 379003 transitions. [2019-09-10 06:53:14,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:53:14,333 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 120 [2019-09-10 06:53:14,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:14,701 INFO L225 Difference]: With dead ends: 322791 [2019-09-10 06:53:14,701 INFO L226 Difference]: Without dead ends: 322791 [2019-09-10 06:53:14,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=505, Invalid=4751, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 06:53:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322791 states. [2019-09-10 06:53:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322791 to 216563. [2019-09-10 06:53:18,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216563 states. [2019-09-10 06:53:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216563 states to 216563 states and 253800 transitions. [2019-09-10 06:53:18,503 INFO L78 Accepts]: Start accepts. Automaton has 216563 states and 253800 transitions. Word has length 120 [2019-09-10 06:53:18,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:18,504 INFO L475 AbstractCegarLoop]: Abstraction has 216563 states and 253800 transitions. [2019-09-10 06:53:18,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:53:18,504 INFO L276 IsEmpty]: Start isEmpty. Operand 216563 states and 253800 transitions. [2019-09-10 06:53:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 06:53:18,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:18,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:18,509 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:18,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:18,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1781664402, now seen corresponding path program 1 times [2019-09-10 06:53:18,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:18,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:18,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:18,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:18,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:18,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:18,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:53:18,855 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 122 with the following transitions: [2019-09-10 06:53:18,855 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [135], [138], [141], [144], [147], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [206], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [326], [329], [337], [340], [343], [346], [348], [350], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [513], [518], [611], [612], [616], [617], [618] [2019-09-10 06:53:18,858 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:53:18,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:53:18,868 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:53:18,983 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:53:18,983 INFO L272 AbstractInterpreter]: Visited 116 different actions 387 times. Merged at 42 different actions 251 times. Widened at 11 different actions 23 times. Performed 1416 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1416 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 19 fixpoints after 8 different actions. Largest state had 127 variables. [2019-09-10 06:53:18,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:18,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:53:18,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:18,984 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:53:18,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:18,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:53:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:19,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 06:53:19,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:53:19,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:19,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:19,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:20,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:20,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:53:21,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:22,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:22,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:22,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:22,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:22,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:22,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:22,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:22,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:53:22,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 20] total 55 [2019-09-10 06:53:22,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:53:22,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 06:53:22,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 06:53:22,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2734, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 06:53:22,585 INFO L87 Difference]: Start difference. First operand 216563 states and 253800 transitions. Second operand 38 states. [2019-09-10 06:53:22,810 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 06:53:24,477 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 06:53:28,270 WARN L188 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 51 [2019-09-10 06:53:32,312 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-10 06:53:32,703 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-09-10 06:53:33,585 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-09-10 06:53:34,638 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-09-10 06:53:36,052 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-10 06:53:36,642 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-10 06:53:39,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:39,413 INFO L93 Difference]: Finished difference Result 413991 states and 483255 transitions. [2019-09-10 06:53:39,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-10 06:53:39,413 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 121 [2019-09-10 06:53:39,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:39,899 INFO L225 Difference]: With dead ends: 413991 [2019-09-10 06:53:39,900 INFO L226 Difference]: Without dead ends: 413991 [2019-09-10 06:53:39,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 198 SyntacticMatches, 10 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4050 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1870, Invalid=12650, Unknown=0, NotChecked=0, Total=14520 [2019-09-10 06:53:40,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413991 states. [2019-09-10 06:53:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413991 to 216436. [2019-09-10 06:53:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216436 states. [2019-09-10 06:53:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216436 states to 216436 states and 253656 transitions. [2019-09-10 06:53:43,269 INFO L78 Accepts]: Start accepts. Automaton has 216436 states and 253656 transitions. Word has length 121 [2019-09-10 06:53:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:43,270 INFO L475 AbstractCegarLoop]: Abstraction has 216436 states and 253656 transitions. [2019-09-10 06:53:43,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 06:53:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 216436 states and 253656 transitions. [2019-09-10 06:53:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 06:53:43,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:43,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:43,274 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:43,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:43,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1029694981, now seen corresponding path program 1 times [2019-09-10 06:53:43,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:43,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:43,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:43,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:43,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:44,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:44,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:53:44,733 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 122 with the following transitions: [2019-09-10 06:53:44,734 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [133], [135], [138], [141], [144], [147], [149], [152], [155], [158], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [257], [259], [261], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [489], [494], [611], [612], [616], [617], [618] [2019-09-10 06:53:44,738 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:53:44,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:53:44,748 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:53:44,914 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:53:44,914 INFO L272 AbstractInterpreter]: Visited 116 different actions 428 times. Merged at 42 different actions 288 times. Widened at 12 different actions 28 times. Performed 1560 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1560 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 10 different actions. Largest state had 127 variables. [2019-09-10 06:53:44,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:44,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:53:44,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:44,915 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:53:44,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:44,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:53:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:45,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-10 06:53:45,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:53:46,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:47,242 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:53:48,430 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-09-10 06:53:48,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:48,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:48,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:48,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:48,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:48,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:48,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:48,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:48,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:48,911 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 06:53:49,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:53:49,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:49,939 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-09-10 06:53:49,940 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-09-10 06:53:50,501 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-09-10 06:53:50,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:53:50,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:50,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:50,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:50,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:51,330 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-10 06:53:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:53,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:53:53,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 21] total 65 [2019-09-10 06:53:53,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:53:53,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 06:53:53,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 06:53:53,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=3881, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 06:53:53,362 INFO L87 Difference]: Start difference. First operand 216436 states and 253656 transitions. Second operand 53 states. [2019-09-10 06:53:53,605 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2019-09-10 06:53:55,641 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:53:56,537 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-09-10 06:53:56,981 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2019-09-10 06:53:57,213 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 06:53:58,046 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 06:53:58,413 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 06:53:58,888 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 06:53:59,098 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 06:53:59,604 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 06:54:00,479 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 06:54:01,031 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:54:02,089 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 06:54:02,413 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:54:03,402 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 06:54:04,018 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 06:54:05,114 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 06:54:05,466 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-10 06:54:06,522 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 06:54:11,937 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:54:13,002 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:54:13,474 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 06:54:21,427 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:54:22,078 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:54:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:23,948 INFO L93 Difference]: Finished difference Result 443178 states and 513770 transitions. [2019-09-10 06:54:23,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-10 06:54:23,949 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 121 [2019-09-10 06:54:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:25,038 INFO L225 Difference]: With dead ends: 443178 [2019-09-10 06:54:25,039 INFO L226 Difference]: Without dead ends: 443178 [2019-09-10 06:54:25,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 191 SyntacticMatches, 17 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8418 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=2710, Invalid=25346, Unknown=0, NotChecked=0, Total=28056 [2019-09-10 06:54:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443178 states. [2019-09-10 06:54:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443178 to 216388. [2019-09-10 06:54:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216388 states. [2019-09-10 06:54:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216388 states to 216388 states and 253601 transitions. [2019-09-10 06:54:28,053 INFO L78 Accepts]: Start accepts. Automaton has 216388 states and 253601 transitions. Word has length 121 [2019-09-10 06:54:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:28,053 INFO L475 AbstractCegarLoop]: Abstraction has 216388 states and 253601 transitions. [2019-09-10 06:54:28,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 06:54:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 216388 states and 253601 transitions. [2019-09-10 06:54:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 06:54:28,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:28,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:28,058 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:28,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:28,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1063721894, now seen corresponding path program 1 times [2019-09-10 06:54:28,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:28,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:28,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:28,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:28,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:28,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:28,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:54:28,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:28,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:54:28,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:54:28,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:54:28,453 INFO L87 Difference]: Start difference. First operand 216388 states and 253601 transitions. Second operand 18 states. [2019-09-10 06:54:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:32,334 INFO L93 Difference]: Finished difference Result 277370 states and 324622 transitions. [2019-09-10 06:54:32,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 06:54:32,334 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2019-09-10 06:54:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:32,631 INFO L225 Difference]: With dead ends: 277370 [2019-09-10 06:54:32,632 INFO L226 Difference]: Without dead ends: 277370 [2019-09-10 06:54:32,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=350, Invalid=1720, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 06:54:32,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277370 states. [2019-09-10 06:54:34,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277370 to 217256. [2019-09-10 06:54:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217256 states. [2019-09-10 06:54:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217256 states to 217256 states and 254577 transitions. [2019-09-10 06:54:35,234 INFO L78 Accepts]: Start accepts. Automaton has 217256 states and 254577 transitions. Word has length 121 [2019-09-10 06:54:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:35,234 INFO L475 AbstractCegarLoop]: Abstraction has 217256 states and 254577 transitions. [2019-09-10 06:54:35,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:54:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 217256 states and 254577 transitions. [2019-09-10 06:54:35,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 06:54:35,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:35,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:35,239 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:35,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:35,239 INFO L82 PathProgramCache]: Analyzing trace with hash 578426286, now seen corresponding path program 1 times [2019-09-10 06:54:35,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:35,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:35,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:35,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:35,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:35,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:35,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:54:35,693 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 123 with the following transitions: [2019-09-10 06:54:35,694 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [135], [138], [141], [144], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [222], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [501], [506], [513], [518], [611], [612], [616], [617], [618] [2019-09-10 06:54:35,696 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:54:35,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:54:35,714 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:54:37,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:54:37,394 INFO L272 AbstractInterpreter]: Visited 117 different actions 440 times. Merged at 42 different actions 297 times. Widened at 13 different actions 33 times. Performed 1555 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1555 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 10 different actions. Largest state had 127 variables. [2019-09-10 06:54:37,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:37,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:54:37,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:37,395 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:54:37,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:37,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:54:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:37,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:54:37,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:54:37,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:37,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:37,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:37,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:43,874 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:54:43,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:43,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:44,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:54:44,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2019-09-10 06:54:44,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:54:44,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:54:44,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:54:44,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:54:44,049 INFO L87 Difference]: Start difference. First operand 217256 states and 254577 transitions. Second operand 25 states. [2019-09-10 06:54:45,938 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 06:54:46,731 WARN L188 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:54:46,943 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:54:47,339 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 06:54:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:49,391 INFO L93 Difference]: Finished difference Result 402088 states and 468130 transitions. [2019-09-10 06:54:49,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:54:49,392 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 122 [2019-09-10 06:54:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:50,908 INFO L225 Difference]: With dead ends: 402088 [2019-09-10 06:54:50,908 INFO L226 Difference]: Without dead ends: 402088 [2019-09-10 06:54:50,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 214 SyntacticMatches, 20 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=345, Invalid=1635, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:54:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402088 states. [2019-09-10 06:54:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402088 to 217118. [2019-09-10 06:54:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217118 states. [2019-09-10 06:54:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217118 states to 217118 states and 254419 transitions. [2019-09-10 06:54:55,310 INFO L78 Accepts]: Start accepts. Automaton has 217118 states and 254419 transitions. Word has length 122 [2019-09-10 06:54:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:55,311 INFO L475 AbstractCegarLoop]: Abstraction has 217118 states and 254419 transitions. [2019-09-10 06:54:55,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:54:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 217118 states and 254419 transitions. [2019-09-10 06:54:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 06:54:55,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:55,323 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1] [2019-09-10 06:54:55,323 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:55,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:55,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1338192077, now seen corresponding path program 1 times [2019-09-10 06:54:55,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:55,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:55,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:55,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:55,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 06:54:55,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:55,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:54:55,520 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 06:54:55,520 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [200], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [274], [277], [280], [283], [285], [287], [317], [322], [335], [337], [350], [358], [377], [386], [388], [390], [403], [411], [430], [443], [446], [449], [452], [454], [456], [498], [508], [522], [531], [547], [552], [568], [611], [612], [616], [617], [618] [2019-09-10 06:54:55,521 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:54:55,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:54:55,532 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:54:55,708 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:54:55,709 INFO L272 AbstractInterpreter]: Visited 103 different actions 502 times. Merged at 39 different actions 340 times. Widened at 14 different actions 54 times. Performed 1714 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1714 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 54 fixpoints after 13 different actions. Largest state had 124 variables. [2019-09-10 06:54:55,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:55,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:54:55,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:55,710 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:54:55,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:55,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:54:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:55,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:54:55,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:54:55,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:56,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 06:54:56,727 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:54:56,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 06:54:57,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:54:57,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2019-09-10 06:54:57,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:54:57,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:54:57,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:54:57,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:54:57,050 INFO L87 Difference]: Start difference. First operand 217118 states and 254419 transitions. Second operand 19 states. [2019-09-10 06:54:57,517 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:55:02,378 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:55:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:03,335 INFO L93 Difference]: Finished difference Result 421122 states and 490149 transitions. [2019-09-10 06:55:03,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:55:03,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 145 [2019-09-10 06:55:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:03,761 INFO L225 Difference]: With dead ends: 421122 [2019-09-10 06:55:03,761 INFO L226 Difference]: Without dead ends: 421122 [2019-09-10 06:55:03,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 262 SyntacticMatches, 15 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=483, Invalid=1679, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:55:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421122 states. [2019-09-10 06:55:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421122 to 316671. [2019-09-10 06:55:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316671 states. [2019-09-10 06:55:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316671 states to 316671 states and 370509 transitions. [2019-09-10 06:55:11,605 INFO L78 Accepts]: Start accepts. Automaton has 316671 states and 370509 transitions. Word has length 145 [2019-09-10 06:55:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:11,605 INFO L475 AbstractCegarLoop]: Abstraction has 316671 states and 370509 transitions. [2019-09-10 06:55:11,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:55:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 316671 states and 370509 transitions. [2019-09-10 06:55:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 06:55:11,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:11,619 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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 06:55:11,620 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:11,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1791884854, now seen corresponding path program 1 times [2019-09-10 06:55:11,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:11,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:11,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 06:55:11,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:11,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:11,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:11,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:11,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:11,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:11,679 INFO L87 Difference]: Start difference. First operand 316671 states and 370509 transitions. Second operand 3 states. [2019-09-10 06:55:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:11,943 INFO L93 Difference]: Finished difference Result 144930 states and 165340 transitions. [2019-09-10 06:55:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:11,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-10 06:55:11,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:12,064 INFO L225 Difference]: With dead ends: 144930 [2019-09-10 06:55:12,064 INFO L226 Difference]: Without dead ends: 144930 [2019-09-10 06:55:12,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144930 states. [2019-09-10 06:55:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144930 to 142565. [2019-09-10 06:55:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142565 states. [2019-09-10 06:55:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142565 states to 142565 states and 162692 transitions. [2019-09-10 06:55:13,895 INFO L78 Accepts]: Start accepts. Automaton has 142565 states and 162692 transitions. Word has length 145 [2019-09-10 06:55:13,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:13,895 INFO L475 AbstractCegarLoop]: Abstraction has 142565 states and 162692 transitions. [2019-09-10 06:55:13,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 142565 states and 162692 transitions. [2019-09-10 06:55:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 06:55:13,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:13,903 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:13,903 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:13,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:13,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1201856045, now seen corresponding path program 1 times [2019-09-10 06:55:13,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:13,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:13,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 06:55:13,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:13,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:13,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:13,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:13,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:13,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:13,948 INFO L87 Difference]: Start difference. First operand 142565 states and 162692 transitions. Second operand 3 states. [2019-09-10 06:55:14,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:14,830 INFO L93 Difference]: Finished difference Result 65606 states and 74791 transitions. [2019-09-10 06:55:14,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:14,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-10 06:55:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:14,880 INFO L225 Difference]: With dead ends: 65606 [2019-09-10 06:55:14,880 INFO L226 Difference]: Without dead ends: 65606 [2019-09-10 06:55:14,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65606 states. [2019-09-10 06:55:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65606 to 63498. [2019-09-10 06:55:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63498 states. [2019-09-10 06:55:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63498 states to 63498 states and 72299 transitions. [2019-09-10 06:55:15,281 INFO L78 Accepts]: Start accepts. Automaton has 63498 states and 72299 transitions. Word has length 145 [2019-09-10 06:55:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:15,281 INFO L475 AbstractCegarLoop]: Abstraction has 63498 states and 72299 transitions. [2019-09-10 06:55:15,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 63498 states and 72299 transitions. [2019-09-10 06:55:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 06:55:15,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:15,287 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 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 06:55:15,287 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:15,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:15,287 INFO L82 PathProgramCache]: Analyzing trace with hash 661984275, now seen corresponding path program 1 times [2019-09-10 06:55:15,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:15,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:15,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:15,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:15,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 59 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:55:15,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:55:15,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:55:15,996 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2019-09-10 06:55:15,996 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [200], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [274], [277], [280], [283], [285], [287], [317], [322], [335], [337], [350], [358], [377], [386], [390], [403], [411], [430], [443], [446], [449], [452], [454], [456], [498], [508], [522], [531], [547], [552], [568], [611], [612], [616], [617], [618] [2019-09-10 06:55:15,999 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:55:15,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:55:16,009 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:55:16,150 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:55:16,151 INFO L272 AbstractInterpreter]: Visited 102 different actions 446 times. Merged at 38 different actions 302 times. Widened at 12 different actions 36 times. Performed 1604 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1604 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 40 fixpoints after 11 different actions. Largest state had 124 variables. [2019-09-10 06:55:16,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:16,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:55:16,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:55:16,151 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:55:16,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:16,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:55:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:16,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 06:55:16,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:55:16,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-10 06:55:17,481 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:55:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-10 06:55:17,733 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:55:17,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [20] total 36 [2019-09-10 06:55:17,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:17,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:55:17,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:55:17,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1085, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:55:17,734 INFO L87 Difference]: Start difference. First operand 63498 states and 72299 transitions. Second operand 12 states. [2019-09-10 06:55:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:18,972 INFO L93 Difference]: Finished difference Result 63539 states and 72342 transitions. [2019-09-10 06:55:18,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:55:18,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-10 06:55:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:19,020 INFO L225 Difference]: With dead ends: 63539 [2019-09-10 06:55:19,021 INFO L226 Difference]: Without dead ends: 63539 [2019-09-10 06:55:19,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 271 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=302, Invalid=1504, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:55:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63539 states. [2019-09-10 06:55:19,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63539 to 63382. [2019-09-10 06:55:19,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63382 states. [2019-09-10 06:55:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63382 states to 63382 states and 72175 transitions. [2019-09-10 06:55:19,427 INFO L78 Accepts]: Start accepts. Automaton has 63382 states and 72175 transitions. Word has length 146 [2019-09-10 06:55:19,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:19,427 INFO L475 AbstractCegarLoop]: Abstraction has 63382 states and 72175 transitions. [2019-09-10 06:55:19,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:55:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 63382 states and 72175 transitions. [2019-09-10 06:55:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 06:55:19,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:19,433 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2019-09-10 06:55:19,433 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:19,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1472892211, now seen corresponding path program 1 times [2019-09-10 06:55:19,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:19,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:19,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:19,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:19,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 06:55:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:19,478 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: program execution has not yet been computed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getRcfgProgramExecution(TraceCheck.java:440) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-10 06:55:19,483 INFO L168 Benchmark]: Toolchain (without parser) took 559924.88 ms. Allocated memory was 141.0 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 87.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-09-10 06:55:19,483 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-10 06:55:19,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.07 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 86.8 MB in the beginning and 173.3 MB in the end (delta: -86.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-09-10 06:55:19,484 INFO L168 Benchmark]: Boogie Preprocessor took 58.50 ms. Allocated memory is still 201.3 MB. Free memory was 173.3 MB in the beginning and 170.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-09-10 06:55:19,484 INFO L168 Benchmark]: RCFGBuilder took 898.87 ms. Allocated memory is still 201.3 MB. Free memory was 170.2 MB in the beginning and 111.2 MB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 7.1 GB. [2019-09-10 06:55:19,484 INFO L168 Benchmark]: TraceAbstraction took 558346.89 ms. Allocated memory was 201.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 110.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-09-10 06:55:19,486 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 616.07 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 86.8 MB in the beginning and 173.3 MB in the end (delta: -86.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.50 ms. Allocated memory is still 201.3 MB. Free memory was 173.3 MB in the beginning and 170.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 898.87 ms. Allocated memory is still 201.3 MB. Free memory was 170.2 MB in the beginning and 111.2 MB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 558346.89 ms. Allocated memory was 201.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 110.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: program execution has not yet been computed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: program execution has not yet been computed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getRcfgProgramExecution(TraceCheck.java:440) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...