java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:00:56,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:00:56,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:00:56,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:00:56,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:00:56,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:00:56,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:00:56,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:00:56,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:00:56,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:00:56,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:00:56,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:00:56,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:00:56,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:00:56,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:00:56,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:00:56,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:00:56,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:00:56,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:00:56,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:00:56,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:00:56,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:00:56,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:00:56,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:00:56,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:00:56,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:00:56,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:00:56,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:00:56,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:00:56,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:00:56,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:00:56,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:00:56,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:00:56,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:00:56,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:00:56,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:00:56,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:00:56,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:00:56,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:00:56,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:00:56,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:00:56,900 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:00:56,914 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:00:56,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:00:56,915 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:00:56,915 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:00:56,916 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:00:56,916 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:00:56,916 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:00:56,916 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:00:56,917 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:00:56,917 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:00:56,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:00:56,918 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:00:56,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:00:56,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:00:56,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:00:56,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:00:56,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:00:56,919 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:00:56,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:00:56,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:00:56,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:00:56,920 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:00:56,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:00:56,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:00:56,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:00:56,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:00:56,921 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:00:56,921 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:00:56,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:00:56,921 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:00:56,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:00:56,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:00:56,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:00:56,969 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:00:56,969 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:00:56,970 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 07:00:57,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dac0a0b7/f2358a4160e14b16b76d1965f5192e36/FLAG5e364f0ef [2019-09-10 07:00:57,549 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:00:57,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 07:00:57,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dac0a0b7/f2358a4160e14b16b76d1965f5192e36/FLAG5e364f0ef [2019-09-10 07:00:57,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dac0a0b7/f2358a4160e14b16b76d1965f5192e36 [2019-09-10 07:00:57,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:00:57,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:00:57,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:00:57,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:00:57,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:00:57,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:00:57" (1/1) ... [2019-09-10 07:00:57,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4141a06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:57, skipping insertion in model container [2019-09-10 07:00:57,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:00:57" (1/1) ... [2019-09-10 07:00:57,888 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:00:57,951 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:00:58,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:00:58,374 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:00:58,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:00:58,518 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:00:58,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:58 WrapperNode [2019-09-10 07:00:58,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:00:58,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:00:58,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:00:58,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:00:58,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:58" (1/1) ... [2019-09-10 07:00:58,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:58" (1/1) ... [2019-09-10 07:00:58,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:58" (1/1) ... [2019-09-10 07:00:58,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:58" (1/1) ... [2019-09-10 07:00:58,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:58" (1/1) ... [2019-09-10 07:00:58,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:58" (1/1) ... [2019-09-10 07:00:58,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:58" (1/1) ... [2019-09-10 07:00:58,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:00:58,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:00:58,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:00:58,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:00:58,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:58" (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:00:58,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:00:58,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:00:58,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:00:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:00:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:00:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:00:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:00:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:00:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:00:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:00:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:00:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:00:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:00:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:00:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:00:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:00:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:00:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:00:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:00:59,511 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:00:59,511 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:00:59,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:00:59 BoogieIcfgContainer [2019-09-10 07:00:59,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:00:59,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:00:59,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:00:59,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:00:59,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:00:57" (1/3) ... [2019-09-10 07:00:59,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369c0183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:00:59, skipping insertion in model container [2019-09-10 07:00:59,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:58" (2/3) ... [2019-09-10 07:00:59,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369c0183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:00:59, skipping insertion in model container [2019-09-10 07:00:59,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:00:59" (3/3) ... [2019-09-10 07:00:59,521 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 07:00:59,531 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:00:59,540 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:00:59,557 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:00:59,578 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:00:59,579 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:00:59,579 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:00:59,579 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:00:59,579 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:00:59,579 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:00:59,579 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:00:59,580 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:00:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2019-09-10 07:00:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:00:59,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:59,617 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:00:59,619 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:59,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:59,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1532024012, now seen corresponding path program 1 times [2019-09-10 07:00:59,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:59,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:59,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:59,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:59,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:00,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:00,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:01:00,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:00,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:01:00,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:01:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:01:00,208 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 7 states. [2019-09-10 07:01:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:00,791 INFO L93 Difference]: Finished difference Result 1073 states and 1678 transitions. [2019-09-10 07:01:00,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:01:00,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-10 07:01:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:00,822 INFO L225 Difference]: With dead ends: 1073 [2019-09-10 07:01:00,822 INFO L226 Difference]: Without dead ends: 1025 [2019-09-10 07:01:00,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:01:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-09-10 07:01:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 515. [2019-09-10 07:01:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-09-10 07:01:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 790 transitions. [2019-09-10 07:01:00,922 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 790 transitions. Word has length 69 [2019-09-10 07:01:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:00,923 INFO L475 AbstractCegarLoop]: Abstraction has 515 states and 790 transitions. [2019-09-10 07:01:00,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:01:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 790 transitions. [2019-09-10 07:01:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:01:00,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:00,929 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:01:00,929 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:00,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:00,930 INFO L82 PathProgramCache]: Analyzing trace with hash -525222683, now seen corresponding path program 1 times [2019-09-10 07:01:00,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:00,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:00,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:00,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:00,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:01,233 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:01:01,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:01,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:01,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:01,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:01,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:01,237 INFO L87 Difference]: Start difference. First operand 515 states and 790 transitions. Second operand 6 states. [2019-09-10 07:01:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:01,488 INFO L93 Difference]: Finished difference Result 1392 states and 2135 transitions. [2019-09-10 07:01:01,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:01:01,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 07:01:01,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:01,501 INFO L225 Difference]: With dead ends: 1392 [2019-09-10 07:01:01,502 INFO L226 Difference]: Without dead ends: 1392 [2019-09-10 07:01:01,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:01,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-09-10 07:01:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1386. [2019-09-10 07:01:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-09-10 07:01:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2132 transitions. [2019-09-10 07:01:01,567 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2132 transitions. Word has length 70 [2019-09-10 07:01:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:01,568 INFO L475 AbstractCegarLoop]: Abstraction has 1386 states and 2132 transitions. [2019-09-10 07:01:01,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2132 transitions. [2019-09-10 07:01:01,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:01:01,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:01,578 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:01:01,579 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash -550914758, now seen corresponding path program 1 times [2019-09-10 07:01:01,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:01,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:01,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:01,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:01,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:01,720 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:01:01,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:01,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:01:01,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:01,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:01:01,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:01:01,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:01:01,722 INFO L87 Difference]: Start difference. First operand 1386 states and 2132 transitions. Second operand 5 states. [2019-09-10 07:01:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:02,032 INFO L93 Difference]: Finished difference Result 2357 states and 3621 transitions. [2019-09-10 07:01:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:02,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:01:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:02,049 INFO L225 Difference]: With dead ends: 2357 [2019-09-10 07:01:02,049 INFO L226 Difference]: Without dead ends: 2357 [2019-09-10 07:01:02,051 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:01:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2019-09-10 07:01:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2355. [2019-09-10 07:01:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2355 states. [2019-09-10 07:01:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3620 transitions. [2019-09-10 07:01:02,128 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3620 transitions. Word has length 71 [2019-09-10 07:01:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:02,129 INFO L475 AbstractCegarLoop]: Abstraction has 2355 states and 3620 transitions. [2019-09-10 07:01:02,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:01:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3620 transitions. [2019-09-10 07:01:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:01:02,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:02,133 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:01:02,134 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:02,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:02,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1519127563, now seen corresponding path program 1 times [2019-09-10 07:01:02,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:02,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:02,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:02,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:02,245 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:01:02,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:02,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:02,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:02,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:02,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:02,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:02,247 INFO L87 Difference]: Start difference. First operand 2355 states and 3620 transitions. Second operand 6 states. [2019-09-10 07:01:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:02,605 INFO L93 Difference]: Finished difference Result 6394 states and 9806 transitions. [2019-09-10 07:01:02,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:02,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-10 07:01:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:02,635 INFO L225 Difference]: With dead ends: 6394 [2019-09-10 07:01:02,635 INFO L226 Difference]: Without dead ends: 6394 [2019-09-10 07:01:02,636 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:01:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6394 states. [2019-09-10 07:01:02,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6394 to 6390. [2019-09-10 07:01:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6390 states. [2019-09-10 07:01:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6390 states to 6390 states and 9804 transitions. [2019-09-10 07:01:02,870 INFO L78 Accepts]: Start accepts. Automaton has 6390 states and 9804 transitions. Word has length 71 [2019-09-10 07:01:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:02,871 INFO L475 AbstractCegarLoop]: Abstraction has 6390 states and 9804 transitions. [2019-09-10 07:01:02,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6390 states and 9804 transitions. [2019-09-10 07:01:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:01:02,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:02,875 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:01:02,876 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:02,877 INFO L82 PathProgramCache]: Analyzing trace with hash 968007085, now seen corresponding path program 1 times [2019-09-10 07:01:02,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:02,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:02,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:02,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:02,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:03,042 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:01:03,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:03,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:03,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:03,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:03,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:03,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:03,045 INFO L87 Difference]: Start difference. First operand 6390 states and 9804 transitions. Second operand 6 states. [2019-09-10 07:01:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:03,527 INFO L93 Difference]: Finished difference Result 17685 states and 27061 transitions. [2019-09-10 07:01:03,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:03,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-10 07:01:03,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:03,612 INFO L225 Difference]: With dead ends: 17685 [2019-09-10 07:01:03,613 INFO L226 Difference]: Without dead ends: 17685 [2019-09-10 07:01:03,613 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:01:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17685 states. [2019-09-10 07:01:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17685 to 15513. [2019-09-10 07:01:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15513 states. [2019-09-10 07:01:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15513 states to 15513 states and 23719 transitions. [2019-09-10 07:01:04,150 INFO L78 Accepts]: Start accepts. Automaton has 15513 states and 23719 transitions. Word has length 71 [2019-09-10 07:01:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:04,151 INFO L475 AbstractCegarLoop]: Abstraction has 15513 states and 23719 transitions. [2019-09-10 07:01:04,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 15513 states and 23719 transitions. [2019-09-10 07:01:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:01:04,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:04,154 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:01:04,155 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:04,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1314156252, now seen corresponding path program 1 times [2019-09-10 07:01:04,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:04,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:04,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:04,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:04,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:04,411 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:01:04,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:04,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:04,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:04,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:04,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:04,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:04,414 INFO L87 Difference]: Start difference. First operand 15513 states and 23719 transitions. Second operand 6 states. [2019-09-10 07:01:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:04,973 INFO L93 Difference]: Finished difference Result 44503 states and 67627 transitions. [2019-09-10 07:01:04,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:04,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-10 07:01:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:05,094 INFO L225 Difference]: With dead ends: 44503 [2019-09-10 07:01:05,095 INFO L226 Difference]: Without dead ends: 44503 [2019-09-10 07:01:05,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:01:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44503 states. [2019-09-10 07:01:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44503 to 44499. [2019-09-10 07:01:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44499 states. [2019-09-10 07:01:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44499 states to 44499 states and 67625 transitions. [2019-09-10 07:01:06,050 INFO L78 Accepts]: Start accepts. Automaton has 44499 states and 67625 transitions. Word has length 71 [2019-09-10 07:01:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:06,050 INFO L475 AbstractCegarLoop]: Abstraction has 44499 states and 67625 transitions. [2019-09-10 07:01:06,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 44499 states and 67625 transitions. [2019-09-10 07:01:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:01:06,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:06,055 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:01:06,056 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -791998800, now seen corresponding path program 1 times [2019-09-10 07:01:06,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:06,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:06,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:06,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:06,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:06,975 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:01:06,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:06,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:01:06,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:06,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:01:06,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:01:06,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:01:06,977 INFO L87 Difference]: Start difference. First operand 44499 states and 67625 transitions. Second operand 5 states. [2019-09-10 07:01:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:07,296 INFO L93 Difference]: Finished difference Result 73749 states and 110933 transitions. [2019-09-10 07:01:07,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:01:07,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 07:01:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:07,495 INFO L225 Difference]: With dead ends: 73749 [2019-09-10 07:01:07,496 INFO L226 Difference]: Without dead ends: 73749 [2019-09-10 07:01:07,496 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:01:07,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73749 states. [2019-09-10 07:01:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73749 to 45183. [2019-09-10 07:01:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45183 states. [2019-09-10 07:01:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45183 states to 45183 states and 68102 transitions. [2019-09-10 07:01:08,534 INFO L78 Accepts]: Start accepts. Automaton has 45183 states and 68102 transitions. Word has length 72 [2019-09-10 07:01:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:08,535 INFO L475 AbstractCegarLoop]: Abstraction has 45183 states and 68102 transitions. [2019-09-10 07:01:08,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:01:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 45183 states and 68102 transitions. [2019-09-10 07:01:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:01:08,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:08,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:08,540 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:08,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1494388144, now seen corresponding path program 1 times [2019-09-10 07:01:08,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:08,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:08,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:08,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:08,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:08,618 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:01:08,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:08,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:01:08,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:08,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:01:08,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:01:08,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:01:08,620 INFO L87 Difference]: Start difference. First operand 45183 states and 68102 transitions. Second operand 4 states. [2019-09-10 07:01:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:09,073 INFO L93 Difference]: Finished difference Result 73907 states and 110409 transitions. [2019-09-10 07:01:09,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:01:09,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-10 07:01:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:09,272 INFO L225 Difference]: With dead ends: 73907 [2019-09-10 07:01:09,272 INFO L226 Difference]: Without dead ends: 73907 [2019-09-10 07:01:09,273 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:01:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73907 states. [2019-09-10 07:01:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73907 to 73905. [2019-09-10 07:01:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73905 states. [2019-09-10 07:01:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73905 states to 73905 states and 110408 transitions. [2019-09-10 07:01:10,534 INFO L78 Accepts]: Start accepts. Automaton has 73905 states and 110408 transitions. Word has length 73 [2019-09-10 07:01:10,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:10,535 INFO L475 AbstractCegarLoop]: Abstraction has 73905 states and 110408 transitions. [2019-09-10 07:01:10,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:01:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 73905 states and 110408 transitions. [2019-09-10 07:01:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:01:10,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:10,542 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:01:10,543 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:10,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1173196458, now seen corresponding path program 1 times [2019-09-10 07:01:10,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:10,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:10,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:10,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:10,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:10,660 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:01:10,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:10,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:01:10,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:10,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:01:10,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:01:10,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:01:10,662 INFO L87 Difference]: Start difference. First operand 73905 states and 110408 transitions. Second operand 7 states. [2019-09-10 07:01:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:13,427 INFO L93 Difference]: Finished difference Result 261844 states and 384418 transitions. [2019-09-10 07:01:13,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:01:13,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 07:01:13,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:14,117 INFO L225 Difference]: With dead ends: 261844 [2019-09-10 07:01:14,118 INFO L226 Difference]: Without dead ends: 261844 [2019-09-10 07:01:14,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:01:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261844 states. [2019-09-10 07:01:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261844 to 73935. [2019-09-10 07:01:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73935 states. [2019-09-10 07:01:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73935 states to 73935 states and 110444 transitions. [2019-09-10 07:01:18,069 INFO L78 Accepts]: Start accepts. Automaton has 73935 states and 110444 transitions. Word has length 74 [2019-09-10 07:01:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:18,070 INFO L475 AbstractCegarLoop]: Abstraction has 73935 states and 110444 transitions. [2019-09-10 07:01:18,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:01:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 73935 states and 110444 transitions. [2019-09-10 07:01:18,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:01:18,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:18,075 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:01:18,075 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:18,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:18,076 INFO L82 PathProgramCache]: Analyzing trace with hash 560209704, now seen corresponding path program 1 times [2019-09-10 07:01:18,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:18,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:18,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:18,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:18,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:18,136 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:01:18,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:18,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:18,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:18,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:18,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:18,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:18,138 INFO L87 Difference]: Start difference. First operand 73935 states and 110444 transitions. Second operand 3 states. [2019-09-10 07:01:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:18,387 INFO L93 Difference]: Finished difference Result 108250 states and 159102 transitions. [2019-09-10 07:01:18,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:18,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 07:01:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:18,513 INFO L225 Difference]: With dead ends: 108250 [2019-09-10 07:01:18,514 INFO L226 Difference]: Without dead ends: 108250 [2019-09-10 07:01:18,514 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:01:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108250 states. [2019-09-10 07:01:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108250 to 107041. [2019-09-10 07:01:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107041 states. [2019-09-10 07:01:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107041 states to 107041 states and 157894 transitions. [2019-09-10 07:01:19,949 INFO L78 Accepts]: Start accepts. Automaton has 107041 states and 157894 transitions. Word has length 74 [2019-09-10 07:01:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:19,949 INFO L475 AbstractCegarLoop]: Abstraction has 107041 states and 157894 transitions. [2019-09-10 07:01:19,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 107041 states and 157894 transitions. [2019-09-10 07:01:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:01:19,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:19,953 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:01:19,953 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:19,954 INFO L82 PathProgramCache]: Analyzing trace with hash 153092714, now seen corresponding path program 1 times [2019-09-10 07:01:19,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:19,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:19,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:20,020 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:01:20,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:20,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:20,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:20,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:20,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:20,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:20,021 INFO L87 Difference]: Start difference. First operand 107041 states and 157894 transitions. Second operand 3 states. [2019-09-10 07:01:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:20,341 INFO L93 Difference]: Finished difference Result 131988 states and 190428 transitions. [2019-09-10 07:01:20,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:20,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 07:01:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:20,494 INFO L225 Difference]: With dead ends: 131988 [2019-09-10 07:01:20,495 INFO L226 Difference]: Without dead ends: 131988 [2019-09-10 07:01:20,495 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:01:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131988 states. [2019-09-10 07:01:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131988 to 130369. [2019-09-10 07:01:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130369 states. [2019-09-10 07:01:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130369 states to 130369 states and 188810 transitions. [2019-09-10 07:01:23,705 INFO L78 Accepts]: Start accepts. Automaton has 130369 states and 188810 transitions. Word has length 74 [2019-09-10 07:01:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:23,706 INFO L475 AbstractCegarLoop]: Abstraction has 130369 states and 188810 transitions. [2019-09-10 07:01:23,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 130369 states and 188810 transitions. [2019-09-10 07:01:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:01:23,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:23,711 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:01:23,712 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash 360963784, now seen corresponding path program 1 times [2019-09-10 07:01:23,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:23,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:23,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:23,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:23,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:24,264 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:01:24,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:24,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:01:24,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:24,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:01:24,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:01:24,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:01:24,267 INFO L87 Difference]: Start difference. First operand 130369 states and 188810 transitions. Second operand 7 states. [2019-09-10 07:01:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:26,637 INFO L93 Difference]: Finished difference Result 699698 states and 1005450 transitions. [2019-09-10 07:01:26,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:01:26,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 07:01:26,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:32,704 INFO L225 Difference]: With dead ends: 699698 [2019-09-10 07:01:32,704 INFO L226 Difference]: Without dead ends: 699698 [2019-09-10 07:01:32,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:01:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699698 states. [2019-09-10 07:01:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699698 to 130537. [2019-09-10 07:01:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130537 states. [2019-09-10 07:01:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130537 states to 130537 states and 189029 transitions. [2019-09-10 07:01:36,796 INFO L78 Accepts]: Start accepts. Automaton has 130537 states and 189029 transitions. Word has length 74 [2019-09-10 07:01:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:36,796 INFO L475 AbstractCegarLoop]: Abstraction has 130537 states and 189029 transitions. [2019-09-10 07:01:36,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:01:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 130537 states and 189029 transitions. [2019-09-10 07:01:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:01:36,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:36,801 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:01:36,802 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:36,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:36,802 INFO L82 PathProgramCache]: Analyzing trace with hash -914256502, now seen corresponding path program 1 times [2019-09-10 07:01:36,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:36,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:36,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:36,854 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:01:36,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:36,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:36,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:36,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:36,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:36,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:36,855 INFO L87 Difference]: Start difference. First operand 130537 states and 189029 transitions. Second operand 3 states. [2019-09-10 07:01:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:37,434 INFO L93 Difference]: Finished difference Result 167366 states and 237438 transitions. [2019-09-10 07:01:37,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:37,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 07:01:37,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:37,725 INFO L225 Difference]: With dead ends: 167366 [2019-09-10 07:01:37,726 INFO L226 Difference]: Without dead ends: 167366 [2019-09-10 07:01:37,726 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:01:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167366 states. [2019-09-10 07:01:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167366 to 166666. [2019-09-10 07:01:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166666 states. [2019-09-10 07:01:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166666 states to 166666 states and 236734 transitions. [2019-09-10 07:01:39,951 INFO L78 Accepts]: Start accepts. Automaton has 166666 states and 236734 transitions. Word has length 74 [2019-09-10 07:01:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:39,951 INFO L475 AbstractCegarLoop]: Abstraction has 166666 states and 236734 transitions. [2019-09-10 07:01:39,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 166666 states and 236734 transitions. [2019-09-10 07:01:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:01:39,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:39,958 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:01:39,958 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:39,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:39,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1454128726, now seen corresponding path program 1 times [2019-09-10 07:01:39,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:39,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:39,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:39,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:39,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:40,050 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:01:40,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:40,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:01:40,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:40,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:01:40,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:01:40,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:01:40,051 INFO L87 Difference]: Start difference. First operand 166666 states and 236734 transitions. Second operand 7 states. [2019-09-10 07:01:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:43,211 INFO L93 Difference]: Finished difference Result 788860 states and 1113210 transitions. [2019-09-10 07:01:43,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:01:43,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 07:01:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:44,334 INFO L225 Difference]: With dead ends: 788860 [2019-09-10 07:01:44,334 INFO L226 Difference]: Without dead ends: 788860 [2019-09-10 07:01:44,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:01:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788860 states. [2019-09-10 07:01:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788860 to 166872. [2019-09-10 07:01:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166872 states. [2019-09-10 07:01:55,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166872 states to 166872 states and 236998 transitions. [2019-09-10 07:01:55,881 INFO L78 Accepts]: Start accepts. Automaton has 166872 states and 236998 transitions. Word has length 74 [2019-09-10 07:01:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:55,881 INFO L475 AbstractCegarLoop]: Abstraction has 166872 states and 236998 transitions. [2019-09-10 07:01:55,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:01:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 166872 states and 236998 transitions. [2019-09-10 07:01:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:01:55,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:55,889 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:01:55,889 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:55,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:55,889 INFO L82 PathProgramCache]: Analyzing trace with hash -776383725, now seen corresponding path program 1 times [2019-09-10 07:01:55,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:55,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:55,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:55,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:55,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:55,977 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:01:55,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:55,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:55,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:55,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:55,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:55,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:55,979 INFO L87 Difference]: Start difference. First operand 166872 states and 236998 transitions. Second operand 6 states. [2019-09-10 07:01:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:56,804 INFO L93 Difference]: Finished difference Result 326801 states and 464138 transitions. [2019-09-10 07:01:56,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:01:56,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 07:01:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:57,277 INFO L225 Difference]: With dead ends: 326801 [2019-09-10 07:01:57,277 INFO L226 Difference]: Without dead ends: 326801 [2019-09-10 07:01:57,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326801 states. [2019-09-10 07:02:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326801 to 191328. [2019-09-10 07:02:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191328 states. [2019-09-10 07:02:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191328 states to 191328 states and 272179 transitions. [2019-09-10 07:02:02,035 INFO L78 Accepts]: Start accepts. Automaton has 191328 states and 272179 transitions. Word has length 76 [2019-09-10 07:02:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:02,036 INFO L475 AbstractCegarLoop]: Abstraction has 191328 states and 272179 transitions. [2019-09-10 07:02:02,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:02:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 191328 states and 272179 transitions. [2019-09-10 07:02:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:02:02,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:02,041 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:02:02,042 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:02,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:02,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2051604011, now seen corresponding path program 1 times [2019-09-10 07:02:02,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:02,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:02,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:02,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:02,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:02,131 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:02:02,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:02,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:02:02,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:02,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:02:02,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:02:02,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:02:02,135 INFO L87 Difference]: Start difference. First operand 191328 states and 272179 transitions. Second operand 6 states. [2019-09-10 07:02:03,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:03,035 INFO L93 Difference]: Finished difference Result 340772 states and 484677 transitions. [2019-09-10 07:02:03,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:02:03,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 07:02:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:03,492 INFO L225 Difference]: With dead ends: 340772 [2019-09-10 07:02:03,492 INFO L226 Difference]: Without dead ends: 340772 [2019-09-10 07:02:03,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340772 states. [2019-09-10 07:02:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340772 to 206263. [2019-09-10 07:02:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206263 states. [2019-09-10 07:02:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206263 states to 206263 states and 293590 transitions. [2019-09-10 07:02:10,755 INFO L78 Accepts]: Start accepts. Automaton has 206263 states and 293590 transitions. Word has length 76 [2019-09-10 07:02:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:10,755 INFO L475 AbstractCegarLoop]: Abstraction has 206263 states and 293590 transitions. [2019-09-10 07:02:10,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:02:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 206263 states and 293590 transitions. [2019-09-10 07:02:10,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:02:10,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:10,762 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:02:10,762 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:10,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:10,763 INFO L82 PathProgramCache]: Analyzing trace with hash -793277035, now seen corresponding path program 1 times [2019-09-10 07:02:10,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:10,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:10,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:10,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:10,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:10,838 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:02:10,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:10,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:02:10,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:10,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:02:10,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:02:10,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:02:10,839 INFO L87 Difference]: Start difference. First operand 206263 states and 293590 transitions. Second operand 6 states. [2019-09-10 07:02:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:12,365 INFO L93 Difference]: Finished difference Result 352370 states and 500894 transitions. [2019-09-10 07:02:12,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:02:12,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 07:02:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:12,861 INFO L225 Difference]: With dead ends: 352370 [2019-09-10 07:02:12,861 INFO L226 Difference]: Without dead ends: 352370 [2019-09-10 07:02:12,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:13,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352370 states. [2019-09-10 07:02:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352370 to 231312. [2019-09-10 07:02:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231312 states. [2019-09-10 07:02:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231312 states to 231312 states and 329641 transitions. [2019-09-10 07:02:19,866 INFO L78 Accepts]: Start accepts. Automaton has 231312 states and 329641 transitions. Word has length 76 [2019-09-10 07:02:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:19,866 INFO L475 AbstractCegarLoop]: Abstraction has 231312 states and 329641 transitions. [2019-09-10 07:02:19,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:02:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 231312 states and 329641 transitions. [2019-09-10 07:02:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:02:19,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:19,874 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:02:19,874 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:19,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:19,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1975709726, now seen corresponding path program 1 times [2019-09-10 07:02:19,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:19,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:19,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:19,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:19,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:19,930 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:02:19,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:19,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:19,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:19,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:19,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:19,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:19,931 INFO L87 Difference]: Start difference. First operand 231312 states and 329641 transitions. Second operand 3 states. [2019-09-10 07:02:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:21,572 INFO L93 Difference]: Finished difference Result 268054 states and 374282 transitions. [2019-09-10 07:02:21,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:21,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:02:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:22,151 INFO L225 Difference]: With dead ends: 268054 [2019-09-10 07:02:22,151 INFO L226 Difference]: Without dead ends: 266378 [2019-09-10 07:02:22,152 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:02:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266378 states. [2019-09-10 07:02:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266378 to 235147. [2019-09-10 07:02:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235147 states. [2019-09-10 07:02:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235147 states to 235147 states and 330334 transitions. [2019-09-10 07:02:30,320 INFO L78 Accepts]: Start accepts. Automaton has 235147 states and 330334 transitions. Word has length 79 [2019-09-10 07:02:30,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:30,320 INFO L475 AbstractCegarLoop]: Abstraction has 235147 states and 330334 transitions. [2019-09-10 07:02:30,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 235147 states and 330334 transitions. [2019-09-10 07:02:30,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:02:30,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:30,328 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:02:30,329 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:30,329 INFO L82 PathProgramCache]: Analyzing trace with hash 873902620, now seen corresponding path program 1 times [2019-09-10 07:02:30,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:30,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:30,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:30,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:30,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:30,414 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:02:30,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:30,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:02:30,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:30,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:02:30,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:02:30,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:02:30,416 INFO L87 Difference]: Start difference. First operand 235147 states and 330334 transitions. Second operand 7 states. [2019-09-10 07:02:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:33,806 INFO L93 Difference]: Finished difference Result 974689 states and 1347146 transitions. [2019-09-10 07:02:33,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:02:33,806 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-10 07:02:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:35,222 INFO L225 Difference]: With dead ends: 974689 [2019-09-10 07:02:35,222 INFO L226 Difference]: Without dead ends: 974689 [2019-09-10 07:02:35,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:02:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974689 states. [2019-09-10 07:02:46,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974689 to 235593. [2019-09-10 07:02:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235593 states. [2019-09-10 07:02:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235593 states to 235593 states and 330879 transitions. [2019-09-10 07:02:47,087 INFO L78 Accepts]: Start accepts. Automaton has 235593 states and 330879 transitions. Word has length 79 [2019-09-10 07:02:47,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:47,087 INFO L475 AbstractCegarLoop]: Abstraction has 235593 states and 330879 transitions. [2019-09-10 07:02:47,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:02:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand 235593 states and 330879 transitions. [2019-09-10 07:02:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:02:47,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:47,098 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:47,098 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:47,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:47,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1233701679, now seen corresponding path program 1 times [2019-09-10 07:02:47,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:47,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:47,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:47,325 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:02:47,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:47,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:02:47,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:47,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:02:47,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:02:47,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:02:47,328 INFO L87 Difference]: Start difference. First operand 235593 states and 330879 transitions. Second operand 10 states. [2019-09-10 07:02:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:51,301 INFO L93 Difference]: Finished difference Result 614362 states and 853764 transitions. [2019-09-10 07:02:51,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:02:51,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-09-10 07:02:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:52,093 INFO L225 Difference]: With dead ends: 614362 [2019-09-10 07:02:52,093 INFO L226 Difference]: Without dead ends: 614362 [2019-09-10 07:02:52,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:02:52,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614362 states. [2019-09-10 07:03:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614362 to 235377. [2019-09-10 07:03:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235377 states. [2019-09-10 07:03:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235377 states to 235377 states and 330537 transitions. [2019-09-10 07:03:04,891 INFO L78 Accepts]: Start accepts. Automaton has 235377 states and 330537 transitions. Word has length 81 [2019-09-10 07:03:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:04,891 INFO L475 AbstractCegarLoop]: Abstraction has 235377 states and 330537 transitions. [2019-09-10 07:03:04,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:03:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 235377 states and 330537 transitions. [2019-09-10 07:03:04,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:03:04,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:04,900 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:04,901 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:04,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:04,901 INFO L82 PathProgramCache]: Analyzing trace with hash -887115147, now seen corresponding path program 1 times [2019-09-10 07:03:04,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:04,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:04,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:04,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:04,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:05,094 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:03:05,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:05,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:03:05,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:05,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:03:05,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:03:05,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:03:05,096 INFO L87 Difference]: Start difference. First operand 235377 states and 330537 transitions. Second operand 10 states. [2019-09-10 07:03:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:15,170 INFO L93 Difference]: Finished difference Result 1000391 states and 1393678 transitions. [2019-09-10 07:03:15,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:03:15,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-09-10 07:03:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:16,568 INFO L225 Difference]: With dead ends: 1000391 [2019-09-10 07:03:16,568 INFO L226 Difference]: Without dead ends: 1000331 [2019-09-10 07:03:16,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:03:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000331 states. [2019-09-10 07:03:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000331 to 235316. [2019-09-10 07:03:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235316 states. [2019-09-10 07:03:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235316 states to 235316 states and 330334 transitions. [2019-09-10 07:03:24,704 INFO L78 Accepts]: Start accepts. Automaton has 235316 states and 330334 transitions. Word has length 81 [2019-09-10 07:03:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:24,704 INFO L475 AbstractCegarLoop]: Abstraction has 235316 states and 330334 transitions. [2019-09-10 07:03:24,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:03:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 235316 states and 330334 transitions. [2019-09-10 07:03:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:03:24,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:24,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:24,714 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash 631700849, now seen corresponding path program 1 times [2019-09-10 07:03:24,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:24,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:24,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:24,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:24,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:24,892 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:03:24,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:24,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:03:24,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:24,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:03:24,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:03:24,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:03:24,894 INFO L87 Difference]: Start difference. First operand 235316 states and 330334 transitions. Second operand 10 states. [2019-09-10 07:03:31,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:31,680 INFO L93 Difference]: Finished difference Result 1144829 states and 1592552 transitions. [2019-09-10 07:03:31,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:03:31,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-09-10 07:03:31,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:33,253 INFO L225 Difference]: With dead ends: 1144829 [2019-09-10 07:03:33,254 INFO L226 Difference]: Without dead ends: 1144829 [2019-09-10 07:03:33,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:03:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144829 states. [2019-09-10 07:03:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144829 to 234745. [2019-09-10 07:03:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234745 states. [2019-09-10 07:03:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234745 states to 234745 states and 329557 transitions. [2019-09-10 07:03:49,635 INFO L78 Accepts]: Start accepts. Automaton has 234745 states and 329557 transitions. Word has length 81 [2019-09-10 07:03:49,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:49,635 INFO L475 AbstractCegarLoop]: Abstraction has 234745 states and 329557 transitions. [2019-09-10 07:03:49,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:03:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 234745 states and 329557 transitions. [2019-09-10 07:03:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:03:49,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:49,641 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:49,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:49,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1510628881, now seen corresponding path program 1 times [2019-09-10 07:03:49,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:49,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:49,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:49,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:49,820 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:03:49,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:49,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:03:49,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:49,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:03:49,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:03:49,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:03:49,823 INFO L87 Difference]: Start difference. First operand 234745 states and 329557 transitions. Second operand 10 states. [2019-09-10 07:04:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:00,384 INFO L93 Difference]: Finished difference Result 865496 states and 1210938 transitions. [2019-09-10 07:04:00,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:04:00,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-09-10 07:04:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:01,415 INFO L225 Difference]: With dead ends: 865496 [2019-09-10 07:04:01,415 INFO L226 Difference]: Without dead ends: 865496 [2019-09-10 07:04:01,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:04:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865496 states. [2019-09-10 07:04:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865496 to 234350. [2019-09-10 07:04:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234350 states. [2019-09-10 07:04:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234350 states to 234350 states and 329040 transitions. [2019-09-10 07:04:06,647 INFO L78 Accepts]: Start accepts. Automaton has 234350 states and 329040 transitions. Word has length 81 [2019-09-10 07:04:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:06,647 INFO L475 AbstractCegarLoop]: Abstraction has 234350 states and 329040 transitions. [2019-09-10 07:04:06,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:04:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 234350 states and 329040 transitions. [2019-09-10 07:04:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:04:06,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:06,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:06,651 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:06,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:06,652 INFO L82 PathProgramCache]: Analyzing trace with hash -998289140, now seen corresponding path program 1 times [2019-09-10 07:04:06,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:06,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:06,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:06,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:06,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:07,169 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:04:07,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:07,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:04:07,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:07,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:04:07,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:04:07,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:04:07,175 INFO L87 Difference]: Start difference. First operand 234350 states and 329040 transitions. Second operand 13 states. [2019-09-10 07:04:07,695 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:04:08,517 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:04:08,664 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:04:08,832 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:04:09,075 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:04:09,264 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 07:04:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:13,542 INFO L93 Difference]: Finished difference Result 1131274 states and 1582884 transitions. [2019-09-10 07:04:13,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:04:13,542 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2019-09-10 07:04:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:15,108 INFO L225 Difference]: With dead ends: 1131274 [2019-09-10 07:04:15,108 INFO L226 Difference]: Without dead ends: 1131274 [2019-09-10 07:04:15,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:04:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131274 states. [2019-09-10 07:04:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131274 to 231685. [2019-09-10 07:04:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231685 states. [2019-09-10 07:04:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231685 states to 231685 states and 325404 transitions. [2019-09-10 07:04:33,601 INFO L78 Accepts]: Start accepts. Automaton has 231685 states and 325404 transitions. Word has length 82 [2019-09-10 07:04:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:33,601 INFO L475 AbstractCegarLoop]: Abstraction has 231685 states and 325404 transitions. [2019-09-10 07:04:33,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:04:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 231685 states and 325404 transitions. [2019-09-10 07:04:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:04:33,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:33,605 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:33,605 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:33,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:33,606 INFO L82 PathProgramCache]: Analyzing trace with hash -290649160, now seen corresponding path program 1 times [2019-09-10 07:04:33,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:33,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:33,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:33,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:33,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:34,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:34,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:04:34,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:34,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:04:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:04:34,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:04:34,173 INFO L87 Difference]: Start difference. First operand 231685 states and 325404 transitions. Second operand 13 states. [2019-09-10 07:04:34,559 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:04:34,720 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:04:34,903 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:04:35,042 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:04:35,187 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:04:35,310 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 07:04:35,475 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:04:35,634 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:04:35,833 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:04:36,136 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 07:04:36,584 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:04:37,152 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:04:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:41,801 INFO L93 Difference]: Finished difference Result 1418718 states and 1980903 transitions. [2019-09-10 07:04:41,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:04:41,801 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2019-09-10 07:04:41,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:51,994 INFO L225 Difference]: With dead ends: 1418718 [2019-09-10 07:04:51,994 INFO L226 Difference]: Without dead ends: 1418718 [2019-09-10 07:04:51,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:04:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418718 states. [2019-09-10 07:04:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418718 to 231604. [2019-09-10 07:04:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231604 states. [2019-09-10 07:04:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231604 states to 231604 states and 325301 transitions. [2019-09-10 07:04:59,884 INFO L78 Accepts]: Start accepts. Automaton has 231604 states and 325301 transitions. Word has length 82 [2019-09-10 07:04:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:59,884 INFO L475 AbstractCegarLoop]: Abstraction has 231604 states and 325301 transitions. [2019-09-10 07:04:59,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:04:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 231604 states and 325301 transitions. [2019-09-10 07:04:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:04:59,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:59,888 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:59,888 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:59,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1362751374, now seen corresponding path program 1 times [2019-09-10 07:04:59,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:59,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:59,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:59,933 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:04:59,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:59,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:04:59,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:59,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:04:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:04:59,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:04:59,935 INFO L87 Difference]: Start difference. First operand 231604 states and 325301 transitions. Second operand 3 states. [2019-09-10 07:05:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:00,690 INFO L93 Difference]: Finished difference Result 350603 states and 492030 transitions. [2019-09-10 07:05:00,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:00,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:05:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:01,116 INFO L225 Difference]: With dead ends: 350603 [2019-09-10 07:05:01,116 INFO L226 Difference]: Without dead ends: 350603 [2019-09-10 07:05:01,117 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:05:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350603 states. [2019-09-10 07:05:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350603 to 220059. [2019-09-10 07:05:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220059 states. [2019-09-10 07:05:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220059 states to 220059 states and 308807 transitions. [2019-09-10 07:05:08,790 INFO L78 Accepts]: Start accepts. Automaton has 220059 states and 308807 transitions. Word has length 83 [2019-09-10 07:05:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:08,790 INFO L475 AbstractCegarLoop]: Abstraction has 220059 states and 308807 transitions. [2019-09-10 07:05:08,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 220059 states and 308807 transitions. [2019-09-10 07:05:08,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:05:08,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:08,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:08,794 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:08,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:08,795 INFO L82 PathProgramCache]: Analyzing trace with hash -16938004, now seen corresponding path program 1 times [2019-09-10 07:05:08,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:08,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:08,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:08,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:08,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:08,831 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:05:08,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:08,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:08,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:08,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:08,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:08,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:08,832 INFO L87 Difference]: Start difference. First operand 220059 states and 308807 transitions. Second operand 3 states. [2019-09-10 07:05:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:10,164 INFO L93 Difference]: Finished difference Result 344599 states and 482353 transitions. [2019-09-10 07:05:10,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:10,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:05:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:10,580 INFO L225 Difference]: With dead ends: 344599 [2019-09-10 07:05:10,580 INFO L226 Difference]: Without dead ends: 344599 [2019-09-10 07:05:10,580 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:05:10,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344599 states. [2019-09-10 07:05:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344599 to 272087. [2019-09-10 07:05:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272087 states. [2019-09-10 07:05:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272087 states to 272087 states and 382102 transitions. [2019-09-10 07:05:17,925 INFO L78 Accepts]: Start accepts. Automaton has 272087 states and 382102 transitions. Word has length 83 [2019-09-10 07:05:17,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:17,926 INFO L475 AbstractCegarLoop]: Abstraction has 272087 states and 382102 transitions. [2019-09-10 07:05:17,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:17,926 INFO L276 IsEmpty]: Start isEmpty. Operand 272087 states and 382102 transitions. [2019-09-10 07:05:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:05:17,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:17,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:17,930 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:17,931 INFO L82 PathProgramCache]: Analyzing trace with hash 697556452, now seen corresponding path program 1 times [2019-09-10 07:05:17,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:17,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:17,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:17,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:17,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:17,994 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:05:17,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:17,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:17,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:17,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:17,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:17,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:17,996 INFO L87 Difference]: Start difference. First operand 272087 states and 382102 transitions. Second operand 3 states. [2019-09-10 07:05:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:18,541 INFO L93 Difference]: Finished difference Result 256056 states and 356398 transitions. [2019-09-10 07:05:18,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:18,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 07:05:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:19,733 INFO L225 Difference]: With dead ends: 256056 [2019-09-10 07:05:19,734 INFO L226 Difference]: Without dead ends: 256056 [2019-09-10 07:05:19,734 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:05:19,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256056 states. [2019-09-10 07:05:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256056 to 256054. [2019-09-10 07:05:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256054 states. [2019-09-10 07:05:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256054 states to 256054 states and 356397 transitions. [2019-09-10 07:05:22,404 INFO L78 Accepts]: Start accepts. Automaton has 256054 states and 356397 transitions. Word has length 85 [2019-09-10 07:05:22,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:22,404 INFO L475 AbstractCegarLoop]: Abstraction has 256054 states and 356397 transitions. [2019-09-10 07:05:22,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 256054 states and 356397 transitions. [2019-09-10 07:05:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:05:22,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:22,409 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:22,409 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:22,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:22,409 INFO L82 PathProgramCache]: Analyzing trace with hash -236803730, now seen corresponding path program 1 times [2019-09-10 07:05:22,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:22,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:22,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:23,417 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:05:23,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:23,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:23,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:23,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:23,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:23,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:23,419 INFO L87 Difference]: Start difference. First operand 256054 states and 356397 transitions. Second operand 3 states. [2019-09-10 07:05:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:23,991 INFO L93 Difference]: Finished difference Result 242451 states and 333128 transitions. [2019-09-10 07:05:23,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:23,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:05:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:24,265 INFO L225 Difference]: With dead ends: 242451 [2019-09-10 07:05:24,265 INFO L226 Difference]: Without dead ends: 242451 [2019-09-10 07:05:24,265 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:05:24,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242451 states. [2019-09-10 07:05:29,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242451 to 242449. [2019-09-10 07:05:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242449 states. [2019-09-10 07:05:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242449 states to 242449 states and 333127 transitions. [2019-09-10 07:05:30,330 INFO L78 Accepts]: Start accepts. Automaton has 242449 states and 333127 transitions. Word has length 86 [2019-09-10 07:05:30,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:30,330 INFO L475 AbstractCegarLoop]: Abstraction has 242449 states and 333127 transitions. [2019-09-10 07:05:30,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 242449 states and 333127 transitions. [2019-09-10 07:05:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:05:30,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:30,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:30,335 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:30,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1303605833, now seen corresponding path program 1 times [2019-09-10 07:05:30,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:30,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:30,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:30,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:30,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:30,368 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:05:30,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:30,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:30,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:30,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:30,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:30,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:30,369 INFO L87 Difference]: Start difference. First operand 242449 states and 333127 transitions. Second operand 3 states. [2019-09-10 07:05:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:31,265 INFO L93 Difference]: Finished difference Result 379156 states and 519979 transitions. [2019-09-10 07:05:31,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:31,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 07:05:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:31,722 INFO L225 Difference]: With dead ends: 379156 [2019-09-10 07:05:31,722 INFO L226 Difference]: Without dead ends: 379156 [2019-09-10 07:05:31,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379156 states. [2019-09-10 07:05:39,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379156 to 242196. [2019-09-10 07:05:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242196 states. [2019-09-10 07:05:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242196 states to 242196 states and 332154 transitions. [2019-09-10 07:05:39,470 INFO L78 Accepts]: Start accepts. Automaton has 242196 states and 332154 transitions. Word has length 87 [2019-09-10 07:05:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:39,471 INFO L475 AbstractCegarLoop]: Abstraction has 242196 states and 332154 transitions. [2019-09-10 07:05:39,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 242196 states and 332154 transitions. [2019-09-10 07:05:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:05:39,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:39,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:39,477 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:39,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:39,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1729618236, now seen corresponding path program 1 times [2019-09-10 07:05:39,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:39,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:39,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:39,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:39,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:40,361 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:05:40,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:40,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:05:40,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:40,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:05:40,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:05:40,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:05:40,363 INFO L87 Difference]: Start difference. First operand 242196 states and 332154 transitions. Second operand 18 states. [2019-09-10 07:05:40,994 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:05:41,332 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-09-10 07:05:42,302 WARN L188 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-09-10 07:05:42,522 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:05:42,700 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:05:43,101 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:05:43,295 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 07:05:43,555 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 07:05:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:46,085 INFO L93 Difference]: Finished difference Result 501158 states and 684884 transitions. [2019-09-10 07:05:46,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 07:05:46,086 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-09-10 07:05:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:47,881 INFO L225 Difference]: With dead ends: 501158 [2019-09-10 07:05:47,881 INFO L226 Difference]: Without dead ends: 501158 [2019-09-10 07:05:47,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=272, Invalid=1134, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:05:48,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501158 states. [2019-09-10 07:05:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501158 to 242182. [2019-09-10 07:05:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242182 states. [2019-09-10 07:05:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242182 states to 242182 states and 332136 transitions. [2019-09-10 07:05:58,573 INFO L78 Accepts]: Start accepts. Automaton has 242182 states and 332136 transitions. Word has length 87 [2019-09-10 07:05:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:58,574 INFO L475 AbstractCegarLoop]: Abstraction has 242182 states and 332136 transitions. [2019-09-10 07:05:58,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:05:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 242182 states and 332136 transitions. [2019-09-10 07:05:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:05:58,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:58,579 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:58,579 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:58,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:58,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1178699199, now seen corresponding path program 1 times [2019-09-10 07:05:58,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:58,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:58,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:58,620 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:05:58,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:58,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:58,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:58,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:58,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:58,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:58,622 INFO L87 Difference]: Start difference. First operand 242182 states and 332136 transitions. Second operand 3 states. [2019-09-10 07:05:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:59,459 INFO L93 Difference]: Finished difference Result 323813 states and 443337 transitions. [2019-09-10 07:05:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:59,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 07:05:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:59,860 INFO L225 Difference]: With dead ends: 323813 [2019-09-10 07:05:59,860 INFO L226 Difference]: Without dead ends: 323813 [2019-09-10 07:05:59,861 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:06:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323813 states. [2019-09-10 07:06:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323813 to 236342. [2019-09-10 07:06:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236342 states. [2019-09-10 07:06:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236342 states to 236342 states and 323461 transitions. [2019-09-10 07:06:03,223 INFO L78 Accepts]: Start accepts. Automaton has 236342 states and 323461 transitions. Word has length 87 [2019-09-10 07:06:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:03,224 INFO L475 AbstractCegarLoop]: Abstraction has 236342 states and 323461 transitions. [2019-09-10 07:06:03,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 236342 states and 323461 transitions. [2019-09-10 07:06:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:06:03,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:03,229 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:03,229 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:03,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:03,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1403901146, now seen corresponding path program 1 times [2019-09-10 07:06:03,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:03,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:03,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:03,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:03,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:04,452 WARN L188 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-09-10 07:06:04,983 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:06:04,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:04,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:06:04,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:04,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:06:04,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:06:04,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:06:04,985 INFO L87 Difference]: Start difference. First operand 236342 states and 323461 transitions. Second operand 18 states. [2019-09-10 07:06:05,770 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:06:06,011 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 07:06:06,198 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:06:06,491 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:06:06,810 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:06:07,003 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 07:06:07,197 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:06:07,377 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:06:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:12,142 INFO L93 Difference]: Finished difference Result 942006 states and 1291579 transitions. [2019-09-10 07:06:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:06:12,143 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 88 [2019-09-10 07:06:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:19,728 INFO L225 Difference]: With dead ends: 942006 [2019-09-10 07:06:19,729 INFO L226 Difference]: Without dead ends: 942006 [2019-09-10 07:06:19,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=298, Invalid=1342, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:06:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942006 states. [2019-09-10 07:06:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942006 to 236352. [2019-09-10 07:06:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236352 states. [2019-09-10 07:06:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236352 states to 236352 states and 323469 transitions. [2019-09-10 07:06:24,765 INFO L78 Accepts]: Start accepts. Automaton has 236352 states and 323469 transitions. Word has length 88 [2019-09-10 07:06:24,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:24,765 INFO L475 AbstractCegarLoop]: Abstraction has 236352 states and 323469 transitions. [2019-09-10 07:06:24,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:06:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 236352 states and 323469 transitions. [2019-09-10 07:06:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:06:24,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:24,779 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] [2019-09-10 07:06:24,780 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:24,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:24,780 INFO L82 PathProgramCache]: Analyzing trace with hash 274272273, now seen corresponding path program 1 times [2019-09-10 07:06:24,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:24,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:24,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:24,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:24,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:24,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:24,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:24,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:24,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:24,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:24,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:24,829 INFO L87 Difference]: Start difference. First operand 236352 states and 323469 transitions. Second operand 3 states. [2019-09-10 07:06:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:25,728 INFO L93 Difference]: Finished difference Result 450379 states and 609023 transitions. [2019-09-10 07:06:25,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:25,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 07:06:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:26,259 INFO L225 Difference]: With dead ends: 450379 [2019-09-10 07:06:26,259 INFO L226 Difference]: Without dead ends: 445144 [2019-09-10 07:06:26,260 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:06:26,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445144 states. [2019-09-10 07:06:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445144 to 418866. [2019-09-10 07:06:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418866 states. [2019-09-10 07:06:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418866 states to 418866 states and 569429 transitions. [2019-09-10 07:06:32,655 INFO L78 Accepts]: Start accepts. Automaton has 418866 states and 569429 transitions. Word has length 96 [2019-09-10 07:06:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:32,655 INFO L475 AbstractCegarLoop]: Abstraction has 418866 states and 569429 transitions. [2019-09-10 07:06:32,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 418866 states and 569429 transitions. [2019-09-10 07:06:32,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:06:32,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:32,668 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] [2019-09-10 07:06:32,668 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:32,669 INFO L82 PathProgramCache]: Analyzing trace with hash -102128551, now seen corresponding path program 1 times [2019-09-10 07:06:32,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:32,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:32,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:32,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:32,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:32,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:32,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:32,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:32,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:32,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:32,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:32,710 INFO L87 Difference]: Start difference. First operand 418866 states and 569429 transitions. Second operand 3 states. [2019-09-10 07:06:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:35,242 INFO L93 Difference]: Finished difference Result 780552 states and 1047368 transitions. [2019-09-10 07:06:35,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:35,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 07:06:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:37,718 INFO L225 Difference]: With dead ends: 780552 [2019-09-10 07:06:37,718 INFO L226 Difference]: Without dead ends: 767322 [2019-09-10 07:06:37,718 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:06:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767322 states. [2019-09-10 07:06:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767322 to 708620. [2019-09-10 07:06:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708620 states. [2019-09-10 07:06:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708620 states to 708620 states and 957898 transitions. [2019-09-10 07:06:53,058 INFO L78 Accepts]: Start accepts. Automaton has 708620 states and 957898 transitions. Word has length 97 [2019-09-10 07:06:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:53,058 INFO L475 AbstractCegarLoop]: Abstraction has 708620 states and 957898 transitions. [2019-09-10 07:06:53,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 708620 states and 957898 transitions. [2019-09-10 07:06:53,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:06:53,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:53,069 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:53,069 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:53,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:53,069 INFO L82 PathProgramCache]: Analyzing trace with hash 958556122, now seen corresponding path program 1 times [2019-09-10 07:06:53,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:53,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:53,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:53,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:53,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:53,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:53,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:53,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:53,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:53,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:53,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:53,110 INFO L87 Difference]: Start difference. First operand 708620 states and 957898 transitions. Second operand 3 states. [2019-09-10 07:07:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:05,892 INFO L93 Difference]: Finished difference Result 1141566 states and 1532040 transitions. [2019-09-10 07:07:05,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:05,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:07:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:07,368 INFO L225 Difference]: With dead ends: 1141566 [2019-09-10 07:07:07,368 INFO L226 Difference]: Without dead ends: 1141566 [2019-09-10 07:07:07,368 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:07:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141566 states. [2019-09-10 07:07:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141566 to 1081334. [2019-09-10 07:07:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081334 states. [2019-09-10 07:07:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081334 states to 1081334 states and 1457589 transitions. [2019-09-10 07:07:37,059 INFO L78 Accepts]: Start accepts. Automaton has 1081334 states and 1457589 transitions. Word has length 98 [2019-09-10 07:07:37,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:37,059 INFO L475 AbstractCegarLoop]: Abstraction has 1081334 states and 1457589 transitions. [2019-09-10 07:07:37,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1081334 states and 1457589 transitions. [2019-09-10 07:07:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 07:07:37,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:37,073 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:07:37,074 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:37,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:37,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2085962627, now seen corresponding path program 1 times [2019-09-10 07:07:37,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:37,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:37,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:37,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:37,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:37,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:07:37,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:37,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:07:37,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:07:37,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:07:37,124 INFO L87 Difference]: Start difference. First operand 1081334 states and 1457589 transitions. Second operand 5 states. [2019-09-10 07:07:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:47,226 INFO L93 Difference]: Finished difference Result 2234599 states and 2891479 transitions. [2019-09-10 07:07:47,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:07:47,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 07:07:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:50,229 INFO L225 Difference]: With dead ends: 2234599 [2019-09-10 07:07:50,229 INFO L226 Difference]: Without dead ends: 2234599 [2019-09-10 07:07:50,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:08:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234599 states. [2019-09-10 07:08:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234599 to 1171825. [2019-09-10 07:08:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171825 states. [2019-09-10 07:08:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171825 states to 1171825 states and 1549506 transitions. [2019-09-10 07:08:26,296 INFO L78 Accepts]: Start accepts. Automaton has 1171825 states and 1549506 transitions. Word has length 113 [2019-09-10 07:08:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:26,297 INFO L475 AbstractCegarLoop]: Abstraction has 1171825 states and 1549506 transitions. [2019-09-10 07:08:26,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:08:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1171825 states and 1549506 transitions. [2019-09-10 07:08:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 07:08:26,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:26,326 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:26,326 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:26,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash 168628831, now seen corresponding path program 1 times [2019-09-10 07:08:26,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:26,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:26,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:26,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:26,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:26,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:26,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:26,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:26,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:26,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:26,376 INFO L87 Difference]: Start difference. First operand 1171825 states and 1549506 transitions. Second operand 3 states. [2019-09-10 07:08:44,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:44,565 INFO L93 Difference]: Finished difference Result 2215604 states and 2857215 transitions. [2019-09-10 07:08:44,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:44,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 07:08:44,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:49,686 INFO L225 Difference]: With dead ends: 2215604 [2019-09-10 07:08:49,686 INFO L226 Difference]: Without dead ends: 2215604 [2019-09-10 07:08:49,687 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:08:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215604 states.