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.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:39:54,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:39:54,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:39:54,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:39:54,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:39:54,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:39:54,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:39:54,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:39:54,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:39:54,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:39:54,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:39:54,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:39:54,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:39:54,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:39:54,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:39:54,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:39:54,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:39:54,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:39:54,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:39:54,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:39:54,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:39:54,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:39:54,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:39:54,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:39:54,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:39:54,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:39:54,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:39:54,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:39:54,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:39:54,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:39:54,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:39:54,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:39:54,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:39:54,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:39:54,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:39:54,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:39:54,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:39:54,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:39:54,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:39:54,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:39:54,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:39:54,496 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 07:39:54,526 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:39:54,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:39:54,527 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:39:54,527 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:39:54,530 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:39:54,530 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:39:54,530 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:39:54,531 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:39:54,531 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:39:54,531 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:39:54,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:39:54,532 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:39:54,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:39:54,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:39:54,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:39:54,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:39:54,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:39:54,534 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:39:54,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:39:54,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:39:54,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:39:54,535 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:39:54,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:39:54,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:39:54,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:39:54,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:39:54,536 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:39:54,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:39:54,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:39:54,537 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:39:54,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:39:54,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:39:54,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:39:54,600 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:39:54,600 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:39:54,601 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 07:39:54,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f25024011/04f692d262914d58b7ae1d3079456b31/FLAGf3126c459 [2019-09-10 07:39:55,181 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:39:55,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 07:39:55,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f25024011/04f692d262914d58b7ae1d3079456b31/FLAGf3126c459 [2019-09-10 07:39:55,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f25024011/04f692d262914d58b7ae1d3079456b31 [2019-09-10 07:39:55,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:39:55,510 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:39:55,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:39:55,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:39:55,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:39:55,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:39:55" (1/1) ... [2019-09-10 07:39:55,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b60ac12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:55, skipping insertion in model container [2019-09-10 07:39:55,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:39:55" (1/1) ... [2019-09-10 07:39:55,530 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:39:55,590 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:39:55,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:39:55,950 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:39:56,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:39:56,093 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:39:56,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:56 WrapperNode [2019-09-10 07:39:56,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:39:56,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:39:56,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:39:56,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:39:56,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:56" (1/1) ... [2019-09-10 07:39:56,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:56" (1/1) ... [2019-09-10 07:39:56,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:56" (1/1) ... [2019-09-10 07:39:56,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:56" (1/1) ... [2019-09-10 07:39:56,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:56" (1/1) ... [2019-09-10 07:39:56,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:56" (1/1) ... [2019-09-10 07:39:56,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:56" (1/1) ... [2019-09-10 07:39:56,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:39:56,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:39:56,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:39:56,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:39:56,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:56" (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 07:39:56,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:39:56,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:39:56,210 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:39:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:39:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:39:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:39:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:39:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:39:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:39:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:39:56,212 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:39:56,212 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:39:56,212 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:39:56,212 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:39:56,212 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:39:56,213 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:39:56,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:39:56,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:39:56,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:39:56,956 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:39:56,957 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:39:56,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:39:56 BoogieIcfgContainer [2019-09-10 07:39:56,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:39:56,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:39:56,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:39:56,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:39:56,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:39:55" (1/3) ... [2019-09-10 07:39:56,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3030103c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:39:56, skipping insertion in model container [2019-09-10 07:39:56,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:56" (2/3) ... [2019-09-10 07:39:56,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3030103c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:39:56, skipping insertion in model container [2019-09-10 07:39:56,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:39:56" (3/3) ... [2019-09-10 07:39:56,971 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 07:39:56,982 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:39:57,004 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:39:57,021 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:39:57,046 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:39:57,046 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:39:57,046 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:39:57,046 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:39:57,047 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:39:57,047 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:39:57,047 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:39:57,047 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:39:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2019-09-10 07:39:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:39:57,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:57,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:57,080 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:57,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:57,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1740828336, now seen corresponding path program 1 times [2019-09-10 07:39:57,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:57,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:57,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:57,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:57,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:57,521 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 07:39:57,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:57,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:57,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:57,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:57,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:57,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:57,550 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 3 states. [2019-09-10 07:39:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:57,748 INFO L93 Difference]: Finished difference Result 195 states and 319 transitions. [2019-09-10 07:39:57,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:57,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 07:39:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:57,774 INFO L225 Difference]: With dead ends: 195 [2019-09-10 07:39:57,774 INFO L226 Difference]: Without dead ends: 187 [2019-09-10 07:39:57,778 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 07:39:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-10 07:39:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-09-10 07:39:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-10 07:39:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 264 transitions. [2019-09-10 07:39:57,879 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 264 transitions. Word has length 66 [2019-09-10 07:39:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:57,881 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 264 transitions. [2019-09-10 07:39:57,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 264 transitions. [2019-09-10 07:39:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:39:57,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:57,886 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 07:39:57,886 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1313317093, now seen corresponding path program 1 times [2019-09-10 07:39:57,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:57,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:57,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:57,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:57,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:58,092 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 07:39:58,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:58,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:58,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:58,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:58,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:58,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:58,096 INFO L87 Difference]: Start difference. First operand 185 states and 264 transitions. Second operand 5 states. [2019-09-10 07:39:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:58,366 INFO L93 Difference]: Finished difference Result 308 states and 453 transitions. [2019-09-10 07:39:58,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:58,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 07:39:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:58,369 INFO L225 Difference]: With dead ends: 308 [2019-09-10 07:39:58,370 INFO L226 Difference]: Without dead ends: 308 [2019-09-10 07:39:58,371 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 07:39:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-10 07:39:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2019-09-10 07:39:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-10 07:39:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 452 transitions. [2019-09-10 07:39:58,390 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 452 transitions. Word has length 68 [2019-09-10 07:39:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:58,390 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 452 transitions. [2019-09-10 07:39:58,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 452 transitions. [2019-09-10 07:39:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:39:58,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:58,392 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:58,393 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash -78645371, now seen corresponding path program 1 times [2019-09-10 07:39:58,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:58,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:58,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:58,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:58,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:58,516 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 07:39:58,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:58,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:58,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:58,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:58,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:58,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:58,519 INFO L87 Difference]: Start difference. First operand 306 states and 452 transitions. Second operand 5 states. [2019-09-10 07:39:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:58,710 INFO L93 Difference]: Finished difference Result 306 states and 447 transitions. [2019-09-10 07:39:58,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:58,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-10 07:39:58,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:58,718 INFO L225 Difference]: With dead ends: 306 [2019-09-10 07:39:58,719 INFO L226 Difference]: Without dead ends: 306 [2019-09-10 07:39:58,719 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 07:39:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-10 07:39:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2019-09-10 07:39:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-10 07:39:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 447 transitions. [2019-09-10 07:39:58,757 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 447 transitions. Word has length 69 [2019-09-10 07:39:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:58,758 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 447 transitions. [2019-09-10 07:39:58,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 447 transitions. [2019-09-10 07:39:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:39:58,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:58,763 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:58,763 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:58,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1001586053, now seen corresponding path program 1 times [2019-09-10 07:39:58,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:58,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:58,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:58,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:58,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:58,953 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 07:39:58,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:58,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:39:58,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:58,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:39:58,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:39:58,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:39:58,955 INFO L87 Difference]: Start difference. First operand 306 states and 447 transitions. Second operand 6 states. [2019-09-10 07:39:59,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:59,129 INFO L93 Difference]: Finished difference Result 496 states and 731 transitions. [2019-09-10 07:39:59,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:59,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 07:39:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:59,133 INFO L225 Difference]: With dead ends: 496 [2019-09-10 07:39:59,133 INFO L226 Difference]: Without dead ends: 496 [2019-09-10 07:39:59,134 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 07:39:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-09-10 07:39:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 494. [2019-09-10 07:39:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-09-10 07:39:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 730 transitions. [2019-09-10 07:39:59,148 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 730 transitions. Word has length 70 [2019-09-10 07:39:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:59,149 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 730 transitions. [2019-09-10 07:39:59,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:39:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 730 transitions. [2019-09-10 07:39:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:39:59,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:59,151 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:59,151 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:59,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:59,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1407383114, now seen corresponding path program 1 times [2019-09-10 07:39:59,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:59,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:59,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:59,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:59,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:59,229 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 07:39:59,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:59,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:59,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:59,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:59,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:59,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:59,231 INFO L87 Difference]: Start difference. First operand 494 states and 730 transitions. Second operand 5 states. [2019-09-10 07:39:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:59,389 INFO L93 Difference]: Finished difference Result 494 states and 721 transitions. [2019-09-10 07:39:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:59,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:39:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:59,393 INFO L225 Difference]: With dead ends: 494 [2019-09-10 07:39:59,394 INFO L226 Difference]: Without dead ends: 494 [2019-09-10 07:39:59,394 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 07:39:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-10 07:39:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2019-09-10 07:39:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-09-10 07:39:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 721 transitions. [2019-09-10 07:39:59,411 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 721 transitions. Word has length 71 [2019-09-10 07:39:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:59,412 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 721 transitions. [2019-09-10 07:39:59,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 721 transitions. [2019-09-10 07:39:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:39:59,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:59,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:59,414 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:59,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1356671875, now seen corresponding path program 1 times [2019-09-10 07:39:59,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:59,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:59,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:59,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:59,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:59,519 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 07:39:59,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:59,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:59,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:59,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:59,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:59,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:59,522 INFO L87 Difference]: Start difference. First operand 494 states and 721 transitions. Second operand 5 states. [2019-09-10 07:39:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:59,612 INFO L93 Difference]: Finished difference Result 999 states and 1477 transitions. [2019-09-10 07:39:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:59,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 07:39:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:59,618 INFO L225 Difference]: With dead ends: 999 [2019-09-10 07:39:59,618 INFO L226 Difference]: Without dead ends: 999 [2019-09-10 07:39:59,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:39:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-09-10 07:39:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 683. [2019-09-10 07:39:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-09-10 07:39:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1009 transitions. [2019-09-10 07:39:59,638 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1009 transitions. Word has length 72 [2019-09-10 07:39:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:59,639 INFO L475 AbstractCegarLoop]: Abstraction has 683 states and 1009 transitions. [2019-09-10 07:39:59,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1009 transitions. [2019-09-10 07:39:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:39:59,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:59,641 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:59,641 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:59,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1297238062, now seen corresponding path program 1 times [2019-09-10 07:39:59,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:59,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:59,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:59,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:59,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:59,751 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 07:39:59,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:59,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:59,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:59,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:59,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:59,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:59,753 INFO L87 Difference]: Start difference. First operand 683 states and 1009 transitions. Second operand 5 states. [2019-09-10 07:39:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:59,840 INFO L93 Difference]: Finished difference Result 1361 states and 2029 transitions. [2019-09-10 07:39:59,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:59,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 07:39:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:59,848 INFO L225 Difference]: With dead ends: 1361 [2019-09-10 07:39:59,848 INFO L226 Difference]: Without dead ends: 1361 [2019-09-10 07:39:59,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:39:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-09-10 07:39:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1109. [2019-09-10 07:39:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2019-09-10 07:39:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1657 transitions. [2019-09-10 07:39:59,879 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1657 transitions. Word has length 72 [2019-09-10 07:39:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:59,879 INFO L475 AbstractCegarLoop]: Abstraction has 1109 states and 1657 transitions. [2019-09-10 07:39:59,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1657 transitions. [2019-09-10 07:39:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:39:59,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:59,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:59,881 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:59,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1086026633, now seen corresponding path program 1 times [2019-09-10 07:39:59,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:59,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:59,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:59,935 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 07:39:59,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:59,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:59,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:59,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:59,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:59,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:59,937 INFO L87 Difference]: Start difference. First operand 1109 states and 1657 transitions. Second operand 3 states. [2019-09-10 07:39:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:59,976 INFO L93 Difference]: Finished difference Result 1941 states and 2850 transitions. [2019-09-10 07:39:59,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:59,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-10 07:39:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:59,986 INFO L225 Difference]: With dead ends: 1941 [2019-09-10 07:39:59,986 INFO L226 Difference]: Without dead ends: 1941 [2019-09-10 07:39:59,986 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 07:39:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2019-09-10 07:40:00,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1939. [2019-09-10 07:40:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-09-10 07:40:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2849 transitions. [2019-09-10 07:40:00,041 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2849 transitions. Word has length 72 [2019-09-10 07:40:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:00,041 INFO L475 AbstractCegarLoop]: Abstraction has 1939 states and 2849 transitions. [2019-09-10 07:40:00,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2849 transitions. [2019-09-10 07:40:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:40:00,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:00,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:00,043 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:00,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:00,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1254792648, now seen corresponding path program 1 times [2019-09-10 07:40:00,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:00,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:00,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:00,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:00,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:00,102 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 07:40:00,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:00,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:40:00,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:00,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:40:00,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:40:00,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:00,104 INFO L87 Difference]: Start difference. First operand 1939 states and 2849 transitions. Second operand 3 states. [2019-09-10 07:40:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:00,157 INFO L93 Difference]: Finished difference Result 1941 states and 2842 transitions. [2019-09-10 07:40:00,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:40:00,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-10 07:40:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:00,168 INFO L225 Difference]: With dead ends: 1941 [2019-09-10 07:40:00,168 INFO L226 Difference]: Without dead ends: 1941 [2019-09-10 07:40:00,169 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 07:40:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2019-09-10 07:40:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1939. [2019-09-10 07:40:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-09-10 07:40:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2841 transitions. [2019-09-10 07:40:00,231 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2841 transitions. Word has length 72 [2019-09-10 07:40:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:00,231 INFO L475 AbstractCegarLoop]: Abstraction has 1939 states and 2841 transitions. [2019-09-10 07:40:00,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:00,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2841 transitions. [2019-09-10 07:40:00,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:40:00,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:00,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:00,234 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:00,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:00,234 INFO L82 PathProgramCache]: Analyzing trace with hash -316518681, now seen corresponding path program 1 times [2019-09-10 07:40:00,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:00,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:00,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:00,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:00,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:00,372 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 07:40:00,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:00,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:40:00,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:00,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:40:00,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:40:00,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:40:00,379 INFO L87 Difference]: Start difference. First operand 1939 states and 2841 transitions. Second operand 6 states. [2019-09-10 07:40:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:00,563 INFO L93 Difference]: Finished difference Result 5931 states and 8703 transitions. [2019-09-10 07:40:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:40:00,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-10 07:40:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:00,602 INFO L225 Difference]: With dead ends: 5931 [2019-09-10 07:40:00,602 INFO L226 Difference]: Without dead ends: 5931 [2019-09-10 07:40:00,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:40:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2019-09-10 07:40:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 2665. [2019-09-10 07:40:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2665 states. [2019-09-10 07:40:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 3907 transitions. [2019-09-10 07:40:00,709 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 3907 transitions. Word has length 72 [2019-09-10 07:40:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:00,710 INFO L475 AbstractCegarLoop]: Abstraction has 2665 states and 3907 transitions. [2019-09-10 07:40:00,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:40:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 3907 transitions. [2019-09-10 07:40:00,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:40:00,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:00,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:00,713 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:00,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash -413972804, now seen corresponding path program 1 times [2019-09-10 07:40:00,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:00,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:00,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:00,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:00,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:00,814 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 07:40:00,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:00,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:40:00,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:00,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:40:00,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:40:00,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:40:00,816 INFO L87 Difference]: Start difference. First operand 2665 states and 3907 transitions. Second operand 5 states. [2019-09-10 07:40:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:00,908 INFO L93 Difference]: Finished difference Result 3539 states and 5185 transitions. [2019-09-10 07:40:00,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:40:00,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 07:40:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:00,925 INFO L225 Difference]: With dead ends: 3539 [2019-09-10 07:40:00,925 INFO L226 Difference]: Without dead ends: 3539 [2019-09-10 07:40:00,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:40:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2019-09-10 07:40:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 3037. [2019-09-10 07:40:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3037 states. [2019-09-10 07:40:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 4457 transitions. [2019-09-10 07:40:01,022 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 4457 transitions. Word has length 72 [2019-09-10 07:40:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:01,022 INFO L475 AbstractCegarLoop]: Abstraction has 3037 states and 4457 transitions. [2019-09-10 07:40:01,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:40:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4457 transitions. [2019-09-10 07:40:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:40:01,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:01,024 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 07:40:01,024 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:01,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash -534576289, now seen corresponding path program 1 times [2019-09-10 07:40:01,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:01,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:01,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:01,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:01,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:01,241 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 07:40:01,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:01,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:40:01,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:01,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:40:01,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:40:01,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:40:01,244 INFO L87 Difference]: Start difference. First operand 3037 states and 4457 transitions. Second operand 10 states. [2019-09-10 07:40:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:01,990 INFO L93 Difference]: Finished difference Result 6080 states and 8866 transitions. [2019-09-10 07:40:01,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:40:01,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-09-10 07:40:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:02,017 INFO L225 Difference]: With dead ends: 6080 [2019-09-10 07:40:02,017 INFO L226 Difference]: Without dead ends: 6080 [2019-09-10 07:40:02,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:40:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6080 states. [2019-09-10 07:40:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6080 to 3037. [2019-09-10 07:40:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3037 states. [2019-09-10 07:40:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 4448 transitions. [2019-09-10 07:40:02,100 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 4448 transitions. Word has length 73 [2019-09-10 07:40:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:02,100 INFO L475 AbstractCegarLoop]: Abstraction has 3037 states and 4448 transitions. [2019-09-10 07:40:02,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:40:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4448 transitions. [2019-09-10 07:40:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:40:02,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:02,102 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:02,102 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:02,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash -558530542, now seen corresponding path program 1 times [2019-09-10 07:40:02,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:02,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:02,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:02,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:02,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:02,304 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 07:40:02,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:02,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:40:02,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:02,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:40:02,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:40:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:02,306 INFO L87 Difference]: Start difference. First operand 3037 states and 4448 transitions. Second operand 9 states. [2019-09-10 07:40:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:02,744 INFO L93 Difference]: Finished difference Result 4489 states and 6580 transitions. [2019-09-10 07:40:02,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 07:40:02,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-09-10 07:40:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:02,764 INFO L225 Difference]: With dead ends: 4489 [2019-09-10 07:40:02,764 INFO L226 Difference]: Without dead ends: 4489 [2019-09-10 07:40:02,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:40:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2019-09-10 07:40:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 3037. [2019-09-10 07:40:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3037 states. [2019-09-10 07:40:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 4447 transitions. [2019-09-10 07:40:02,851 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 4447 transitions. Word has length 74 [2019-09-10 07:40:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:02,852 INFO L475 AbstractCegarLoop]: Abstraction has 3037 states and 4447 transitions. [2019-09-10 07:40:02,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:40:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4447 transitions. [2019-09-10 07:40:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:40:02,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:02,853 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:02,854 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash -862822767, now seen corresponding path program 1 times [2019-09-10 07:40:02,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:02,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:02,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:02,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:03,061 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 07:40:03,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:03,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:40:03,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:03,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:40:03,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:40:03,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:40:03,063 INFO L87 Difference]: Start difference. First operand 3037 states and 4447 transitions. Second operand 10 states. [2019-09-10 07:40:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:03,869 INFO L93 Difference]: Finished difference Result 6095 states and 8880 transitions. [2019-09-10 07:40:03,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:40:03,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-10 07:40:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:03,889 INFO L225 Difference]: With dead ends: 6095 [2019-09-10 07:40:03,890 INFO L226 Difference]: Without dead ends: 6095 [2019-09-10 07:40:03,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:40:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2019-09-10 07:40:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 3037. [2019-09-10 07:40:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3037 states. [2019-09-10 07:40:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 4441 transitions. [2019-09-10 07:40:03,953 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 4441 transitions. Word has length 74 [2019-09-10 07:40:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:03,954 INFO L475 AbstractCegarLoop]: Abstraction has 3037 states and 4441 transitions. [2019-09-10 07:40:03,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:40:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4441 transitions. [2019-09-10 07:40:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:40:03,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:03,955 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:03,956 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:03,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:03,956 INFO L82 PathProgramCache]: Analyzing trace with hash 551115414, now seen corresponding path program 1 times [2019-09-10 07:40:03,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:03,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:03,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:03,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:03,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:04,202 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 07:40:04,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:04,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:40:04,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:04,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:40:04,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:40:04,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:40:04,206 INFO L87 Difference]: Start difference. First operand 3037 states and 4441 transitions. Second operand 10 states. [2019-09-10 07:40:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:05,496 INFO L93 Difference]: Finished difference Result 5706 states and 8305 transitions. [2019-09-10 07:40:05,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:40:05,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-09-10 07:40:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:05,508 INFO L225 Difference]: With dead ends: 5706 [2019-09-10 07:40:05,508 INFO L226 Difference]: Without dead ends: 5706 [2019-09-10 07:40:05,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:40:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2019-09-10 07:40:05,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 3037. [2019-09-10 07:40:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3037 states. [2019-09-10 07:40:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 4438 transitions. [2019-09-10 07:40:05,572 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 4438 transitions. Word has length 75 [2019-09-10 07:40:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:05,572 INFO L475 AbstractCegarLoop]: Abstraction has 3037 states and 4438 transitions. [2019-09-10 07:40:05,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:40:05,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4438 transitions. [2019-09-10 07:40:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:40:05,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:05,574 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 07:40:05,574 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:05,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:05,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1743128931, now seen corresponding path program 1 times [2019-09-10 07:40:05,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:05,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:05,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:06,310 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 07:40:07,375 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 07:40:07,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:07,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 07:40:07,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:07,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 07:40:07,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 07:40:07,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:40:07,377 INFO L87 Difference]: Start difference. First operand 3037 states and 4438 transitions. Second operand 24 states. [2019-09-10 07:40:07,546 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:40:08,238 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 07:40:08,403 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-10 07:40:08,661 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:40:08,952 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:40:09,242 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:40:09,647 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 07:40:10,134 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 109 [2019-09-10 07:40:11,486 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 132 DAG size of output: 128 [2019-09-10 07:40:11,776 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:40:12,077 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:40:12,429 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-09-10 07:40:12,769 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 07:40:12,971 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:40:13,176 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-10 07:40:13,343 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 07:40:13,694 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:40:14,091 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:40:14,434 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:40:14,832 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:40:16,673 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-10 07:40:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:17,094 INFO L93 Difference]: Finished difference Result 15374 states and 22592 transitions. [2019-09-10 07:40:17,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 07:40:17,094 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2019-09-10 07:40:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:17,125 INFO L225 Difference]: With dead ends: 15374 [2019-09-10 07:40:17,125 INFO L226 Difference]: Without dead ends: 15374 [2019-09-10 07:40:17,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=546, Invalid=2210, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 07:40:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15374 states. [2019-09-10 07:40:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15374 to 3041. [2019-09-10 07:40:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3041 states. [2019-09-10 07:40:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4440 transitions. [2019-09-10 07:40:17,241 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4440 transitions. Word has length 76 [2019-09-10 07:40:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:17,242 INFO L475 AbstractCegarLoop]: Abstraction has 3041 states and 4440 transitions. [2019-09-10 07:40:17,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 07:40:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4440 transitions. [2019-09-10 07:40:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:40:17,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:17,243 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 07:40:17,244 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:17,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:17,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1066393092, now seen corresponding path program 1 times [2019-09-10 07:40:17,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:17,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:17,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:17,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:17,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:18,229 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 07:40:18,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:18,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:40:18,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:18,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:40:18,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:40:18,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:40:18,231 INFO L87 Difference]: Start difference. First operand 3041 states and 4440 transitions. Second operand 19 states. [2019-09-10 07:40:18,799 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 07:40:18,987 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:40:19,374 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:40:19,804 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 07:40:19,966 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:40:20,371 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:40:20,708 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:40:20,883 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:40:21,134 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:40:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:21,958 INFO L93 Difference]: Finished difference Result 12406 states and 18218 transitions. [2019-09-10 07:40:21,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:40:21,958 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2019-09-10 07:40:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:21,982 INFO L225 Difference]: With dead ends: 12406 [2019-09-10 07:40:21,982 INFO L226 Difference]: Without dead ends: 12406 [2019-09-10 07:40:21,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:40:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12406 states. [2019-09-10 07:40:22,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12406 to 3035. [2019-09-10 07:40:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-09-10 07:40:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4426 transitions. [2019-09-10 07:40:22,086 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4426 transitions. Word has length 76 [2019-09-10 07:40:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:22,087 INFO L475 AbstractCegarLoop]: Abstraction has 3035 states and 4426 transitions. [2019-09-10 07:40:22,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:40:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4426 transitions. [2019-09-10 07:40:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:40:22,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:22,088 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 07:40:22,089 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1096969605, now seen corresponding path program 1 times [2019-09-10 07:40:22,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:22,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:22,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:22,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:22,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:23,433 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 07:40:23,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:23,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 07:40:23,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:23,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:40:23,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:40:23,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:40:23,435 INFO L87 Difference]: Start difference. First operand 3035 states and 4426 transitions. Second operand 22 states. [2019-09-10 07:40:24,327 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 07:40:24,545 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 07:40:24,840 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-09-10 07:40:25,157 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2019-09-10 07:40:25,547 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 85 [2019-09-10 07:40:25,773 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 07:40:26,019 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 07:40:26,339 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 07:40:26,651 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:40:26,904 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:40:27,250 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 07:40:27,531 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 07:40:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:29,947 INFO L93 Difference]: Finished difference Result 8859 states and 12975 transitions. [2019-09-10 07:40:29,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:40:29,947 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2019-09-10 07:40:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:29,968 INFO L225 Difference]: With dead ends: 8859 [2019-09-10 07:40:29,968 INFO L226 Difference]: Without dead ends: 8859 [2019-09-10 07:40:29,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=392, Invalid=1414, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:40:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8859 states. [2019-09-10 07:40:30,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8859 to 3040. [2019-09-10 07:40:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3040 states. [2019-09-10 07:40:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 4431 transitions. [2019-09-10 07:40:30,048 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 4431 transitions. Word has length 76 [2019-09-10 07:40:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:30,049 INFO L475 AbstractCegarLoop]: Abstraction has 3040 states and 4431 transitions. [2019-09-10 07:40:30,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:40:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 4431 transitions. [2019-09-10 07:40:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:40:30,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:30,051 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 07:40:30,051 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:30,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1433675777, now seen corresponding path program 1 times [2019-09-10 07:40:30,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:30,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:30,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:30,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:30,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:30,458 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 07:40:30,688 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 07:40:30,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:30,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:40:30,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:30,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:40:30,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:40:30,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:40:30,692 INFO L87 Difference]: Start difference. First operand 3040 states and 4431 transitions. Second operand 13 states. [2019-09-10 07:40:31,122 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-09-10 07:40:31,295 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 07:40:31,477 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:40:31,631 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:40:31,774 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 07:40:31,944 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 07:40:32,225 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 07:40:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:32,485 INFO L93 Difference]: Finished difference Result 8071 states and 11826 transitions. [2019-09-10 07:40:32,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:40:32,485 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-09-10 07:40:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:32,499 INFO L225 Difference]: With dead ends: 8071 [2019-09-10 07:40:32,499 INFO L226 Difference]: Without dead ends: 8071 [2019-09-10 07:40:32,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:40:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8071 states. [2019-09-10 07:40:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8071 to 3005. [2019-09-10 07:40:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2019-09-10 07:40:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 4387 transitions. [2019-09-10 07:40:32,585 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 4387 transitions. Word has length 77 [2019-09-10 07:40:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:32,585 INFO L475 AbstractCegarLoop]: Abstraction has 3005 states and 4387 transitions. [2019-09-10 07:40:32,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:40:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 4387 transitions. [2019-09-10 07:40:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:40:32,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:32,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, 1, 1, 1, 1] [2019-09-10 07:40:32,587 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:32,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:32,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1127829965, now seen corresponding path program 1 times [2019-09-10 07:40:32,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:32,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:32,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:32,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:32,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:32,675 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 07:40:32,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:32,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:40:32,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:32,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:40:32,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:40:32,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:40:32,676 INFO L87 Difference]: Start difference. First operand 3005 states and 4387 transitions. Second operand 4 states. [2019-09-10 07:40:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:32,715 INFO L93 Difference]: Finished difference Result 4282 states and 6239 transitions. [2019-09-10 07:40:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:40:32,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-10 07:40:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:32,721 INFO L225 Difference]: With dead ends: 4282 [2019-09-10 07:40:32,722 INFO L226 Difference]: Without dead ends: 4282 [2019-09-10 07:40:32,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:40:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2019-09-10 07:40:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 4280. [2019-09-10 07:40:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2019-09-10 07:40:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 6238 transitions. [2019-09-10 07:40:32,778 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 6238 transitions. Word has length 77 [2019-09-10 07:40:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:32,778 INFO L475 AbstractCegarLoop]: Abstraction has 4280 states and 6238 transitions. [2019-09-10 07:40:32,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:40:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 6238 transitions. [2019-09-10 07:40:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:40:32,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:32,779 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 07:40:32,780 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:32,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:32,780 INFO L82 PathProgramCache]: Analyzing trace with hash -351296585, now seen corresponding path program 1 times [2019-09-10 07:40:32,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:32,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:32,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:32,884 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 07:40:32,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:32,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:40:32,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:32,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:40:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:40:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:40:32,886 INFO L87 Difference]: Start difference. First operand 4280 states and 6238 transitions. Second operand 5 states. [2019-09-10 07:40:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:32,942 INFO L93 Difference]: Finished difference Result 6866 states and 9946 transitions. [2019-09-10 07:40:32,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:40:32,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 07:40:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:32,954 INFO L225 Difference]: With dead ends: 6866 [2019-09-10 07:40:32,954 INFO L226 Difference]: Without dead ends: 6866 [2019-09-10 07:40:32,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:40:32,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6866 states. [2019-09-10 07:40:33,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6866 to 4320. [2019-09-10 07:40:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4320 states. [2019-09-10 07:40:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4320 states to 4320 states and 6262 transitions. [2019-09-10 07:40:33,026 INFO L78 Accepts]: Start accepts. Automaton has 4320 states and 6262 transitions. Word has length 77 [2019-09-10 07:40:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:33,027 INFO L475 AbstractCegarLoop]: Abstraction has 4320 states and 6262 transitions. [2019-09-10 07:40:33,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:40:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4320 states and 6262 transitions. [2019-09-10 07:40:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:40:33,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:33,029 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 07:40:33,030 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:33,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1786573686, now seen corresponding path program 1 times [2019-09-10 07:40:33,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:33,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:33,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:33,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:33,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:33,725 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 07:40:33,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:33,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:40:33,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:33,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:40:33,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:40:33,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:40:33,726 INFO L87 Difference]: Start difference. First operand 4320 states and 6262 transitions. Second operand 14 states. [2019-09-10 07:40:34,288 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:40:34,520 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:40:34,738 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 07:40:34,915 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 07:40:35,193 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 07:40:35,470 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:40:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:35,825 INFO L93 Difference]: Finished difference Result 16893 states and 24603 transitions. [2019-09-10 07:40:35,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:40:35,827 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2019-09-10 07:40:35,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:35,847 INFO L225 Difference]: With dead ends: 16893 [2019-09-10 07:40:35,847 INFO L226 Difference]: Without dead ends: 16893 [2019-09-10 07:40:35,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:40:35,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16893 states. [2019-09-10 07:40:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16893 to 4317. [2019-09-10 07:40:35,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4317 states. [2019-09-10 07:40:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 6255 transitions. [2019-09-10 07:40:35,986 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 6255 transitions. Word has length 77 [2019-09-10 07:40:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:35,986 INFO L475 AbstractCegarLoop]: Abstraction has 4317 states and 6255 transitions. [2019-09-10 07:40:35,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:40:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 6255 transitions. [2019-09-10 07:40:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:40:35,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:35,988 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:35,988 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:35,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:35,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1990630795, now seen corresponding path program 1 times [2019-09-10 07:40:35,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:35,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:35,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:35,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:35,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:36,634 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-10 07:40:36,840 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 07:40:36,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:36,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:40:36,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:36,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:40:36,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:40:36,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:40:36,841 INFO L87 Difference]: Start difference. First operand 4317 states and 6255 transitions. Second operand 14 states. [2019-09-10 07:40:37,283 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-09-10 07:40:37,434 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 07:40:37,582 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 07:40:37,723 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:40:37,936 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:40:38,152 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:40:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:38,525 INFO L93 Difference]: Finished difference Result 16919 states and 24632 transitions. [2019-09-10 07:40:38,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:40:38,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 78 [2019-09-10 07:40:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:38,543 INFO L225 Difference]: With dead ends: 16919 [2019-09-10 07:40:38,543 INFO L226 Difference]: Without dead ends: 16919 [2019-09-10 07:40:38,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:40:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16919 states. [2019-09-10 07:40:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16919 to 4297. [2019-09-10 07:40:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4297 states. [2019-09-10 07:40:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 6231 transitions. [2019-09-10 07:40:38,675 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 6231 transitions. Word has length 78 [2019-09-10 07:40:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:38,675 INFO L475 AbstractCegarLoop]: Abstraction has 4297 states and 6231 transitions. [2019-09-10 07:40:38,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:40:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 6231 transitions. [2019-09-10 07:40:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:40:38,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:38,677 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 07:40:38,677 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:38,678 INFO L82 PathProgramCache]: Analyzing trace with hash -692602443, now seen corresponding path program 1 times [2019-09-10 07:40:38,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:38,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:38,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:38,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:39,983 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:40:40,515 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 07:40:40,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:40,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 07:40:40,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:40,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 07:40:40,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 07:40:40,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:40:40,517 INFO L87 Difference]: Start difference. First operand 4297 states and 6231 transitions. Second operand 25 states. [2019-09-10 07:40:40,686 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 07:40:41,222 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:40:41,424 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 07:40:41,707 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:40:41,954 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:40:42,247 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 07:40:42,537 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-10 07:40:42,847 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-10 07:40:43,303 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2019-09-10 07:40:43,598 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 07:40:43,869 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 07:40:44,028 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:40:44,296 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-09-10 07:40:44,445 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:40:44,732 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-10 07:40:45,001 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:40:45,343 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:40:45,558 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:40:45,778 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:40:46,027 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:40:49,625 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:40:50,374 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 07:40:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:50,941 INFO L93 Difference]: Finished difference Result 39523 states and 57583 transitions. [2019-09-10 07:40:50,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 07:40:50,942 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 78 [2019-09-10 07:40:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:50,994 INFO L225 Difference]: With dead ends: 39523 [2019-09-10 07:40:50,994 INFO L226 Difference]: Without dead ends: 39523 [2019-09-10 07:40:50,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=513, Invalid=2457, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 07:40:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39523 states. [2019-09-10 07:40:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39523 to 4301. [2019-09-10 07:40:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4301 states. [2019-09-10 07:40:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4301 states to 4301 states and 6235 transitions. [2019-09-10 07:40:51,267 INFO L78 Accepts]: Start accepts. Automaton has 4301 states and 6235 transitions. Word has length 78 [2019-09-10 07:40:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:51,268 INFO L475 AbstractCegarLoop]: Abstraction has 4301 states and 6235 transitions. [2019-09-10 07:40:51,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 07:40:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4301 states and 6235 transitions. [2019-09-10 07:40:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:40:51,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:51,269 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 07:40:51,269 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:51,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash -911326508, now seen corresponding path program 1 times [2019-09-10 07:40:51,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:51,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:51,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:51,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:51,784 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 07:40:52,201 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 07:40:52,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:52,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:40:52,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:52,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:40:52,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:40:52,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:40:52,202 INFO L87 Difference]: Start difference. First operand 4301 states and 6235 transitions. Second operand 16 states. [2019-09-10 07:40:52,746 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 07:40:52,949 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-09-10 07:40:53,160 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 07:40:53,323 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:40:53,485 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:40:53,708 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:40:53,911 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 07:40:54,083 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 07:40:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:55,162 INFO L93 Difference]: Finished difference Result 10883 states and 15832 transitions. [2019-09-10 07:40:55,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:40:55,163 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2019-09-10 07:40:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:55,172 INFO L225 Difference]: With dead ends: 10883 [2019-09-10 07:40:55,172 INFO L226 Difference]: Without dead ends: 10883 [2019-09-10 07:40:55,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:40:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2019-09-10 07:40:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 4297. [2019-09-10 07:40:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4297 states. [2019-09-10 07:40:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 6230 transitions. [2019-09-10 07:40:55,251 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 6230 transitions. Word has length 78 [2019-09-10 07:40:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:55,252 INFO L475 AbstractCegarLoop]: Abstraction has 4297 states and 6230 transitions. [2019-09-10 07:40:55,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:40:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 6230 transitions. [2019-09-10 07:40:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:40:55,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:55,253 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] [2019-09-10 07:40:55,253 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:55,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash -249763912, now seen corresponding path program 1 times [2019-09-10 07:40:55,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:55,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:55,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:55,797 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 07:40:55,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:55,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:40:55,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:55,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:40:55,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:40:55,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:40:55,799 INFO L87 Difference]: Start difference. First operand 4297 states and 6230 transitions. Second operand 12 states. [2019-09-10 07:40:56,459 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:40:56,669 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:40:56,879 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:40:57,054 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:40:57,246 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:40:57,437 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 07:40:57,612 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 07:40:57,801 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:40:57,994 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:40:58,185 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:40:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:58,481 INFO L93 Difference]: Finished difference Result 17204 states and 25126 transitions. [2019-09-10 07:40:58,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:40:58,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2019-09-10 07:40:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:58,499 INFO L225 Difference]: With dead ends: 17204 [2019-09-10 07:40:58,499 INFO L226 Difference]: Without dead ends: 17204 [2019-09-10 07:40:58,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:40:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17204 states. [2019-09-10 07:40:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17204 to 4191. [2019-09-10 07:40:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4191 states. [2019-09-10 07:40:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 6083 transitions. [2019-09-10 07:40:58,585 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 6083 transitions. Word has length 79 [2019-09-10 07:40:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:58,586 INFO L475 AbstractCegarLoop]: Abstraction has 4191 states and 6083 transitions. [2019-09-10 07:40:58,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:40:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 6083 transitions. [2019-09-10 07:40:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:40:58,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:58,589 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:58,589 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:58,590 INFO L82 PathProgramCache]: Analyzing trace with hash -252969834, now seen corresponding path program 1 times [2019-09-10 07:40:58,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:58,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:58,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:58,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:58,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:58,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:58,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:40:58,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:58,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:40:58,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:40:58,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:58,643 INFO L87 Difference]: Start difference. First operand 4191 states and 6083 transitions. Second operand 3 states. [2019-09-10 07:40:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:58,676 INFO L93 Difference]: Finished difference Result 7923 states and 11332 transitions. [2019-09-10 07:40:58,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:40:58,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:40:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:58,684 INFO L225 Difference]: With dead ends: 7923 [2019-09-10 07:40:58,684 INFO L226 Difference]: Without dead ends: 7923 [2019-09-10 07:40:58,685 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 07:40:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7923 states. [2019-09-10 07:40:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7923 to 7553. [2019-09-10 07:40:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7553 states. [2019-09-10 07:40:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7553 states to 7553 states and 10871 transitions. [2019-09-10 07:40:58,755 INFO L78 Accepts]: Start accepts. Automaton has 7553 states and 10871 transitions. Word has length 101 [2019-09-10 07:40:58,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:58,755 INFO L475 AbstractCegarLoop]: Abstraction has 7553 states and 10871 transitions. [2019-09-10 07:40:58,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand 7553 states and 10871 transitions. [2019-09-10 07:40:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:40:58,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:58,758 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:58,758 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:58,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:58,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1870600444, now seen corresponding path program 1 times [2019-09-10 07:40:58,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:58,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:58,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:58,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:58,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:58,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:58,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:40:58,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:58,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:40:58,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:40:58,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:58,813 INFO L87 Difference]: Start difference. First operand 7553 states and 10871 transitions. Second operand 3 states. [2019-09-10 07:40:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:58,869 INFO L93 Difference]: Finished difference Result 14279 states and 20172 transitions. [2019-09-10 07:40:58,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:40:58,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:40:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:58,888 INFO L225 Difference]: With dead ends: 14279 [2019-09-10 07:40:58,888 INFO L226 Difference]: Without dead ends: 14279 [2019-09-10 07:40:58,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14279 states. [2019-09-10 07:40:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14279 to 13633. [2019-09-10 07:40:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13633 states. [2019-09-10 07:40:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13633 states to 13633 states and 19343 transitions. [2019-09-10 07:40:59,103 INFO L78 Accepts]: Start accepts. Automaton has 13633 states and 19343 transitions. Word has length 102 [2019-09-10 07:40:59,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:59,104 INFO L475 AbstractCegarLoop]: Abstraction has 13633 states and 19343 transitions. [2019-09-10 07:40:59,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 13633 states and 19343 transitions. [2019-09-10 07:40:59,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:40:59,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:59,107 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:59,107 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:59,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:59,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1255908476, now seen corresponding path program 1 times [2019-09-10 07:40:59,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:59,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:59,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:59,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:59,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:59,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:59,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:40:59,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:59,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:40:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:40:59,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:59,162 INFO L87 Difference]: Start difference. First operand 13633 states and 19343 transitions. Second operand 3 states. [2019-09-10 07:40:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:59,220 INFO L93 Difference]: Finished difference Result 19415 states and 27298 transitions. [2019-09-10 07:40:59,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:40:59,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 07:40:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:59,241 INFO L225 Difference]: With dead ends: 19415 [2019-09-10 07:40:59,241 INFO L226 Difference]: Without dead ends: 19415 [2019-09-10 07:40:59,243 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 07:40:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2019-09-10 07:40:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 18437. [2019-09-10 07:40:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18437 states. [2019-09-10 07:40:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18437 states to 18437 states and 25955 transitions. [2019-09-10 07:40:59,478 INFO L78 Accepts]: Start accepts. Automaton has 18437 states and 25955 transitions. Word has length 103 [2019-09-10 07:40:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:59,479 INFO L475 AbstractCegarLoop]: Abstraction has 18437 states and 25955 transitions. [2019-09-10 07:40:59,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 18437 states and 25955 transitions. [2019-09-10 07:40:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:40:59,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:59,480 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:40:59,481 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:59,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:59,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1449436591, now seen corresponding path program 1 times [2019-09-10 07:40:59,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:59,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:59,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:59,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:59,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:59,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:59,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:40:59,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:59,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:40:59,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:40:59,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:40:59,538 INFO L87 Difference]: Start difference. First operand 18437 states and 25955 transitions. Second operand 5 states. [2019-09-10 07:40:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:59,817 INFO L93 Difference]: Finished difference Result 39107 states and 52894 transitions. [2019-09-10 07:40:59,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:40:59,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 07:40:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:59,850 INFO L225 Difference]: With dead ends: 39107 [2019-09-10 07:40:59,851 INFO L226 Difference]: Without dead ends: 39107 [2019-09-10 07:40:59,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39107 states. [2019-09-10 07:41:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39107 to 19677. [2019-09-10 07:41:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19677 states. [2019-09-10 07:41:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19677 states to 19677 states and 27195 transitions. [2019-09-10 07:41:00,094 INFO L78 Accepts]: Start accepts. Automaton has 19677 states and 27195 transitions. Word has length 105 [2019-09-10 07:41:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:00,095 INFO L475 AbstractCegarLoop]: Abstraction has 19677 states and 27195 transitions. [2019-09-10 07:41:00,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:41:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 19677 states and 27195 transitions. [2019-09-10 07:41:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:41:00,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:00,101 INFO L399 BasicCegarLoop]: trace histogram [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, 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 07:41:00,101 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:00,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:00,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1023699448, now seen corresponding path program 1 times [2019-09-10 07:41:00,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:00,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:00,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:00,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:00,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:41:00,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:00,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:41:00,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:00,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:41:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:41:00,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:00,274 INFO L87 Difference]: Start difference. First operand 19677 states and 27195 transitions. Second operand 3 states. [2019-09-10 07:41:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:00,382 INFO L93 Difference]: Finished difference Result 36995 states and 49792 transitions. [2019-09-10 07:41:00,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:41:00,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 07:41:00,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:00,422 INFO L225 Difference]: With dead ends: 36995 [2019-09-10 07:41:00,422 INFO L226 Difference]: Without dead ends: 36995 [2019-09-10 07:41:00,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36995 states. [2019-09-10 07:41:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36995 to 33769. [2019-09-10 07:41:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33769 states. [2019-09-10 07:41:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33769 states to 33769 states and 46071 transitions. [2019-09-10 07:41:00,790 INFO L78 Accepts]: Start accepts. Automaton has 33769 states and 46071 transitions. Word has length 128 [2019-09-10 07:41:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:00,790 INFO L475 AbstractCegarLoop]: Abstraction has 33769 states and 46071 transitions. [2019-09-10 07:41:00,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:41:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 33769 states and 46071 transitions. [2019-09-10 07:41:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:41:00,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:00,799 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:00,799 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1639758373, now seen corresponding path program 1 times [2019-09-10 07:41:00,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:00,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:00,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:00,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:00,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:01,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:01,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:01,081 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 07:41:01,082 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [87], [91], [94], [97], [99], [103], [106], [109], [111], [115], [118], [121], [123], [126], [130], [133], [136], [140], [143], [146], [149], [152], [154], [157], [160], [163], [165], [168], [171], [174], [176], [179], [182], [185], [187], [189], [192], [195], [199], [201], [204], [205], [207], [210], [213], [221], [223], [226], [234], [236], [239], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [296], [298], [301], [304], [306], [321], [323], [326], [329], [331], [346], [348], [351], [354], [356], [365], [370], [372], [375], [463], [464], [468], [469], [470] [2019-09-10 07:41:01,122 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:01,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:01,235 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:01,991 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:01,993 INFO L272 AbstractInterpreter]: Visited 114 different actions 619 times. Merged at 45 different actions 432 times. Widened at 18 different actions 77 times. Performed 2267 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2267 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 76 fixpoints after 19 different actions. Largest state had 132 variables. [2019-09-10 07:41:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:02,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:02,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:02,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:41:02,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:02,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:41:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:02,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 07:41:02,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:02,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:03,505 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:03,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:04,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:04,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:04,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:06,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:41:06,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2019-09-10 07:41:06,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:41:06,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:41:06,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:41:06,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:41:06,843 INFO L87 Difference]: Start difference. First operand 33769 states and 46071 transitions. Second operand 20 states. [2019-09-10 07:41:08,562 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:41:08,905 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:41:09,820 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:41:10,034 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:41:10,373 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:41:10,935 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:41:11,144 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:41:11,464 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 07:41:11,641 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:41:11,782 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:41:11,944 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:41:12,094 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 07:41:12,448 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 07:41:12,634 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:41:13,170 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:41:13,339 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:41:13,522 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:41:13,995 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:41:14,229 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 07:41:14,524 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:41:14,690 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:41:14,886 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 07:41:15,111 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:41:15,403 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:41:15,804 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:41:16,064 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:41:16,304 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:41:16,649 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:41:16,855 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:41:17,112 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:41:17,271 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:41:17,465 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:41:18,155 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:41:18,389 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 07:41:18,611 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:41:18,866 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:41:19,127 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:41:19,350 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:41:19,582 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:41:19,912 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:41:20,225 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 07:41:20,433 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:41:20,701 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:41:20,922 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:41:21,134 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:41:21,633 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:41:21,877 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:41:22,198 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:41:31,638 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:41:31,897 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:41:32,305 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:41:33,066 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:41:33,228 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:41:34,165 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:41:35,339 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:41:35,580 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:41:37,459 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:41:37,761 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:41:38,011 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 07:41:38,399 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:41:38,643 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 07:41:39,037 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:41:39,258 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:41:39,590 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:41:39,845 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:41:40,406 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:41:40,605 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 07:41:40,780 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 07:41:40,927 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:41:43,056 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:41:43,292 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:41:43,933 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:41:44,524 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:41:44,783 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 07:41:45,116 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:41:45,420 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 07:41:45,823 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:41:46,204 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:41:46,485 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:41:46,731 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:41:47,042 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:41:47,366 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:41:47,646 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:41:48,319 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:41:48,521 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:41:48,712 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 07:41:48,915 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:41:49,098 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 07:41:49,436 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:41:49,724 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:41:50,011 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:41:50,427 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:41:50,655 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:41:50,921 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:41:51,142 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:41:51,336 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:41:51,523 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-10 07:41:51,702 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:41:51,872 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:41:52,165 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:41:52,492 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 07:41:52,724 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 07:41:52,997 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:41:53,187 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:41:53,401 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:41:53,678 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:41:53,896 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:41:54,193 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:41:54,405 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:41:56,725 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:41:57,070 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 07:41:57,380 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:41:57,706 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:41:59,078 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 07:41:59,263 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-09-10 07:41:59,487 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:42:00,105 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 07:42:00,370 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:42:00,609 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 07:42:00,846 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:42:01,086 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:42:01,373 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:42:01,587 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:42:01,805 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:42:02,212 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 07:42:02,503 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:42:02,743 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:42:03,013 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:42:03,295 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:42:03,478 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:42:03,638 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:42:03,851 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:42:04,021 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:42:04,478 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:42:04,868 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:42:05,091 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:42:05,627 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:42:05,792 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:42:06,683 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:42:06,941 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 07:42:07,165 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:42:07,343 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:42:07,552 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-09-10 07:42:07,748 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 07:42:07,942 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:42:08,159 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:42:08,378 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 07:42:08,584 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 07:42:08,761 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:42:08,914 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 07:42:09,258 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:42:09,479 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:42:09,984 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:42:10,245 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:42:10,459 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:42:10,661 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:42:10,853 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:42:11,119 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 07:42:11,323 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:42:11,531 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 07:42:11,694 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 07:42:11,873 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:42:12,101 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 07:42:12,450 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:42:12,656 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:42:12,842 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:42:13,552 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 07:42:14,033 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:42:14,240 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:42:14,506 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 07:42:14,725 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:42:15,215 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 07:42:15,403 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-09-10 07:42:15,650 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:42:16,047 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:42:16,220 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:42:16,597 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:42:16,776 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:42:17,590 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 07:42:17,933 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:42:18,232 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:42:18,441 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:42:18,713 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-09-10 07:42:18,987 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:42:19,174 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:42:19,423 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:42:19,591 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:42:19,881 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 07:42:20,243 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 07:42:20,643 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:42:20,885 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 07:42:21,093 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:42:21,353 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:42:21,560 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:42:21,764 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:42:21,953 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:42:22,485 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:42:22,788 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:42:23,077 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 07:42:23,362 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 07:42:23,546 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:42:23,834 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:42:23,996 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:42:24,235 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:42:24,405 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:42:24,772 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 07:42:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:26,110 INFO L93 Difference]: Finished difference Result 236076 states and 314075 transitions. [2019-09-10 07:42:26,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2019-09-10 07:42:26,110 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 129 [2019-09-10 07:42:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:26,593 INFO L225 Difference]: With dead ends: 236076 [2019-09-10 07:42:26,594 INFO L226 Difference]: Without dead ends: 236076 [2019-09-10 07:42:26,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 197 SyntacticMatches, 45 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34367 ImplicationChecksByTransitivity, 61.4s TimeCoverageRelationStatistics Valid=10703, Invalid=72529, Unknown=0, NotChecked=0, Total=83232 [2019-09-10 07:42:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236076 states. [2019-09-10 07:42:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236076 to 87361. [2019-09-10 07:42:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87361 states. [2019-09-10 07:42:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87361 states to 87361 states and 117861 transitions. [2019-09-10 07:42:31,282 INFO L78 Accepts]: Start accepts. Automaton has 87361 states and 117861 transitions. Word has length 129 [2019-09-10 07:42:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:31,282 INFO L475 AbstractCegarLoop]: Abstraction has 87361 states and 117861 transitions. [2019-09-10 07:42:31,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:42:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 87361 states and 117861 transitions. [2019-09-10 07:42:31,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:42:31,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:31,302 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 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 07:42:31,303 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:31,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:31,303 INFO L82 PathProgramCache]: Analyzing trace with hash 992877774, now seen corresponding path program 1 times [2019-09-10 07:42:31,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:31,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:31,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:31,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:31,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:31,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:31,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:42:31,589 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2019-09-10 07:42:31,589 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [87], [91], [94], [97], [99], [103], [106], [109], [111], [115], [118], [121], [123], [126], [130], [133], [136], [140], [143], [146], [149], [152], [154], [157], [160], [163], [165], [168], [171], [174], [176], [179], [182], [185], [187], [189], [192], [199], [201], [204], [205], [207], [210], [213], [216], [221], [223], [226], [229], [234], [236], [239], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [296], [298], [301], [304], [306], [314], [317], [323], [326], [329], [331], [339], [342], [348], [351], [354], [356], [372], [375], [379], [463], [464], [468], [469], [470] [2019-09-10 07:42:31,599 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:42:31,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:42:31,631 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:42:32,485 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:42:32,486 INFO L272 AbstractInterpreter]: Visited 116 different actions 588 times. Merged at 47 different actions 414 times. Widened at 14 different actions 47 times. Performed 2213 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2213 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 49 fixpoints after 11 different actions. Largest state had 132 variables. [2019-09-10 07:42:32,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:32,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:42:32,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:32,487 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 07:42:32,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:32,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:42:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:32,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:42:32,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:42:32,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:33,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:42:33,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:33,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:34,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:34,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:42:34,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 07:42:34,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:42:34,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:42:34,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:42:34,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:42:34,922 INFO L87 Difference]: Start difference. First operand 87361 states and 117861 transitions. Second operand 21 states. [2019-09-10 07:42:35,463 WARN L188 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 07:42:35,992 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:42:36,711 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:42:37,157 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:42:37,616 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:42:37,945 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:42:38,350 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:42:38,827 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:42:39,721 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:42:40,143 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:42:40,889 WARN L188 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:42:41,226 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:42:41,887 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:42:42,282 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:42:42,956 WARN L188 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:42:43,296 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:42:44,022 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:42:44,352 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:42:45,087 WARN L188 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:42:45,893 WARN L188 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:42:46,770 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 07:42:47,182 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:42:47,733 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:42:48,415 WARN L188 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:42:49,079 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:42:49,617 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 07:42:50,206 WARN L188 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:42:50,725 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:42:51,161 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:42:51,645 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:42:52,029 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:42:52,519 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:42:52,975 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-10 07:42:53,484 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:42:54,020 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:42:54,390 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:42:54,792 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:42:55,335 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:42:55,837 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-10 07:42:56,231 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:42:56,981 WARN L188 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:42:57,337 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 07:42:57,658 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:42:58,098 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:42:58,569 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:42:58,966 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 07:42:59,299 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:42:59,616 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:42:59,882 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:43:00,346 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:43:00,929 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-10 07:43:01,353 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:43:01,989 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:43:02,797 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 07:43:03,301 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:43:03,664 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 07:43:04,169 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:43:04,739 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 07:43:05,169 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:43:05,499 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:43:06,064 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:43:06,629 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:43:07,148 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-10 07:43:07,667 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:43:08,154 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 07:43:08,548 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 07:43:08,891 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 07:43:09,379 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:43:09,958 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:43:10,328 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:43:10,867 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:43:11,340 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-10 07:43:11,790 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:43:12,219 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:43:12,535 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:43:12,881 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:43:14,830 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 07:43:15,218 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:43:15,607 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:43:16,111 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 07:43:16,665 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:43:17,137 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 07:43:17,553 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:43:17,955 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:43:18,502 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:43:18,921 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 07:43:19,567 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 07:43:20,057 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 07:43:20,564 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:43:20,895 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:43:21,457 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:43:21,844 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:43:24,420 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:43:24,931 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-10 07:43:25,767 WARN L188 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:43:26,180 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:43:26,705 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 07:43:27,132 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:43:29,657 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 07:43:30,100 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-09-10 07:43:30,603 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 07:43:30,917 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 07:43:31,352 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-09-10 07:43:31,687 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 07:43:32,114 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:43:32,487 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:43:33,035 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 07:43:33,443 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-09-10 07:43:33,942 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:43:34,424 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:43:34,952 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 07:43:35,330 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:43:35,909 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:43:36,473 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:43:37,001 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:43:37,487 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:43:38,033 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:43:38,522 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:43:38,932 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:43:39,753 WARN L188 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:43:40,220 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 07:43:40,913 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-10 07:43:41,734 WARN L188 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:43:42,327 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:43:42,835 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:43:43,254 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:43:44,017 WARN L188 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-10 07:43:44,579 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:43:45,131 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:43:45,953 WARN L188 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:43:46,434 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:43:47,005 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:43:47,457 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:43:47,873 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:43:48,757 WARN L188 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:43:49,404 WARN L188 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:43:49,818 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:43:50,408 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 07:43:53,091 WARN L188 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:43:53,415 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:43:55,859 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:43:56,384 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 07:43:56,893 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-10 07:43:57,348 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:43:57,836 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:43:58,529 WARN L188 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:43:58,948 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:43:59,536 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:44:00,608 WARN L188 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 07:44:00,997 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:44:01,892 WARN L188 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:44:03,243 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 07:44:03,547 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:44:04,045 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:44:04,466 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 07:44:04,910 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 07:44:05,753 WARN L188 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:44:06,291 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-09-10 07:44:06,727 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 07:44:07,244 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:44:07,827 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:44:08,290 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:44:10,715 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:44:11,189 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-09-10 07:44:11,698 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:44:12,211 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:44:12,775 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:44:13,255 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:44:13,561 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:44:14,091 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-09-10 07:44:14,523 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:44:15,008 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 07:44:15,350 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 07:44:16,030 WARN L188 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-09-10 07:44:16,812 WARN L188 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 07:44:17,408 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-09-10 07:44:17,694 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:44:18,521 WARN L188 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 07:44:19,021 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-10 07:44:19,660 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-09-10 07:44:20,475 WARN L188 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:44:20,871 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:44:22,351 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 07:44:22,885 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:44:23,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:23,885 INFO L93 Difference]: Finished difference Result 1121055 states and 1472544 transitions. [2019-09-10 07:44:23,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-09-10 07:44:23,885 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 130 [2019-09-10 07:44:23,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:32,220 INFO L225 Difference]: With dead ends: 1121055 [2019-09-10 07:44:32,220 INFO L226 Difference]: Without dead ends: 1121055 [2019-09-10 07:44:32,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 219 SyntacticMatches, 23 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16975 ImplicationChecksByTransitivity, 95.8s TimeCoverageRelationStatistics Valid=8490, Invalid=38816, Unknown=0, NotChecked=0, Total=47306 [2019-09-10 07:44:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121055 states. [2019-09-10 07:44:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121055 to 425961. [2019-09-10 07:44:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425961 states. [2019-09-10 07:44:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425961 states to 425961 states and 569352 transitions. [2019-09-10 07:44:40,796 INFO L78 Accepts]: Start accepts. Automaton has 425961 states and 569352 transitions. Word has length 130 [2019-09-10 07:44:40,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:40,797 INFO L475 AbstractCegarLoop]: Abstraction has 425961 states and 569352 transitions. [2019-09-10 07:44:40,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:44:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 425961 states and 569352 transitions. [2019-09-10 07:44:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:44:40,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:40,856 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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 07:44:40,856 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:40,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:40,856 INFO L82 PathProgramCache]: Analyzing trace with hash 27791725, now seen corresponding path program 1 times [2019-09-10 07:44:40,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:41,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:41,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:44:45,830 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:44:45,831 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [87], [91], [94], [97], [99], [103], [106], [109], [111], [115], [118], [121], [123], [126], [130], [133], [136], [140], [143], [146], [149], [152], [154], [157], [160], [165], [168], [171], [176], [179], [182], [185], [187], [189], [192], [199], [201], [204], [205], [207], [210], [213], [216], [221], [223], [226], [229], [234], [236], [239], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [296], [298], [301], [304], [306], [314], [317], [323], [326], [329], [331], [339], [342], [348], [351], [354], [356], [372], [375], [379], [391], [396], [401], [406], [463], [464], [468], [469], [470] [2019-09-10 07:44:45,838 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:44:45,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:44:45,882 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:44:46,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:44:46,362 INFO L272 AbstractInterpreter]: Visited 118 different actions 572 times. Merged at 47 different actions 398 times. Widened at 16 different actions 59 times. Performed 2176 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2176 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 46 fixpoints after 11 different actions. Largest state had 132 variables. [2019-09-10 07:44:46,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:46,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:44:46,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:46,363 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) [2019-09-10 07:44:46,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:46,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:44:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:46,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:44:46,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:44:46,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:46,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:46,899 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:44:46,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:47,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:47,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:47,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:47,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:48,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:48,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:44:48,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 31 [2019-09-10 07:44:48,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:44:48,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:44:48,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:44:48,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:44:48,120 INFO L87 Difference]: Start difference. First operand 425961 states and 569352 transitions. Second operand 20 states. [2019-09-10 07:45:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:05,289 INFO L93 Difference]: Finished difference Result 1864153 states and 2447436 transitions. [2019-09-10 07:45:05,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-10 07:45:05,290 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 132 [2019-09-10 07:45:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:18,474 INFO L225 Difference]: With dead ends: 1864153 [2019-09-10 07:45:18,474 INFO L226 Difference]: Without dead ends: 1864153 [2019-09-10 07:45:18,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 223 SyntacticMatches, 21 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7784 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=3743, Invalid=18013, Unknown=0, NotChecked=0, Total=21756 [2019-09-10 07:45:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864153 states. [2019-09-10 07:45:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864153 to 425861. [2019-09-10 07:45:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425861 states. [2019-09-10 07:45:47,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425861 states to 425861 states and 569248 transitions. [2019-09-10 07:45:47,414 INFO L78 Accepts]: Start accepts. Automaton has 425861 states and 569248 transitions. Word has length 132 [2019-09-10 07:45:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:47,414 INFO L475 AbstractCegarLoop]: Abstraction has 425861 states and 569248 transitions. [2019-09-10 07:45:47,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:45:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 425861 states and 569248 transitions. [2019-09-10 07:45:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:45:47,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:47,444 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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 07:45:47,444 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash -257441054, now seen corresponding path program 1 times [2019-09-10 07:45:47,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:47,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:47,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:47,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:47,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:47,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:47,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:47,733 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:45:47,733 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [87], [91], [94], [97], [99], [103], [106], [109], [111], [115], [118], [121], [123], [126], [130], [133], [136], [140], [143], [146], [149], [152], [154], [157], [160], [165], [168], [171], [174], [176], [179], [182], [185], [187], [189], [192], [199], [201], [204], [205], [207], [210], [213], [216], [221], [223], [226], [229], [232], [234], [236], [239], [247], [249], [252], [255], [260], [262], [264], [267], [273], [276], [279], [281], [296], [298], [301], [304], [306], [323], [326], [329], [331], [339], [342], [348], [351], [354], [356], [372], [375], [379], [401], [406], [463], [464], [468], [469], [470] [2019-09-10 07:45:47,740 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:47,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:47,766 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:48,031 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:48,031 INFO L272 AbstractInterpreter]: Visited 118 different actions 483 times. Merged at 48 different actions 321 times. Widened at 12 different actions 28 times. Performed 1908 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1908 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 10 different actions. Largest state had 132 variables. [2019-09-10 07:45:48,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:48,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:48,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:48,032 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 07:45:48,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:48,054 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 07:45:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:48,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:45:48,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:48,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:48,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:48,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:48,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:48,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:48,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:48,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:49,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:49,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:49,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:49,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:49,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:49,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2019-09-10 07:45:49,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:49,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:45:49,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:45:49,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:45:49,975 INFO L87 Difference]: Start difference. First operand 425861 states and 569248 transitions. Second operand 23 states. [2019-09-10 07:45:54,534 WARN L188 SmtUtils]: Spent 3.72 s on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-10 07:45:56,575 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:45:56,705 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:45:56,890 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:45:59,127 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 07:45:59,493 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:45:59,921 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:46:00,443 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:46:02,170 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:46:02,353 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:46:02,510 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:46:02,636 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 07:46:04,391 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 07:46:04,527 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:46:04,865 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:46:05,128 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:46:06,334 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 07:46:06,506 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 07:46:06,879 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 07:46:07,012 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:46:07,162 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:46:08,173 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 07:46:08,332 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 07:46:08,704 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-10 07:46:08,838 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:46:09,246 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:46:09,822 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:46:10,007 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:46:10,149 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:46:10,420 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:46:10,798 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:46:11,310 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:46:11,511 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:46:11,725 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:46:11,909 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:46:12,242 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:46:12,401 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:46:12,601 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:46:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:17,886 INFO L93 Difference]: Finished difference Result 1538521 states and 2015313 transitions. [2019-09-10 07:46:17,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-10 07:46:17,887 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 132 [2019-09-10 07:46:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:19,737 INFO L225 Difference]: With dead ends: 1538521 [2019-09-10 07:46:19,737 INFO L226 Difference]: Without dead ends: 1538521 [2019-09-10 07:46:19,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 222 SyntacticMatches, 21 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10508 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=5028, Invalid=24728, Unknown=0, NotChecked=0, Total=29756 [2019-09-10 07:46:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538521 states. [2019-09-10 07:46:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538521 to 636117. [2019-09-10 07:46:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636117 states. [2019-09-10 07:46:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636117 states to 636117 states and 852010 transitions. [2019-09-10 07:46:57,229 INFO L78 Accepts]: Start accepts. Automaton has 636117 states and 852010 transitions. Word has length 132 [2019-09-10 07:46:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:57,229 INFO L475 AbstractCegarLoop]: Abstraction has 636117 states and 852010 transitions. [2019-09-10 07:46:57,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:46:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 636117 states and 852010 transitions. [2019-09-10 07:46:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:46:57,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:57,250 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:57,250 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:57,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:57,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1864304623, now seen corresponding path program 1 times [2019-09-10 07:46:57,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:57,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:57,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:57,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:57,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:46:57,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:57,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:46:57,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:46:57,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:57,316 INFO L87 Difference]: Start difference. First operand 636117 states and 852010 transitions. Second operand 3 states. [2019-09-10 07:46:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:58,741 INFO L93 Difference]: Finished difference Result 618569 states and 814226 transitions. [2019-09-10 07:46:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:46:58,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-10 07:46:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:01,245 INFO L225 Difference]: With dead ends: 618569 [2019-09-10 07:47:01,246 INFO L226 Difference]: Without dead ends: 618569 [2019-09-10 07:47:01,246 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 07:47:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618569 states. [2019-09-10 07:47:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618569 to 618567. [2019-09-10 07:47:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618567 states. [2019-09-10 07:47:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618567 states to 618567 states and 814225 transitions. [2019-09-10 07:47:16,338 INFO L78 Accepts]: Start accepts. Automaton has 618567 states and 814225 transitions. Word has length 132 [2019-09-10 07:47:16,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:16,339 INFO L475 AbstractCegarLoop]: Abstraction has 618567 states and 814225 transitions. [2019-09-10 07:47:16,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:47:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 618567 states and 814225 transitions. [2019-09-10 07:47:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:47:16,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:16,353 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:16,353 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:16,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:16,354 INFO L82 PathProgramCache]: Analyzing trace with hash 524740948, now seen corresponding path program 1 times [2019-09-10 07:47:16,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:16,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:16,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:16,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:16,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:16,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:16,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:47:16,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:16,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:47:16,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:47:16,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:47:16,418 INFO L87 Difference]: Start difference. First operand 618567 states and 814225 transitions. Second operand 3 states. [2019-09-10 07:47:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:17,210 INFO L93 Difference]: Finished difference Result 349544 states and 451586 transitions. [2019-09-10 07:47:17,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:47:17,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-10 07:47:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:17,583 INFO L225 Difference]: With dead ends: 349544 [2019-09-10 07:47:17,583 INFO L226 Difference]: Without dead ends: 349544 [2019-09-10 07:47:17,583 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 07:47:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349544 states. [2019-09-10 07:47:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349544 to 349542. [2019-09-10 07:47:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349542 states. [2019-09-10 07:47:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349542 states to 349542 states and 451585 transitions. [2019-09-10 07:47:29,957 INFO L78 Accepts]: Start accepts. Automaton has 349542 states and 451585 transitions. Word has length 132 [2019-09-10 07:47:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:29,957 INFO L475 AbstractCegarLoop]: Abstraction has 349542 states and 451585 transitions. [2019-09-10 07:47:29,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:47:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 349542 states and 451585 transitions. [2019-09-10 07:47:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:47:29,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:29,972 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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 07:47:29,972 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:29,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:29,973 INFO L82 PathProgramCache]: Analyzing trace with hash 256375828, now seen corresponding path program 1 times [2019-09-10 07:47:29,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:29,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:29,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:29,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:29,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:30,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:30,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:47:30,346 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:47:30,346 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [87], [91], [94], [97], [99], [103], [106], [109], [111], [115], [118], [121], [123], [126], [130], [133], [136], [140], [143], [146], [149], [152], [154], [157], [160], [163], [165], [168], [171], [174], [176], [179], [182], [185], [187], [189], [192], [199], [201], [204], [205], [207], [210], [213], [216], [221], [223], [226], [229], [232], [234], [236], [239], [242], [247], [249], [252], [255], [258], [260], [262], [273], [276], [279], [281], [289], [292], [298], [301], [304], [306], [323], [326], [329], [331], [339], [342], [348], [351], [354], [356], [372], [375], [379], [463], [464], [468], [469], [470] [2019-09-10 07:47:30,352 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:47:30,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:47:30,368 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:47:30,616 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:47:30,617 INFO L272 AbstractInterpreter]: Visited 118 different actions 431 times. Merged at 49 different actions 277 times. Widened at 8 different actions 19 times. Performed 1668 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1668 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 9 different actions. Largest state had 132 variables. [2019-09-10 07:47:30,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:30,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:47:30,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:30,618 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) [2019-09-10 07:47:30,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:30,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:47:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:30,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 07:47:30,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:47:31,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:32,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:32,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:32,938 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:47:33,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:33,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:33,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:33,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:33,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:33,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:33,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:33,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:33,858 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-09-10 07:47:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:36,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:47:36,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 45 [2019-09-10 07:47:36,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:47:36,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 07:47:36,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 07:47:36,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1779, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 07:47:36,051 INFO L87 Difference]: Start difference. First operand 349542 states and 451585 transitions. Second operand 32 states. [2019-09-10 07:47:39,326 WARN L188 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 40 [2019-09-10 07:47:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:49,686 INFO L93 Difference]: Finished difference Result 790034 states and 1020926 transitions. [2019-09-10 07:47:49,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:47:49,686 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 132 [2019-09-10 07:47:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:50,724 INFO L225 Difference]: With dead ends: 790034 [2019-09-10 07:47:50,724 INFO L226 Difference]: Without dead ends: 790034 [2019-09-10 07:47:50,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 208 SyntacticMatches, 29 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=609, Invalid=3551, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 07:47:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790034 states. [2019-09-10 07:48:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790034 to 409470. [2019-09-10 07:48:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409470 states. [2019-09-10 07:48:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409470 states to 409470 states and 529621 transitions. [2019-09-10 07:48:01,417 INFO L78 Accepts]: Start accepts. Automaton has 409470 states and 529621 transitions. Word has length 132 [2019-09-10 07:48:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:01,417 INFO L475 AbstractCegarLoop]: Abstraction has 409470 states and 529621 transitions. [2019-09-10 07:48:01,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 07:48:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 409470 states and 529621 transitions. [2019-09-10 07:48:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:48:01,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:01,434 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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 07:48:01,435 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:01,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2077346033, now seen corresponding path program 1 times [2019-09-10 07:48:01,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:01,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:01,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:01,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:01,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:01,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:01,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:01,809 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:48:01,809 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [87], [91], [94], [97], [99], [103], [106], [109], [111], [115], [118], [121], [123], [126], [130], [133], [136], [140], [143], [146], [149], [152], [154], [157], [160], [163], [165], [168], [171], [174], [176], [179], [182], [185], [187], [189], [192], [199], [201], [204], [205], [207], [210], [213], [216], [219], [221], [223], [226], [229], [232], [234], [236], [239], [242], [247], [249], [252], [255], [260], [262], [264], [267], [273], [276], [279], [281], [289], [292], [298], [301], [304], [306], [323], [326], [329], [331], [348], [351], [354], [356], [372], [375], [379], [463], [464], [468], [469], [470] [2019-09-10 07:48:01,811 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:01,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:01,825 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:02,085 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:02,085 INFO L272 AbstractInterpreter]: Visited 118 different actions 505 times. Merged at 49 different actions 344 times. Widened at 12 different actions 33 times. Performed 1964 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1964 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 10 different actions. Largest state had 132 variables. [2019-09-10 07:48:02,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:02,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:02,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:02,086 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:48:02,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:02,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:48:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:02,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-10 07:48:02,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:03,784 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-09-10 07:48:03,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:05,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:05,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:05,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:05,801 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:48:07,382 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-10 07:48:07,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:12,948 WARN L188 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2019-09-10 07:48:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:16,178 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:17,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:17,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:17,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:18,091 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-10 07:48:22,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:48:25,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:48:26,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:26,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:48:26,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:48:27,240 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 133 [2019-09-10 07:48:27,686 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-09-10 07:48:27,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:27,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-10 07:48:27,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-10 07:48:28,506 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-09-10 07:48:29,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:29,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:48:29,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:48:30,288 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 105 [2019-09-10 07:48:35,413 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 60 [2019-09-10 07:48:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:35,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:48:35,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27, 25] total 66 [2019-09-10 07:48:35,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:48:35,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 07:48:35,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 07:48:35,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=3985, Unknown=2, NotChecked=0, Total=4290 [2019-09-10 07:48:35,657 INFO L87 Difference]: Start difference. First operand 409470 states and 529621 transitions. Second operand 43 states. [2019-09-10 07:48:43,006 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:48:47,734 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:48:48,128 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:48:53,001 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-09-10 07:48:53,686 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 07:49:19,197 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-09-10 07:49:41,395 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 69 [2019-09-10 07:49:54,346 WARN L188 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 87 [2019-09-10 07:50:11,135 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2019-09-10 07:50:16,536 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 07:50:23,184 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 07:50:37,597 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 07:50:57,738 WARN L188 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 104 [2019-09-10 07:51:12,594 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:51:29,104 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 07:51:36,614 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 07:51:45,514 WARN L188 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 104 [2019-09-10 07:51:48,915 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2019-09-10 07:51:55,608 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51