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.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:23:15,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:23:15,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:23:15,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:23:15,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:23:15,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:23:15,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:23:15,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:23:15,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:23:15,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:23:15,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:23:15,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:23:15,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:23:15,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:23:15,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:23:15,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:23:15,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:23:15,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:23:15,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:23:15,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:23:15,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:23:15,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:23:15,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:23:15,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:23:15,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:23:15,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:23:15,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:23:15,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:23:16,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:23:16,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:23:16,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:23:16,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:23:16,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:23:16,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:23:16,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:23:16,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:23:16,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:23:16,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:23:16,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:23:16,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:23:16,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:23:16,015 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:23:16,043 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:23:16,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:23:16,044 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:23:16,044 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:23:16,045 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:23:16,045 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:23:16,045 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:23:16,045 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:23:16,046 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:23:16,046 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:23:16,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:23:16,048 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:23:16,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:23:16,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:23:16,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:23:16,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:23:16,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:23:16,049 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:23:16,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:23:16,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:23:16,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:23:16,050 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:23:16,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:23:16,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:23:16,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:23:16,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:23:16,051 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:23:16,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:23:16,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:23:16,052 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:23:16,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:23:16,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:23:16,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:23:16,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:23:16,124 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:23:16,125 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.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-10 07:23:16,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc04ba1e/9dd684962da14f39a499dd704b43243c/FLAGd0eb0c275 [2019-09-10 07:23:16,751 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:23:16,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-10 07:23:16,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc04ba1e/9dd684962da14f39a499dd704b43243c/FLAGd0eb0c275 [2019-09-10 07:23:17,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc04ba1e/9dd684962da14f39a499dd704b43243c [2019-09-10 07:23:17,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:23:17,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:23:17,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:23:17,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:23:17,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:23:17,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:23:17" (1/1) ... [2019-09-10 07:23:17,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9af6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:17, skipping insertion in model container [2019-09-10 07:23:17,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:23:17" (1/1) ... [2019-09-10 07:23:17,032 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:23:17,099 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:23:17,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:23:17,563 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:23:17,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:23:17,715 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:23:17,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:17 WrapperNode [2019-09-10 07:23:17,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:23:17,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:23:17,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:23:17,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:23:17,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:17" (1/1) ... [2019-09-10 07:23:17,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:17" (1/1) ... [2019-09-10 07:23:17,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:17" (1/1) ... [2019-09-10 07:23:17,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:17" (1/1) ... [2019-09-10 07:23:17,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:17" (1/1) ... [2019-09-10 07:23:17,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:17" (1/1) ... [2019-09-10 07:23:17,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:17" (1/1) ... [2019-09-10 07:23:17,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:23:17,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:23:17,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:23:17,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:23:17,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:17" (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:23:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:23:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:23:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:23:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:23:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:23:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:23:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:23:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:23:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:23:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:23:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:23:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:23:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:23:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:23:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:23:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 07:23:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:23:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:23:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:23:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:23:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:23:19,121 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:23:19,121 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:23:19,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:23:19 BoogieIcfgContainer [2019-09-10 07:23:19,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:23:19,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:23:19,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:23:19,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:23:19,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:23:17" (1/3) ... [2019-09-10 07:23:19,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42179808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:23:19, skipping insertion in model container [2019-09-10 07:23:19,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:17" (2/3) ... [2019-09-10 07:23:19,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42179808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:23:19, skipping insertion in model container [2019-09-10 07:23:19,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:23:19" (3/3) ... [2019-09-10 07:23:19,130 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-10 07:23:19,139 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:23:19,148 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:23:19,164 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:23:19,190 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:23:19,190 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:23:19,190 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:23:19,190 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:23:19,191 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:23:19,191 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:23:19,191 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:23:19,191 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:23:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2019-09-10 07:23:19,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:23:19,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:19,230 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:19,231 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:19,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:19,236 INFO L82 PathProgramCache]: Analyzing trace with hash -722684115, now seen corresponding path program 1 times [2019-09-10 07:23:19,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:19,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:19,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:19,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:19,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:19,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:19,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:19,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:19,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:19,698 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2019-09-10 07:23:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:19,862 INFO L93 Difference]: Finished difference Result 394 states and 654 transitions. [2019-09-10 07:23:19,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:19,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:23:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:19,888 INFO L225 Difference]: With dead ends: 394 [2019-09-10 07:23:19,889 INFO L226 Difference]: Without dead ends: 386 [2019-09-10 07:23:19,890 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:23:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-10 07:23:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 384. [2019-09-10 07:23:19,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-10 07:23:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 572 transitions. [2019-09-10 07:23:19,965 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 572 transitions. Word has length 100 [2019-09-10 07:23:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:19,965 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 572 transitions. [2019-09-10 07:23:19,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:19,966 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 572 transitions. [2019-09-10 07:23:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:23:19,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:19,971 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:19,971 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:19,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1251665587, now seen corresponding path program 1 times [2019-09-10 07:23:19,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:19,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:19,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:19,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:19,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:20,444 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:23:20,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:20,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:23:20,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:20,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:23:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:23:20,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:23:20,449 INFO L87 Difference]: Start difference. First operand 384 states and 572 transitions. Second operand 8 states. [2019-09-10 07:23:20,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:20,944 INFO L93 Difference]: Finished difference Result 1615 states and 2481 transitions. [2019-09-10 07:23:20,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:23:20,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-10 07:23:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:20,959 INFO L225 Difference]: With dead ends: 1615 [2019-09-10 07:23:20,959 INFO L226 Difference]: Without dead ends: 1615 [2019-09-10 07:23:20,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:23:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2019-09-10 07:23:21,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1605. [2019-09-10 07:23:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-09-10 07:23:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2476 transitions. [2019-09-10 07:23:21,028 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2476 transitions. Word has length 101 [2019-09-10 07:23:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:21,029 INFO L475 AbstractCegarLoop]: Abstraction has 1605 states and 2476 transitions. [2019-09-10 07:23:21,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:23:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2476 transitions. [2019-09-10 07:23:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:23:21,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:21,034 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:21,034 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:21,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:21,035 INFO L82 PathProgramCache]: Analyzing trace with hash -162540615, now seen corresponding path program 1 times [2019-09-10 07:23:21,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:21,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:21,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:21,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:21,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:21,191 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:23:21,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:21,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:23:21,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:21,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:23:21,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:23:21,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:23:21,193 INFO L87 Difference]: Start difference. First operand 1605 states and 2476 transitions. Second operand 6 states. [2019-09-10 07:23:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:21,745 INFO L93 Difference]: Finished difference Result 4027 states and 6279 transitions. [2019-09-10 07:23:21,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:23:21,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-09-10 07:23:21,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:21,769 INFO L225 Difference]: With dead ends: 4027 [2019-09-10 07:23:21,769 INFO L226 Difference]: Without dead ends: 4027 [2019-09-10 07:23:21,770 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:23:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4027 states. [2019-09-10 07:23:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4027 to 4023. [2019-09-10 07:23:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4023 states. [2019-09-10 07:23:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4023 states to 4023 states and 6277 transitions. [2019-09-10 07:23:21,858 INFO L78 Accepts]: Start accepts. Automaton has 4023 states and 6277 transitions. Word has length 102 [2019-09-10 07:23:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:21,860 INFO L475 AbstractCegarLoop]: Abstraction has 4023 states and 6277 transitions. [2019-09-10 07:23:21,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:23:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4023 states and 6277 transitions. [2019-09-10 07:23:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:23:21,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:21,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:21,865 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:21,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:21,866 INFO L82 PathProgramCache]: Analyzing trace with hash 198125813, now seen corresponding path program 1 times [2019-09-10 07:23:21,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:21,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:21,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:21,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:21,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:22,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:22,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:23:22,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:22,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:23:22,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:23:22,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:23:22,050 INFO L87 Difference]: Start difference. First operand 4023 states and 6277 transitions. Second operand 5 states. [2019-09-10 07:23:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:22,424 INFO L93 Difference]: Finished difference Result 7189 states and 11226 transitions. [2019-09-10 07:23:22,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:23:22,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:23:22,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:22,468 INFO L225 Difference]: With dead ends: 7189 [2019-09-10 07:23:22,469 INFO L226 Difference]: Without dead ends: 7189 [2019-09-10 07:23:22,470 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:23:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7189 states. [2019-09-10 07:23:22,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7189 to 7187. [2019-09-10 07:23:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7187 states. [2019-09-10 07:23:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7187 states to 7187 states and 11225 transitions. [2019-09-10 07:23:22,723 INFO L78 Accepts]: Start accepts. Automaton has 7187 states and 11225 transitions. Word has length 102 [2019-09-10 07:23:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:22,724 INFO L475 AbstractCegarLoop]: Abstraction has 7187 states and 11225 transitions. [2019-09-10 07:23:22,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:23:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 7187 states and 11225 transitions. [2019-09-10 07:23:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:23:22,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:22,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:22,730 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:22,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:22,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1305613734, now seen corresponding path program 1 times [2019-09-10 07:23:22,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:22,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:22,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:22,893 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:23:22,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:22,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:23:22,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:22,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:23:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:23:22,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:23:22,895 INFO L87 Difference]: Start difference. First operand 7187 states and 11225 transitions. Second operand 5 states. [2019-09-10 07:23:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:23,346 INFO L93 Difference]: Finished difference Result 13543 states and 21106 transitions. [2019-09-10 07:23:23,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:23:23,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:23:23,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:23,412 INFO L225 Difference]: With dead ends: 13543 [2019-09-10 07:23:23,412 INFO L226 Difference]: Without dead ends: 13543 [2019-09-10 07:23:23,413 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:23:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13543 states. [2019-09-10 07:23:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13543 to 13541. [2019-09-10 07:23:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13541 states. [2019-09-10 07:23:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13541 states to 13541 states and 21105 transitions. [2019-09-10 07:23:23,758 INFO L78 Accepts]: Start accepts. Automaton has 13541 states and 21105 transitions. Word has length 102 [2019-09-10 07:23:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:23,759 INFO L475 AbstractCegarLoop]: Abstraction has 13541 states and 21105 transitions. [2019-09-10 07:23:23,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:23:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 13541 states and 21105 transitions. [2019-09-10 07:23:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:23:23,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:23,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:23,766 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:23,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash 715347543, now seen corresponding path program 1 times [2019-09-10 07:23:23,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:23,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:23,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:23,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:23,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:23,970 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:23:23,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:23,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:23:23,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:23,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:23:23,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:23:23,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:23:23,973 INFO L87 Difference]: Start difference. First operand 13541 states and 21105 transitions. Second operand 5 states. [2019-09-10 07:23:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:24,364 INFO L93 Difference]: Finished difference Result 26373 states and 40963 transitions. [2019-09-10 07:23:24,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:23:24,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:23:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:24,419 INFO L225 Difference]: With dead ends: 26373 [2019-09-10 07:23:24,419 INFO L226 Difference]: Without dead ends: 26373 [2019-09-10 07:23:24,419 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:23:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26373 states. [2019-09-10 07:23:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26373 to 26371. [2019-09-10 07:23:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26371 states. [2019-09-10 07:23:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26371 states to 26371 states and 40962 transitions. [2019-09-10 07:23:24,888 INFO L78 Accepts]: Start accepts. Automaton has 26371 states and 40962 transitions. Word has length 102 [2019-09-10 07:23:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:24,888 INFO L475 AbstractCegarLoop]: Abstraction has 26371 states and 40962 transitions. [2019-09-10 07:23:24,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:23:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 26371 states and 40962 transitions. [2019-09-10 07:23:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:23:24,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:24,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:24,897 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:24,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:24,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1462064376, now seen corresponding path program 1 times [2019-09-10 07:23:24,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:24,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:24,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:24,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:24,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:24,990 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:23:24,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:24,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:23:24,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:24,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:23:24,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:23:24,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:23:24,992 INFO L87 Difference]: Start difference. First operand 26371 states and 40962 transitions. Second operand 5 states. [2019-09-10 07:23:25,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:25,431 INFO L93 Difference]: Finished difference Result 52137 states and 80623 transitions. [2019-09-10 07:23:25,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:23:25,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:23:25,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:26,360 INFO L225 Difference]: With dead ends: 52137 [2019-09-10 07:23:26,360 INFO L226 Difference]: Without dead ends: 52137 [2019-09-10 07:23:26,361 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:23:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52137 states. [2019-09-10 07:23:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52137 to 52135. [2019-09-10 07:23:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52135 states. [2019-09-10 07:23:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52135 states to 52135 states and 80622 transitions. [2019-09-10 07:23:27,165 INFO L78 Accepts]: Start accepts. Automaton has 52135 states and 80622 transitions. Word has length 102 [2019-09-10 07:23:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:27,166 INFO L475 AbstractCegarLoop]: Abstraction has 52135 states and 80622 transitions. [2019-09-10 07:23:27,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:23:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 52135 states and 80622 transitions. [2019-09-10 07:23:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:23:27,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:27,181 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:27,182 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:27,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:27,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1022424041, now seen corresponding path program 1 times [2019-09-10 07:23:27,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:27,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:27,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:27,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:27,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:27,316 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:23:27,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:27,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:23:27,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:27,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:23:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:23:27,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:23:27,319 INFO L87 Difference]: Start difference. First operand 52135 states and 80622 transitions. Second operand 5 states. [2019-09-10 07:23:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:28,178 INFO L93 Difference]: Finished difference Result 96253 states and 148372 transitions. [2019-09-10 07:23:28,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:23:28,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:23:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:28,318 INFO L225 Difference]: With dead ends: 96253 [2019-09-10 07:23:28,319 INFO L226 Difference]: Without dead ends: 96253 [2019-09-10 07:23:28,319 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:23:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96253 states. [2019-09-10 07:23:30,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96253 to 96251. [2019-09-10 07:23:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96251 states. [2019-09-10 07:23:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96251 states to 96251 states and 148371 transitions. [2019-09-10 07:23:30,756 INFO L78 Accepts]: Start accepts. Automaton has 96251 states and 148371 transitions. Word has length 103 [2019-09-10 07:23:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:30,756 INFO L475 AbstractCegarLoop]: Abstraction has 96251 states and 148371 transitions. [2019-09-10 07:23:30,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:23:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 96251 states and 148371 transitions. [2019-09-10 07:23:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:23:30,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:30,777 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:30,777 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:30,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1830192834, now seen corresponding path program 1 times [2019-09-10 07:23:30,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:30,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:30,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:30,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:30,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:31,205 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:23:31,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:31,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:23:31,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:31,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:23:31,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:23:31,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:23:31,207 INFO L87 Difference]: Start difference. First operand 96251 states and 148371 transitions. Second operand 5 states. [2019-09-10 07:23:31,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:31,844 INFO L93 Difference]: Finished difference Result 184267 states and 282323 transitions. [2019-09-10 07:23:31,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:23:31,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:23:31,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:32,132 INFO L225 Difference]: With dead ends: 184267 [2019-09-10 07:23:32,132 INFO L226 Difference]: Without dead ends: 184267 [2019-09-10 07:23:32,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:23:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184267 states. [2019-09-10 07:23:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184267 to 97307. [2019-09-10 07:23:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97307 states. [2019-09-10 07:23:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97307 states to 97307 states and 149427 transitions. [2019-09-10 07:23:36,127 INFO L78 Accepts]: Start accepts. Automaton has 97307 states and 149427 transitions. Word has length 103 [2019-09-10 07:23:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:36,128 INFO L475 AbstractCegarLoop]: Abstraction has 97307 states and 149427 transitions. [2019-09-10 07:23:36,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:23:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 97307 states and 149427 transitions. [2019-09-10 07:23:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:23:36,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:36,147 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:36,147 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:36,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1225615889, now seen corresponding path program 1 times [2019-09-10 07:23:36,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:36,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:36,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:36,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:36,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:36,358 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:23:36,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:36,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:23:36,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:36,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:23:36,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:23:36,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:23:36,363 INFO L87 Difference]: Start difference. First operand 97307 states and 149427 transitions. Second operand 4 states. [2019-09-10 07:23:36,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:36,860 INFO L93 Difference]: Finished difference Result 182973 states and 278996 transitions. [2019-09-10 07:23:36,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:23:36,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-10 07:23:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:37,142 INFO L225 Difference]: With dead ends: 182973 [2019-09-10 07:23:37,143 INFO L226 Difference]: Without dead ends: 182973 [2019-09-10 07:23:37,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:23:37,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182973 states. [2019-09-10 07:23:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182973 to 182971. [2019-09-10 07:23:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182971 states. [2019-09-10 07:23:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182971 states to 182971 states and 278995 transitions. [2019-09-10 07:23:40,848 INFO L78 Accepts]: Start accepts. Automaton has 182971 states and 278995 transitions. Word has length 104 [2019-09-10 07:23:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:40,848 INFO L475 AbstractCegarLoop]: Abstraction has 182971 states and 278995 transitions. [2019-09-10 07:23:40,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:23:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 182971 states and 278995 transitions. [2019-09-10 07:23:40,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:23:40,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:40,867 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:40,867 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:40,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1191375131, now seen corresponding path program 1 times [2019-09-10 07:23:40,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:40,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:40,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:40,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:40,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:40,937 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:23:40,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:40,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:40,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:40,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:40,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:40,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:40,939 INFO L87 Difference]: Start difference. First operand 182971 states and 278995 transitions. Second operand 3 states. [2019-09-10 07:23:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:42,138 INFO L93 Difference]: Finished difference Result 258782 states and 391584 transitions. [2019-09-10 07:23:42,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:42,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:23:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:42,455 INFO L225 Difference]: With dead ends: 258782 [2019-09-10 07:23:42,456 INFO L226 Difference]: Without dead ends: 258782 [2019-09-10 07:23:42,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258782 states. [2019-09-10 07:23:47,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258782 to 180648. [2019-09-10 07:23:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180648 states. [2019-09-10 07:23:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180648 states to 180648 states and 273593 transitions. [2019-09-10 07:23:48,007 INFO L78 Accepts]: Start accepts. Automaton has 180648 states and 273593 transitions. Word has length 105 [2019-09-10 07:23:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:48,008 INFO L475 AbstractCegarLoop]: Abstraction has 180648 states and 273593 transitions. [2019-09-10 07:23:48,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 180648 states and 273593 transitions. [2019-09-10 07:23:48,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:23:48,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:48,023 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:48,023 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:48,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:48,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2081890073, now seen corresponding path program 1 times [2019-09-10 07:23:48,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:48,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:48,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:48,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:48,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:48,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:23:48,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:48,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:48,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:48,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:48,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:48,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:48,095 INFO L87 Difference]: Start difference. First operand 180648 states and 273593 transitions. Second operand 3 states. [2019-09-10 07:23:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:48,585 INFO L93 Difference]: Finished difference Result 224630 states and 335476 transitions. [2019-09-10 07:23:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:48,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:23:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:48,878 INFO L225 Difference]: With dead ends: 224630 [2019-09-10 07:23:48,879 INFO L226 Difference]: Without dead ends: 224630 [2019-09-10 07:23:48,879 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:23:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224630 states. [2019-09-10 07:23:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224630 to 222986. [2019-09-10 07:23:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222986 states. [2019-09-10 07:23:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222986 states to 222986 states and 333833 transitions. [2019-09-10 07:23:54,074 INFO L78 Accepts]: Start accepts. Automaton has 222986 states and 333833 transitions. Word has length 105 [2019-09-10 07:23:54,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:54,074 INFO L475 AbstractCegarLoop]: Abstraction has 222986 states and 333833 transitions. [2019-09-10 07:23:54,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 222986 states and 333833 transitions. [2019-09-10 07:23:54,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:23:54,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:54,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:54,089 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:54,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:54,089 INFO L82 PathProgramCache]: Analyzing trace with hash -90159259, now seen corresponding path program 1 times [2019-09-10 07:23:54,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:54,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:54,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:54,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:54,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:54,157 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:23:54,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:54,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:54,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:54,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:54,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:54,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:54,159 INFO L87 Difference]: Start difference. First operand 222986 states and 333833 transitions. Second operand 3 states. [2019-09-10 07:23:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:55,536 INFO L93 Difference]: Finished difference Result 250432 states and 368754 transitions. [2019-09-10 07:23:55,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:55,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:23:55,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:55,836 INFO L225 Difference]: With dead ends: 250432 [2019-09-10 07:23:55,836 INFO L226 Difference]: Without dead ends: 250432 [2019-09-10 07:23:55,836 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:23:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250432 states. [2019-09-10 07:24:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250432 to 248584. [2019-09-10 07:24:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248584 states. [2019-09-10 07:24:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248584 states to 248584 states and 366907 transitions. [2019-09-10 07:24:02,114 INFO L78 Accepts]: Start accepts. Automaton has 248584 states and 366907 transitions. Word has length 105 [2019-09-10 07:24:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:02,114 INFO L475 AbstractCegarLoop]: Abstraction has 248584 states and 366907 transitions. [2019-09-10 07:24:02,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:24:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 248584 states and 366907 transitions. [2019-09-10 07:24:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:24:02,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:02,133 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:02,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:02,133 INFO L82 PathProgramCache]: Analyzing trace with hash 335013402, now seen corresponding path program 1 times [2019-09-10 07:24:02,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:02,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:02,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:02,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:02,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:24:02,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:02,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:24:02,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:02,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:24:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:24:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:24:02,203 INFO L87 Difference]: Start difference. First operand 248584 states and 366907 transitions. Second operand 3 states. [2019-09-10 07:24:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:02,985 INFO L93 Difference]: Finished difference Result 256584 states and 372362 transitions. [2019-09-10 07:24:02,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:24:02,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:24:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:03,602 INFO L225 Difference]: With dead ends: 256584 [2019-09-10 07:24:03,602 INFO L226 Difference]: Without dead ends: 255432 [2019-09-10 07:24:03,603 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:24:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255432 states. [2019-09-10 07:24:10,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255432 to 232606. [2019-09-10 07:24:10,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232606 states. [2019-09-10 07:24:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232606 states to 232606 states and 338737 transitions. [2019-09-10 07:24:11,276 INFO L78 Accepts]: Start accepts. Automaton has 232606 states and 338737 transitions. Word has length 105 [2019-09-10 07:24:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:11,276 INFO L475 AbstractCegarLoop]: Abstraction has 232606 states and 338737 transitions. [2019-09-10 07:24:11,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:24:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 232606 states and 338737 transitions. [2019-09-10 07:24:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:24:11,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:11,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:24:11,290 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:11,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:11,290 INFO L82 PathProgramCache]: Analyzing trace with hash -591285467, now seen corresponding path program 1 times [2019-09-10 07:24:11,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:11,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:11,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:11,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:11,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:11,363 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:24:11,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:11,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:24:11,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:11,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:24:11,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:24:11,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:24:11,365 INFO L87 Difference]: Start difference. First operand 232606 states and 338737 transitions. Second operand 3 states. [2019-09-10 07:24:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:12,984 INFO L93 Difference]: Finished difference Result 294666 states and 421214 transitions. [2019-09-10 07:24:12,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:24:12,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:24:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:13,419 INFO L225 Difference]: With dead ends: 294666 [2019-09-10 07:24:13,419 INFO L226 Difference]: Without dead ends: 294666 [2019-09-10 07:24:13,419 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:24:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294666 states. [2019-09-10 07:24:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294666 to 292624. [2019-09-10 07:24:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292624 states. [2019-09-10 07:24:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292624 states to 292624 states and 419173 transitions. [2019-09-10 07:24:23,013 INFO L78 Accepts]: Start accepts. Automaton has 292624 states and 419173 transitions. Word has length 105 [2019-09-10 07:24:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:23,014 INFO L475 AbstractCegarLoop]: Abstraction has 292624 states and 419173 transitions. [2019-09-10 07:24:23,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:24:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 292624 states and 419173 transitions. [2019-09-10 07:24:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:24:23,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:23,030 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:24:23,030 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:23,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1654258983, now seen corresponding path program 1 times [2019-09-10 07:24:23,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:23,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:23,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:23,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:23,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:23,145 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:24:23,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:23,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:24:23,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:23,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:24:23,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:24:23,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:24:23,147 INFO L87 Difference]: Start difference. First operand 292624 states and 419173 transitions. Second operand 7 states. [2019-09-10 07:24:27,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:27,366 INFO L93 Difference]: Finished difference Result 1307616 states and 1858031 transitions. [2019-09-10 07:24:27,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:24:27,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-10 07:24:27,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:29,207 INFO L225 Difference]: With dead ends: 1307616 [2019-09-10 07:24:29,207 INFO L226 Difference]: Without dead ends: 1307616 [2019-09-10 07:24:29,208 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:24:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307616 states. [2019-09-10 07:24:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307616 to 292720. [2019-09-10 07:24:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292720 states. [2019-09-10 07:24:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292720 states to 292720 states and 419301 transitions. [2019-09-10 07:24:45,676 INFO L78 Accepts]: Start accepts. Automaton has 292720 states and 419301 transitions. Word has length 105 [2019-09-10 07:24:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:45,676 INFO L475 AbstractCegarLoop]: Abstraction has 292720 states and 419301 transitions. [2019-09-10 07:24:45,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:24:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 292720 states and 419301 transitions. [2019-09-10 07:24:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:24:45,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:45,695 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:24:45,696 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:45,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:45,696 INFO L82 PathProgramCache]: Analyzing trace with hash -608389222, now seen corresponding path program 1 times [2019-09-10 07:24:45,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:45,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:45,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:45,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:45,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:45,806 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:24:45,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:45,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:24:45,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:45,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:24:45,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:24:45,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:24:45,808 INFO L87 Difference]: Start difference. First operand 292720 states and 419301 transitions. Second operand 7 states. [2019-09-10 07:24:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:49,697 INFO L93 Difference]: Finished difference Result 907732 states and 1281567 transitions. [2019-09-10 07:24:49,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:24:49,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-10 07:24:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:51,020 INFO L225 Difference]: With dead ends: 907732 [2019-09-10 07:24:51,021 INFO L226 Difference]: Without dead ends: 907732 [2019-09-10 07:24:51,021 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:24:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907732 states. [2019-09-10 07:25:05,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907732 to 354704. [2019-09-10 07:25:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354704 states. [2019-09-10 07:25:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354704 states to 354704 states and 506786 transitions. [2019-09-10 07:25:06,554 INFO L78 Accepts]: Start accepts. Automaton has 354704 states and 506786 transitions. Word has length 105 [2019-09-10 07:25:06,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:06,554 INFO L475 AbstractCegarLoop]: Abstraction has 354704 states and 506786 transitions. [2019-09-10 07:25:06,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:25:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 354704 states and 506786 transitions. [2019-09-10 07:25:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:25:06,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:06,575 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:06,575 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:06,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:06,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1884535675, now seen corresponding path program 1 times [2019-09-10 07:25:06,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:06,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:06,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:06,709 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:25:06,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:06,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:25:06,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:06,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:25:06,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:25:06,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:25:06,711 INFO L87 Difference]: Start difference. First operand 354704 states and 506786 transitions. Second operand 7 states. [2019-09-10 07:25:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:17,630 INFO L93 Difference]: Finished difference Result 1700202 states and 2396893 transitions. [2019-09-10 07:25:17,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:25:17,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-10 07:25:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:19,958 INFO L225 Difference]: With dead ends: 1700202 [2019-09-10 07:25:19,959 INFO L226 Difference]: Without dead ends: 1700202 [2019-09-10 07:25:19,959 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:25:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700202 states. [2019-09-10 07:25:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700202 to 356166. [2019-09-10 07:25:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356166 states. [2019-09-10 07:25:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356166 states to 356166 states and 508758 transitions. [2019-09-10 07:25:37,385 INFO L78 Accepts]: Start accepts. Automaton has 356166 states and 508758 transitions. Word has length 105 [2019-09-10 07:25:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:37,385 INFO L475 AbstractCegarLoop]: Abstraction has 356166 states and 508758 transitions. [2019-09-10 07:25:37,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:25:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 356166 states and 508758 transitions. [2019-09-10 07:25:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:25:37,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:37,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:37,402 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:37,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1210332761, now seen corresponding path program 1 times [2019-09-10 07:25:37,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:37,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:37,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:37,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:37,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:37,518 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:25:37,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:37,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:25:37,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:37,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:25:37,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:25:37,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:25:37,522 INFO L87 Difference]: Start difference. First operand 356166 states and 508758 transitions. Second operand 7 states. [2019-09-10 07:25:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:57,068 INFO L93 Difference]: Finished difference Result 1923670 states and 2712303 transitions. [2019-09-10 07:25:57,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:25:57,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-10 07:25:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:59,573 INFO L225 Difference]: With dead ends: 1923670 [2019-09-10 07:25:59,574 INFO L226 Difference]: Without dead ends: 1923670 [2019-09-10 07:25:59,574 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:26:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923670 states. [2019-09-10 07:26:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923670 to 357266. [2019-09-10 07:26:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357266 states. [2019-09-10 07:26:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357266 states to 357266 states and 510221 transitions. [2019-09-10 07:26:13,092 INFO L78 Accepts]: Start accepts. Automaton has 357266 states and 510221 transitions. Word has length 105 [2019-09-10 07:26:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:13,092 INFO L475 AbstractCegarLoop]: Abstraction has 357266 states and 510221 transitions. [2019-09-10 07:26:13,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:26:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 357266 states and 510221 transitions. [2019-09-10 07:26:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:26:13,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:13,110 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:13,111 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:13,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1181530235, now seen corresponding path program 1 times [2019-09-10 07:26:13,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:13,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:13,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:13,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:13,212 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:26:13,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:13,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:26:13,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:13,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:26:13,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:26:13,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:13,214 INFO L87 Difference]: Start difference. First operand 357266 states and 510221 transitions. Second operand 7 states. [2019-09-10 07:26:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:30,212 INFO L93 Difference]: Finished difference Result 2175632 states and 3070016 transitions. [2019-09-10 07:26:30,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:26:30,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-10 07:26:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:34,562 INFO L225 Difference]: With dead ends: 2175632 [2019-09-10 07:26:34,562 INFO L226 Difference]: Without dead ends: 2175632 [2019-09-10 07:26:34,563 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:26:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175632 states. [2019-09-10 07:26:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175632 to 358698. [2019-09-10 07:26:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358698 states. [2019-09-10 07:26:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358698 states to 358698 states and 512161 transitions. [2019-09-10 07:26:56,944 INFO L78 Accepts]: Start accepts. Automaton has 358698 states and 512161 transitions. Word has length 105 [2019-09-10 07:26:56,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:56,945 INFO L475 AbstractCegarLoop]: Abstraction has 358698 states and 512161 transitions. [2019-09-10 07:26:56,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:26:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 358698 states and 512161 transitions. [2019-09-10 07:26:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:26:56,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:56,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:56,966 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash -277368154, now seen corresponding path program 1 times [2019-09-10 07:26:56,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:56,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:56,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:56,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:56,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:57,075 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:26:57,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:57,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:26:57,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:57,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:26:57,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:26:57,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:57,077 INFO L87 Difference]: Start difference. First operand 358698 states and 512161 transitions. Second operand 7 states. [2019-09-10 07:27:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:03,744 INFO L93 Difference]: Finished difference Result 1357252 states and 1924505 transitions. [2019-09-10 07:27:03,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:27:03,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:27:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:27:05,617 INFO L225 Difference]: With dead ends: 1357252 [2019-09-10 07:27:05,617 INFO L226 Difference]: Without dead ends: 1357252 [2019-09-10 07:27:05,617 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:27:06,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357252 states. [2019-09-10 07:27:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357252 to 358878. [2019-09-10 07:27:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358878 states. [2019-09-10 07:27:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358878 states to 358878 states and 512377 transitions. [2019-09-10 07:27:26,788 INFO L78 Accepts]: Start accepts. Automaton has 358878 states and 512377 transitions. Word has length 106 [2019-09-10 07:27:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:26,788 INFO L475 AbstractCegarLoop]: Abstraction has 358878 states and 512377 transitions. [2019-09-10 07:27:26,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:27:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 358878 states and 512377 transitions. [2019-09-10 07:27:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:27:26,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:26,810 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:27:26,810 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1726701336, now seen corresponding path program 1 times [2019-09-10 07:27:26,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:26,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:26,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:26,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:26,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:26,871 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:27:26,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:27:26,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:27:26,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:27:26,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:27:26,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:27:26,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:27:26,873 INFO L87 Difference]: Start difference. First operand 358878 states and 512377 transitions. Second operand 3 states. [2019-09-10 07:27:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:29,317 INFO L93 Difference]: Finished difference Result 522564 states and 733856 transitions. [2019-09-10 07:27:29,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:27:29,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:27:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:27:29,994 INFO L225 Difference]: With dead ends: 522564 [2019-09-10 07:27:29,994 INFO L226 Difference]: Without dead ends: 522564 [2019-09-10 07:27:29,995 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:27:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522564 states. [2019-09-10 07:27:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522564 to 519234. [2019-09-10 07:27:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519234 states. [2019-09-10 07:27:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519234 states to 519234 states and 730487 transitions. [2019-09-10 07:27:41,163 INFO L78 Accepts]: Start accepts. Automaton has 519234 states and 730487 transitions. Word has length 106 [2019-09-10 07:27:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:41,163 INFO L475 AbstractCegarLoop]: Abstraction has 519234 states and 730487 transitions. [2019-09-10 07:27:41,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:27:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 519234 states and 730487 transitions. [2019-09-10 07:27:41,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:27:41,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:41,194 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:27:41,194 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:41,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:41,194 INFO L82 PathProgramCache]: Analyzing trace with hash 926347898, now seen corresponding path program 1 times [2019-09-10 07:27:41,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:41,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:41,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:41,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:41,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:41,345 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:27:41,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:27:41,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:27:41,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:27:41,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:27:41,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:27:41,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:27:41,347 INFO L87 Difference]: Start difference. First operand 519234 states and 730487 transitions. Second operand 8 states. [2019-09-10 07:27:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:56,766 INFO L93 Difference]: Finished difference Result 2341026 states and 3291282 transitions. [2019-09-10 07:27:56,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:27:56,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-09-10 07:27:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:01,193 INFO L225 Difference]: With dead ends: 2341026 [2019-09-10 07:28:01,194 INFO L226 Difference]: Without dead ends: 2341026 [2019-09-10 07:28:01,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:28:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341026 states. [2019-09-10 07:28:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341026 to 594447. [2019-09-10 07:28:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594447 states. [2019-09-10 07:28:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594447 states to 594447 states and 837036 transitions. [2019-09-10 07:28:27,130 INFO L78 Accepts]: Start accepts. Automaton has 594447 states and 837036 transitions. Word has length 107 [2019-09-10 07:28:27,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:27,131 INFO L475 AbstractCegarLoop]: Abstraction has 594447 states and 837036 transitions. [2019-09-10 07:28:27,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:28:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 594447 states and 837036 transitions. [2019-09-10 07:28:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:28:27,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:27,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:27,161 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:27,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash -614361169, now seen corresponding path program 1 times [2019-09-10 07:28:27,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:27,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:27,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:27,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:27,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:27,340 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:28:27,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:27,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:28:27,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:27,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:28:27,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:28:27,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:28:27,342 INFO L87 Difference]: Start difference. First operand 594447 states and 837036 transitions. Second operand 8 states. [2019-09-10 07:28:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:48,487 INFO L93 Difference]: Finished difference Result 2463950 states and 3467276 transitions. [2019-09-10 07:28:49,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:28:49,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-09-10 07:28:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:52,896 INFO L225 Difference]: With dead ends: 2463950 [2019-09-10 07:28:52,896 INFO L226 Difference]: Without dead ends: 2463950 [2019-09-10 07:28:52,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:28:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463950 states. [2019-09-10 07:29:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463950 to 714623. [2019-09-10 07:29:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714623 states. [2019-09-10 07:29:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714623 states to 714623 states and 1005276 transitions. [2019-09-10 07:29:30,771 INFO L78 Accepts]: Start accepts. Automaton has 714623 states and 1005276 transitions. Word has length 107 [2019-09-10 07:29:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:30,771 INFO L475 AbstractCegarLoop]: Abstraction has 714623 states and 1005276 transitions. [2019-09-10 07:29:30,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:29:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 714623 states and 1005276 transitions. [2019-09-10 07:29:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:29:30,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:30,797 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:30,797 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:30,797 INFO L82 PathProgramCache]: Analyzing trace with hash 271296570, now seen corresponding path program 1 times [2019-09-10 07:29:30,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:30,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:30,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:30,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:30,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:30,973 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:29:30,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:30,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:29:30,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:30,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:29:30,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:29:30,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:29:30,975 INFO L87 Difference]: Start difference. First operand 714623 states and 1005276 transitions. Second operand 8 states. [2019-09-10 07:29:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:40,887 INFO L93 Difference]: Finished difference Result 2511266 states and 3532022 transitions. [2019-09-10 07:29:40,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:29:40,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-09-10 07:29:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:59,109 INFO L225 Difference]: With dead ends: 2511266 [2019-09-10 07:29:59,109 INFO L226 Difference]: Without dead ends: 2511266 [2019-09-10 07:29:59,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:30:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511266 states. [2019-09-10 07:30:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511266 to 800955. [2019-09-10 07:30:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800955 states. [2019-09-10 07:30:20,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800955 states to 800955 states and 1127754 transitions. [2019-09-10 07:30:20,172 INFO L78 Accepts]: Start accepts. Automaton has 800955 states and 1127754 transitions. Word has length 107 [2019-09-10 07:30:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:20,172 INFO L475 AbstractCegarLoop]: Abstraction has 800955 states and 1127754 transitions. [2019-09-10 07:30:20,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:30:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand 800955 states and 1127754 transitions. [2019-09-10 07:30:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:30:20,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:20,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:30:20,203 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:20,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:20,203 INFO L82 PathProgramCache]: Analyzing trace with hash 608006396, now seen corresponding path program 1 times [2019-09-10 07:30:20,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:20,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:20,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:20,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:20,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:20,390 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:30:20,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:30:20,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:30:20,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:30:20,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:30:20,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:30:20,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:30:20,392 INFO L87 Difference]: Start difference. First operand 800955 states and 1127754 transitions. Second operand 8 states. [2019-09-10 07:30:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:40,776 INFO L93 Difference]: Finished difference Result 2536358 states and 3566382 transitions. [2019-09-10 07:30:40,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:30:40,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-09-10 07:30:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:45,569 INFO L225 Difference]: With dead ends: 2536358 [2019-09-10 07:30:45,569 INFO L226 Difference]: Without dead ends: 2536358 [2019-09-10 07:30:45,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:30:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536358 states. [2019-09-10 07:31:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536358 to 894629. [2019-09-10 07:31:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894629 states. [2019-09-10 07:31:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894629 states to 894629 states and 1260330 transitions. [2019-09-10 07:31:24,963 INFO L78 Accepts]: Start accepts. Automaton has 894629 states and 1260330 transitions. Word has length 107 [2019-09-10 07:31:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:24,963 INFO L475 AbstractCegarLoop]: Abstraction has 894629 states and 1260330 transitions. [2019-09-10 07:31:24,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:31:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 894629 states and 1260330 transitions. [2019-09-10 07:31:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:31:24,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:24,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:24,994 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:24,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:24,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1654546333, now seen corresponding path program 1 times [2019-09-10 07:31:24,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:24,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:24,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:24,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:24,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:25,194 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:31:25,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:31:25,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:31:25,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:31:25,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:31:25,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:31:25,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:31:25,195 INFO L87 Difference]: Start difference. First operand 894629 states and 1260330 transitions. Second operand 8 states. [2019-09-10 07:31:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:44,350 INFO L93 Difference]: Finished difference Result 2635802 states and 3706934 transitions. [2019-09-10 07:31:44,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:31:44,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2019-09-10 07:31:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:49,251 INFO L225 Difference]: With dead ends: 2635802 [2019-09-10 07:31:49,251 INFO L226 Difference]: Without dead ends: 2635802 [2019-09-10 07:31:49,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:31:50,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635802 states. [2019-09-10 07:32:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635802 to 1029669. [2019-09-10 07:32:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029669 states. [2019-09-10 07:32:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029669 states to 1029669 states and 1451457 transitions. [2019-09-10 07:32:31,187 INFO L78 Accepts]: Start accepts. Automaton has 1029669 states and 1451457 transitions. Word has length 108 [2019-09-10 07:32:31,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:32:31,187 INFO L475 AbstractCegarLoop]: Abstraction has 1029669 states and 1451457 transitions. [2019-09-10 07:32:31,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:32:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1029669 states and 1451457 transitions. [2019-09-10 07:32:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:32:31,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:32:31,222 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:32:31,223 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:32:31,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:32:31,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2134490405, now seen corresponding path program 1 times [2019-09-10 07:32:31,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:32:31,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:31,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:32:31,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:31,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:32:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:32:31,371 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:32:31,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:32:31,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:32:31,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:32:31,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:32:31,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:32:31,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:32:31,373 INFO L87 Difference]: Start difference. First operand 1029669 states and 1451457 transitions. Second operand 8 states.