java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:00:16,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:00:16,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:00:16,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:00:16,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:00:16,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:00:16,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:00:16,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:00:16,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:00:16,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:00:16,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:00:16,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:00:16,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:00:16,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:00:16,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:00:16,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:00:16,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:00:16,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:00:16,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:00:16,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:00:16,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:00:16,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:00:16,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:00:16,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:00:16,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:00:16,945 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:00:16,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:00:16,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:00:16,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:00:16,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:00:16,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:00:16,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:00:16,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:00:16,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:00:16,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:00:16,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:00:16,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:00:16,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:00:16,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:00:16,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:00:16,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:00:16,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:00:16,982 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:00:16,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:00:16,982 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:00:16,983 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:00:16,986 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:00:16,987 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:00:16,987 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:00:16,987 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:00:16,987 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:00:16,988 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:00:16,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:00:16,988 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:00:16,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:00:16,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:00:16,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:00:16,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:00:16,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:00:16,990 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:00:16,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:00:16,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:00:16,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:00:16,991 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:00:16,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:00:16,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:00:16,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:00:16,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:00:16,992 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:00:16,993 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:00:16,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:00:16,993 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:00:17,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:00:17,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:00:17,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:00:17,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:00:17,048 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:00:17,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 07:00:17,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996555eaa/eb6bceb7c1144d55acd34bb453b5b521/FLAG96da7c37c [2019-09-10 07:00:17,886 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:00:17,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 07:00:17,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996555eaa/eb6bceb7c1144d55acd34bb453b5b521/FLAG96da7c37c [2019-09-10 07:00:17,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996555eaa/eb6bceb7c1144d55acd34bb453b5b521 [2019-09-10 07:00:17,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:00:17,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:00:17,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:00:17,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:00:17,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:00:17,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:00:17" (1/1) ... [2019-09-10 07:00:17,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64899908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:17, skipping insertion in model container [2019-09-10 07:00:17,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:00:17" (1/1) ... [2019-09-10 07:00:18,004 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:00:18,174 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:00:19,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:00:19,376 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:00:19,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:00:19,923 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:00:19,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:19 WrapperNode [2019-09-10 07:00:19,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:00:19,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:00:19,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:00:19,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:00:19,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:19" (1/1) ... [2019-09-10 07:00:19,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:19" (1/1) ... [2019-09-10 07:00:20,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:19" (1/1) ... [2019-09-10 07:00:20,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:19" (1/1) ... [2019-09-10 07:00:20,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:19" (1/1) ... [2019-09-10 07:00:20,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:19" (1/1) ... [2019-09-10 07:00:20,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:19" (1/1) ... [2019-09-10 07:00:20,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:00:20,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:00:20,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:00:20,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:00:20,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:00:20,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:00:20,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:00:20,350 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:00:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:00:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:00:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:00:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:00:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:00:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:00:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:00:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:00:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:00:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:00:20,354 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:00:20,355 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:00:20,356 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:00:20,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:00:20,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:00:20,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:00:24,713 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:00:24,714 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:00:24,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:00:24 BoogieIcfgContainer [2019-09-10 07:00:24,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:00:24,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:00:24,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:00:24,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:00:24,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:00:17" (1/3) ... [2019-09-10 07:00:24,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19401389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:00:24, skipping insertion in model container [2019-09-10 07:00:24,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:00:19" (2/3) ... [2019-09-10 07:00:24,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19401389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:00:24, skipping insertion in model container [2019-09-10 07:00:24,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:00:24" (3/3) ... [2019-09-10 07:00:24,724 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 07:00:24,735 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:00:24,745 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-10 07:00:24,761 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-10 07:00:24,796 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:00:24,796 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:00:24,796 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:00:24,796 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:00:24,796 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:00:24,797 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:00:24,797 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:00:24,797 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:00:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states. [2019-09-10 07:00:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:00:24,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:24,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:24,877 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:24,884 INFO L82 PathProgramCache]: Analyzing trace with hash 971331392, now seen corresponding path program 1 times [2019-09-10 07:00:24,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:24,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:24,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:24,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:24,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:25,695 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:00:25,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:25,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:00:25,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:25,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:00:25,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:00:25,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:00:25,727 INFO L87 Difference]: Start difference. First operand 1111 states. Second operand 5 states. [2019-09-10 07:00:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:27,164 INFO L93 Difference]: Finished difference Result 1009 states and 1805 transitions. [2019-09-10 07:00:27,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:00:27,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 07:00:27,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:27,201 INFO L225 Difference]: With dead ends: 1009 [2019-09-10 07:00:27,201 INFO L226 Difference]: Without dead ends: 997 [2019-09-10 07:00:27,205 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:00:27,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-09-10 07:00:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 989. [2019-09-10 07:00:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-09-10 07:00:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1318 transitions. [2019-09-10 07:00:27,320 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1318 transitions. Word has length 68 [2019-09-10 07:00:27,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:27,320 INFO L475 AbstractCegarLoop]: Abstraction has 989 states and 1318 transitions. [2019-09-10 07:00:27,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:00:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1318 transitions. [2019-09-10 07:00:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:00:27,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:27,326 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:27,326 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:27,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:27,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1328541618, now seen corresponding path program 1 times [2019-09-10 07:00:27,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:27,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:27,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:27,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:27,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:27,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:27,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:27,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:27,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:27,519 INFO L87 Difference]: Start difference. First operand 989 states and 1318 transitions. Second operand 3 states. [2019-09-10 07:00:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:27,587 INFO L93 Difference]: Finished difference Result 1414 states and 1871 transitions. [2019-09-10 07:00:27,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:27,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 07:00:27,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:27,595 INFO L225 Difference]: With dead ends: 1414 [2019-09-10 07:00:27,596 INFO L226 Difference]: Without dead ends: 1414 [2019-09-10 07:00:27,597 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:00:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-09-10 07:00:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1405. [2019-09-10 07:00:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2019-09-10 07:00:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1866 transitions. [2019-09-10 07:00:27,636 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1866 transitions. Word has length 69 [2019-09-10 07:00:27,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:27,637 INFO L475 AbstractCegarLoop]: Abstraction has 1405 states and 1866 transitions. [2019-09-10 07:00:27,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1866 transitions. [2019-09-10 07:00:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:00:27,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:27,642 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:27,642 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:27,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:27,643 INFO L82 PathProgramCache]: Analyzing trace with hash 619214809, now seen corresponding path program 1 times [2019-09-10 07:00:27,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:27,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:27,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:27,767 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:00:27,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:27,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:27,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:27,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:27,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:27,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:27,769 INFO L87 Difference]: Start difference. First operand 1405 states and 1866 transitions. Second operand 3 states. [2019-09-10 07:00:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:27,849 INFO L93 Difference]: Finished difference Result 1787 states and 2413 transitions. [2019-09-10 07:00:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:27,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 07:00:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:27,862 INFO L225 Difference]: With dead ends: 1787 [2019-09-10 07:00:27,862 INFO L226 Difference]: Without dead ends: 1787 [2019-09-10 07:00:27,863 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:00:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-09-10 07:00:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1779. [2019-09-10 07:00:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-09-10 07:00:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2409 transitions. [2019-09-10 07:00:27,909 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2409 transitions. Word has length 69 [2019-09-10 07:00:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:27,911 INFO L475 AbstractCegarLoop]: Abstraction has 1779 states and 2409 transitions. [2019-09-10 07:00:27,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2409 transitions. [2019-09-10 07:00:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:00:27,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:27,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:27,918 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:27,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:27,919 INFO L82 PathProgramCache]: Analyzing trace with hash 211809038, now seen corresponding path program 1 times [2019-09-10 07:00:27,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:27,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:27,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:28,079 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:00:28,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:28,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:28,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:28,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:28,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:28,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:28,083 INFO L87 Difference]: Start difference. First operand 1779 states and 2409 transitions. Second operand 3 states. [2019-09-10 07:00:28,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:28,332 INFO L93 Difference]: Finished difference Result 2489 states and 3403 transitions. [2019-09-10 07:00:28,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:28,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 07:00:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:28,354 INFO L225 Difference]: With dead ends: 2489 [2019-09-10 07:00:28,354 INFO L226 Difference]: Without dead ends: 2489 [2019-09-10 07:00:28,356 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:00:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2019-09-10 07:00:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2481. [2019-09-10 07:00:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-09-10 07:00:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3399 transitions. [2019-09-10 07:00:28,453 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3399 transitions. Word has length 69 [2019-09-10 07:00:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:28,457 INFO L475 AbstractCegarLoop]: Abstraction has 2481 states and 3399 transitions. [2019-09-10 07:00:28,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3399 transitions. [2019-09-10 07:00:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:00:28,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:28,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:28,467 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:28,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:28,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2052603823, now seen corresponding path program 1 times [2019-09-10 07:00:28,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:28,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:28,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:28,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:28,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:28,753 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:00:28,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:28,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:00:28,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:28,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:00:28,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:00:28,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:28,756 INFO L87 Difference]: Start difference. First operand 2481 states and 3399 transitions. Second operand 6 states. [2019-09-10 07:00:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:29,827 INFO L93 Difference]: Finished difference Result 4425 states and 6205 transitions. [2019-09-10 07:00:29,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:00:29,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 07:00:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:29,853 INFO L225 Difference]: With dead ends: 4425 [2019-09-10 07:00:29,854 INFO L226 Difference]: Without dead ends: 4425 [2019-09-10 07:00:29,854 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:00:29,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4425 states. [2019-09-10 07:00:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4425 to 4409. [2019-09-10 07:00:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2019-09-10 07:00:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 6197 transitions. [2019-09-10 07:00:29,977 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 6197 transitions. Word has length 69 [2019-09-10 07:00:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:29,978 INFO L475 AbstractCegarLoop]: Abstraction has 4409 states and 6197 transitions. [2019-09-10 07:00:29,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:00:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 6197 transitions. [2019-09-10 07:00:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:00:29,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:29,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:29,992 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash 449186189, now seen corresponding path program 1 times [2019-09-10 07:00:29,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:29,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:29,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:29,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:30,174 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:00:30,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:30,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:00:30,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:30,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:00:30,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:00:30,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:30,177 INFO L87 Difference]: Start difference. First operand 4409 states and 6197 transitions. Second operand 6 states. [2019-09-10 07:00:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:30,959 INFO L93 Difference]: Finished difference Result 8348 states and 11813 transitions. [2019-09-10 07:00:30,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:00:30,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 07:00:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:31,001 INFO L225 Difference]: With dead ends: 8348 [2019-09-10 07:00:31,002 INFO L226 Difference]: Without dead ends: 8348 [2019-09-10 07:00:31,002 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:00:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8348 states. [2019-09-10 07:00:31,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8348 to 8296. [2019-09-10 07:00:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8296 states. [2019-09-10 07:00:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8296 states to 8296 states and 11769 transitions. [2019-09-10 07:00:31,238 INFO L78 Accepts]: Start accepts. Automaton has 8296 states and 11769 transitions. Word has length 70 [2019-09-10 07:00:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:31,240 INFO L475 AbstractCegarLoop]: Abstraction has 8296 states and 11769 transitions. [2019-09-10 07:00:31,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:00:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand 8296 states and 11769 transitions. [2019-09-10 07:00:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:00:31,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:31,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:31,253 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:31,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:31,260 INFO L82 PathProgramCache]: Analyzing trace with hash 178317883, now seen corresponding path program 1 times [2019-09-10 07:00:31,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:31,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:31,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:31,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:31,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:31,374 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:00:31,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:31,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:31,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:31,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:31,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:31,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:31,377 INFO L87 Difference]: Start difference. First operand 8296 states and 11769 transitions. Second operand 3 states. [2019-09-10 07:00:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:31,472 INFO L93 Difference]: Finished difference Result 12191 states and 17110 transitions. [2019-09-10 07:00:31,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:31,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 07:00:31,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:31,534 INFO L225 Difference]: With dead ends: 12191 [2019-09-10 07:00:31,534 INFO L226 Difference]: Without dead ends: 12191 [2019-09-10 07:00:31,534 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:00:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12191 states. [2019-09-10 07:00:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12191 to 12123. [2019-09-10 07:00:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12123 states. [2019-09-10 07:00:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12123 states to 12123 states and 17046 transitions. [2019-09-10 07:00:31,772 INFO L78 Accepts]: Start accepts. Automaton has 12123 states and 17046 transitions. Word has length 70 [2019-09-10 07:00:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:31,773 INFO L475 AbstractCegarLoop]: Abstraction has 12123 states and 17046 transitions. [2019-09-10 07:00:31,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 12123 states and 17046 transitions. [2019-09-10 07:00:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:00:31,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:31,782 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:31,783 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:31,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:31,783 INFO L82 PathProgramCache]: Analyzing trace with hash 769375619, now seen corresponding path program 1 times [2019-09-10 07:00:31,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:31,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:31,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:31,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:31,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:31,945 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:00:31,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:31,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:00:31,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:31,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:00:31,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:00:31,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:31,947 INFO L87 Difference]: Start difference. First operand 12123 states and 17046 transitions. Second operand 6 states. [2019-09-10 07:00:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:32,858 INFO L93 Difference]: Finished difference Result 25289 states and 35422 transitions. [2019-09-10 07:00:32,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:00:32,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-10 07:00:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:32,917 INFO L225 Difference]: With dead ends: 25289 [2019-09-10 07:00:32,917 INFO L226 Difference]: Without dead ends: 25289 [2019-09-10 07:00:32,918 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:00:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25289 states. [2019-09-10 07:00:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25289 to 25123. [2019-09-10 07:00:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25123 states. [2019-09-10 07:00:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25123 states to 25123 states and 35264 transitions. [2019-09-10 07:00:33,322 INFO L78 Accepts]: Start accepts. Automaton has 25123 states and 35264 transitions. Word has length 71 [2019-09-10 07:00:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:33,322 INFO L475 AbstractCegarLoop]: Abstraction has 25123 states and 35264 transitions. [2019-09-10 07:00:33,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:00:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 25123 states and 35264 transitions. [2019-09-10 07:00:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:00:33,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:33,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:33,339 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:33,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:33,339 INFO L82 PathProgramCache]: Analyzing trace with hash -94739691, now seen corresponding path program 1 times [2019-09-10 07:00:33,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:33,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:33,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:33,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:33,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:33,487 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:00:33,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:33,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:00:33,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:33,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:00:33,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:00:33,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:00:33,489 INFO L87 Difference]: Start difference. First operand 25123 states and 35264 transitions. Second operand 7 states. [2019-09-10 07:00:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:35,056 INFO L93 Difference]: Finished difference Result 82215 states and 115459 transitions. [2019-09-10 07:00:35,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:00:35,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-10 07:00:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:35,311 INFO L225 Difference]: With dead ends: 82215 [2019-09-10 07:00:35,311 INFO L226 Difference]: Without dead ends: 82215 [2019-09-10 07:00:35,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:00:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82215 states. [2019-09-10 07:00:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82215 to 25151. [2019-09-10 07:00:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25151 states. [2019-09-10 07:00:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25151 states to 25151 states and 35300 transitions. [2019-09-10 07:00:37,432 INFO L78 Accepts]: Start accepts. Automaton has 25151 states and 35300 transitions. Word has length 72 [2019-09-10 07:00:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:37,433 INFO L475 AbstractCegarLoop]: Abstraction has 25151 states and 35300 transitions. [2019-09-10 07:00:37,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:00:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 25151 states and 35300 transitions. [2019-09-10 07:00:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:00:37,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:37,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:37,446 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:37,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:37,446 INFO L82 PathProgramCache]: Analyzing trace with hash 446727203, now seen corresponding path program 1 times [2019-09-10 07:00:37,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:37,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:37,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:37,599 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:00:37,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:37,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:00:37,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:37,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:00:37,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:00:37,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:00:37,601 INFO L87 Difference]: Start difference. First operand 25151 states and 35300 transitions. Second operand 7 states. [2019-09-10 07:00:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:39,197 INFO L93 Difference]: Finished difference Result 93504 states and 131583 transitions. [2019-09-10 07:00:39,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:00:39,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-10 07:00:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:39,687 INFO L225 Difference]: With dead ends: 93504 [2019-09-10 07:00:39,688 INFO L226 Difference]: Without dead ends: 93504 [2019-09-10 07:00:39,688 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:00:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93504 states. [2019-09-10 07:00:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93504 to 25239. [2019-09-10 07:00:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25239 states. [2019-09-10 07:00:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25239 states to 25239 states and 35421 transitions. [2019-09-10 07:00:40,390 INFO L78 Accepts]: Start accepts. Automaton has 25239 states and 35421 transitions. Word has length 72 [2019-09-10 07:00:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:40,390 INFO L475 AbstractCegarLoop]: Abstraction has 25239 states and 35421 transitions. [2019-09-10 07:00:40,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:00:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 25239 states and 35421 transitions. [2019-09-10 07:00:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:00:40,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:40,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] [2019-09-10 07:00:40,402 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash -228168160, now seen corresponding path program 1 times [2019-09-10 07:00:40,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:40,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:40,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:40,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:40,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:40,541 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:00:40,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:40,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:00:40,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:40,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:00:40,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:00:40,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:00:40,543 INFO L87 Difference]: Start difference. First operand 25239 states and 35421 transitions. Second operand 7 states. [2019-09-10 07:00:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:42,686 INFO L93 Difference]: Finished difference Result 135580 states and 192545 transitions. [2019-09-10 07:00:42,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:00:42,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-10 07:00:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:42,913 INFO L225 Difference]: With dead ends: 135580 [2019-09-10 07:00:42,913 INFO L226 Difference]: Without dead ends: 135580 [2019-09-10 07:00:42,914 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:00:43,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135580 states. [2019-09-10 07:00:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135580 to 25307. [2019-09-10 07:00:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25307 states. [2019-09-10 07:00:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25307 states to 25307 states and 35509 transitions. [2019-09-10 07:00:44,181 INFO L78 Accepts]: Start accepts. Automaton has 25307 states and 35509 transitions. Word has length 72 [2019-09-10 07:00:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:44,181 INFO L475 AbstractCegarLoop]: Abstraction has 25307 states and 35509 transitions. [2019-09-10 07:00:44,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:00:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 25307 states and 35509 transitions. [2019-09-10 07:00:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:00:44,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:44,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] [2019-09-10 07:00:44,194 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:44,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:44,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1184969247, now seen corresponding path program 1 times [2019-09-10 07:00:44,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:44,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:44,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:44,401 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:00:44,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:44,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:00:44,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:44,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:00:44,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:00:44,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:00:44,403 INFO L87 Difference]: Start difference. First operand 25307 states and 35509 transitions. Second operand 7 states. [2019-09-10 07:00:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:45,995 INFO L93 Difference]: Finished difference Result 108464 states and 153389 transitions. [2019-09-10 07:00:45,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:00:45,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-10 07:00:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:46,155 INFO L225 Difference]: With dead ends: 108464 [2019-09-10 07:00:46,156 INFO L226 Difference]: Without dead ends: 108464 [2019-09-10 07:00:46,156 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:00:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108464 states. [2019-09-10 07:00:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108464 to 25436. [2019-09-10 07:00:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25436 states. [2019-09-10 07:00:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25436 states to 25436 states and 35680 transitions. [2019-09-10 07:00:47,366 INFO L78 Accepts]: Start accepts. Automaton has 25436 states and 35680 transitions. Word has length 72 [2019-09-10 07:00:47,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:47,366 INFO L475 AbstractCegarLoop]: Abstraction has 25436 states and 35680 transitions. [2019-09-10 07:00:47,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:00:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 25436 states and 35680 transitions. [2019-09-10 07:00:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:00:47,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:47,376 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:47,376 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:47,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash 961373533, now seen corresponding path program 1 times [2019-09-10 07:00:47,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:47,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:47,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:47,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:47,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:47,603 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:00:47,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:47,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:00:47,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:47,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:00:47,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:00:47,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:47,605 INFO L87 Difference]: Start difference. First operand 25436 states and 35680 transitions. Second operand 9 states. [2019-09-10 07:00:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:50,085 INFO L93 Difference]: Finished difference Result 105756 states and 150976 transitions. [2019-09-10 07:00:50,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:00:50,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 07:00:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:50,211 INFO L225 Difference]: With dead ends: 105756 [2019-09-10 07:00:50,211 INFO L226 Difference]: Without dead ends: 105756 [2019-09-10 07:00:50,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:00:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105756 states. [2019-09-10 07:00:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105756 to 25408. [2019-09-10 07:00:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25408 states. [2019-09-10 07:00:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25408 states to 25408 states and 35636 transitions. [2019-09-10 07:00:52,039 INFO L78 Accepts]: Start accepts. Automaton has 25408 states and 35636 transitions. Word has length 73 [2019-09-10 07:00:52,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:52,039 INFO L475 AbstractCegarLoop]: Abstraction has 25408 states and 35636 transitions. [2019-09-10 07:00:52,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:00:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 25408 states and 35636 transitions. [2019-09-10 07:00:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:00:52,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:52,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:52,049 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:52,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:52,050 INFO L82 PathProgramCache]: Analyzing trace with hash 6553349, now seen corresponding path program 1 times [2019-09-10 07:00:52,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:52,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:52,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:52,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:52,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:52,178 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:00:52,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:52,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:00:52,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:52,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:00:52,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:00:52,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:00:52,180 INFO L87 Difference]: Start difference. First operand 25408 states and 35636 transitions. Second operand 7 states. [2019-09-10 07:00:53,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:53,790 INFO L93 Difference]: Finished difference Result 93697 states and 131840 transitions. [2019-09-10 07:00:53,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:00:53,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-10 07:00:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:53,894 INFO L225 Difference]: With dead ends: 93697 [2019-09-10 07:00:53,894 INFO L226 Difference]: Without dead ends: 93697 [2019-09-10 07:00:53,895 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:00:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93697 states. [2019-09-10 07:00:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93697 to 25477. [2019-09-10 07:00:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25477 states. [2019-09-10 07:00:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25477 states to 25477 states and 35733 transitions. [2019-09-10 07:00:54,803 INFO L78 Accepts]: Start accepts. Automaton has 25477 states and 35733 transitions. Word has length 73 [2019-09-10 07:00:54,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:54,803 INFO L475 AbstractCegarLoop]: Abstraction has 25477 states and 35733 transitions. [2019-09-10 07:00:54,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:00:54,803 INFO L276 IsEmpty]: Start isEmpty. Operand 25477 states and 35733 transitions. [2019-09-10 07:00:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:00:54,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:54,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] [2019-09-10 07:00:54,810 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:54,811 INFO L82 PathProgramCache]: Analyzing trace with hash -88849401, now seen corresponding path program 1 times [2019-09-10 07:00:54,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:54,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:54,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:54,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:54,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:55,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:55,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:00:55,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:55,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:00:55,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:00:55,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:55,022 INFO L87 Difference]: Start difference. First operand 25477 states and 35733 transitions. Second operand 9 states. [2019-09-10 07:00:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:57,949 INFO L93 Difference]: Finished difference Result 105773 states and 150985 transitions. [2019-09-10 07:00:57,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:00:57,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 07:00:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:58,090 INFO L225 Difference]: With dead ends: 105773 [2019-09-10 07:00:58,091 INFO L226 Difference]: Without dead ends: 105773 [2019-09-10 07:00:58,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:00:58,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105773 states. [2019-09-10 07:00:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105773 to 25468. [2019-09-10 07:00:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25468 states. [2019-09-10 07:00:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25468 states to 25468 states and 35715 transitions. [2019-09-10 07:00:59,148 INFO L78 Accepts]: Start accepts. Automaton has 25468 states and 35715 transitions. Word has length 73 [2019-09-10 07:00:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:59,149 INFO L475 AbstractCegarLoop]: Abstraction has 25468 states and 35715 transitions. [2019-09-10 07:00:59,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:00:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 25468 states and 35715 transitions. [2019-09-10 07:00:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:00:59,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:59,156 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:59,157 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:59,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:59,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1080005182, now seen corresponding path program 1 times [2019-09-10 07:00:59,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:59,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:59,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:59,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:59,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:59,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:59,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:00:59,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:59,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:00:59,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:00:59,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:59,344 INFO L87 Difference]: Start difference. First operand 25468 states and 35715 transitions. Second operand 9 states. [2019-09-10 07:01:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:01,835 INFO L93 Difference]: Finished difference Result 104506 states and 148041 transitions. [2019-09-10 07:01:01,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:01:01,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 07:01:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:01,972 INFO L225 Difference]: With dead ends: 104506 [2019-09-10 07:01:01,972 INFO L226 Difference]: Without dead ends: 104506 [2019-09-10 07:01:01,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:01:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104506 states. [2019-09-10 07:01:02,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104506 to 25282. [2019-09-10 07:01:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25282 states. [2019-09-10 07:01:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25282 states to 25282 states and 35468 transitions. [2019-09-10 07:01:03,150 INFO L78 Accepts]: Start accepts. Automaton has 25282 states and 35468 transitions. Word has length 73 [2019-09-10 07:01:03,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:03,150 INFO L475 AbstractCegarLoop]: Abstraction has 25282 states and 35468 transitions. [2019-09-10 07:01:03,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:01:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 25282 states and 35468 transitions. [2019-09-10 07:01:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:01:03,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:03,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:03,159 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:03,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:03,159 INFO L82 PathProgramCache]: Analyzing trace with hash 8591348, now seen corresponding path program 1 times [2019-09-10 07:01:03,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:03,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:03,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:03,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:03,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:03,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:03,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:01:03,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:03,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:01:03,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:01:03,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:01:03,399 INFO L87 Difference]: Start difference. First operand 25282 states and 35468 transitions. Second operand 8 states. [2019-09-10 07:01:05,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:05,079 INFO L93 Difference]: Finished difference Result 50272 states and 70981 transitions. [2019-09-10 07:01:05,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:01:05,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-09-10 07:01:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:05,149 INFO L225 Difference]: With dead ends: 50272 [2019-09-10 07:01:05,149 INFO L226 Difference]: Without dead ends: 50272 [2019-09-10 07:01:05,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:01:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50272 states. [2019-09-10 07:01:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50272 to 24690. [2019-09-10 07:01:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24690 states. [2019-09-10 07:01:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24690 states to 24690 states and 34696 transitions. [2019-09-10 07:01:05,539 INFO L78 Accepts]: Start accepts. Automaton has 24690 states and 34696 transitions. Word has length 73 [2019-09-10 07:01:05,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:05,540 INFO L475 AbstractCegarLoop]: Abstraction has 24690 states and 34696 transitions. [2019-09-10 07:01:05,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:01:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 24690 states and 34696 transitions. [2019-09-10 07:01:05,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:01:05,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:05,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:05,546 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:05,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:05,547 INFO L82 PathProgramCache]: Analyzing trace with hash 591574109, now seen corresponding path program 1 times [2019-09-10 07:01:05,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:05,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:05,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:05,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:05,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:05,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:05,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:01:05,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:05,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:01:05,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:01:05,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:01:05,999 INFO L87 Difference]: Start difference. First operand 24690 states and 34696 transitions. Second operand 11 states. [2019-09-10 07:01:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:08,647 INFO L93 Difference]: Finished difference Result 128506 states and 182594 transitions. [2019-09-10 07:01:08,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:01:08,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-09-10 07:01:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:08,857 INFO L225 Difference]: With dead ends: 128506 [2019-09-10 07:01:08,857 INFO L226 Difference]: Without dead ends: 128506 [2019-09-10 07:01:08,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:01:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128506 states. [2019-09-10 07:01:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128506 to 24223. [2019-09-10 07:01:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24223 states. [2019-09-10 07:01:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24223 states to 24223 states and 34058 transitions. [2019-09-10 07:01:10,006 INFO L78 Accepts]: Start accepts. Automaton has 24223 states and 34058 transitions. Word has length 74 [2019-09-10 07:01:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:10,006 INFO L475 AbstractCegarLoop]: Abstraction has 24223 states and 34058 transitions. [2019-09-10 07:01:10,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:01:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 24223 states and 34058 transitions. [2019-09-10 07:01:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:01:10,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:10,013 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:10,013 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash 199562019, now seen corresponding path program 1 times [2019-09-10 07:01:10,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:10,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:10,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:10,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:10,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:10,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:01:10,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:10,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:01:10,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:01:10,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:01:10,586 INFO L87 Difference]: Start difference. First operand 24223 states and 34058 transitions. Second operand 12 states. [2019-09-10 07:01:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:13,466 INFO L93 Difference]: Finished difference Result 140303 states and 200095 transitions. [2019-09-10 07:01:13,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:01:13,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-10 07:01:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:13,619 INFO L225 Difference]: With dead ends: 140303 [2019-09-10 07:01:13,619 INFO L226 Difference]: Without dead ends: 140303 [2019-09-10 07:01:13,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:01:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140303 states. [2019-09-10 07:01:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140303 to 24169. [2019-09-10 07:01:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24169 states. [2019-09-10 07:01:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24169 states to 24169 states and 33981 transitions. [2019-09-10 07:01:14,385 INFO L78 Accepts]: Start accepts. Automaton has 24169 states and 33981 transitions. Word has length 74 [2019-09-10 07:01:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:14,385 INFO L475 AbstractCegarLoop]: Abstraction has 24169 states and 33981 transitions. [2019-09-10 07:01:14,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:01:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 24169 states and 33981 transitions. [2019-09-10 07:01:14,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:01:14,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:14,389 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:14,389 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash 662330837, now seen corresponding path program 1 times [2019-09-10 07:01:14,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:14,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:14,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:14,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:14,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:15,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:15,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:01:15,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:15,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:01:15,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:01:15,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:01:15,073 INFO L87 Difference]: Start difference. First operand 24169 states and 33981 transitions. Second operand 12 states. [2019-09-10 07:01:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:18,027 INFO L93 Difference]: Finished difference Result 140725 states and 200556 transitions. [2019-09-10 07:01:18,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:01:18,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-10 07:01:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:18,196 INFO L225 Difference]: With dead ends: 140725 [2019-09-10 07:01:18,197 INFO L226 Difference]: Without dead ends: 140725 [2019-09-10 07:01:18,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:01:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140725 states. [2019-09-10 07:01:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140725 to 23889. [2019-09-10 07:01:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23889 states. [2019-09-10 07:01:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23889 states to 23889 states and 33630 transitions. [2019-09-10 07:01:18,972 INFO L78 Accepts]: Start accepts. Automaton has 23889 states and 33630 transitions. Word has length 74 [2019-09-10 07:01:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:18,973 INFO L475 AbstractCegarLoop]: Abstraction has 23889 states and 33630 transitions. [2019-09-10 07:01:18,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:01:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 23889 states and 33630 transitions. [2019-09-10 07:01:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:01:18,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:18,978 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:18,978 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:18,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1361298504, now seen corresponding path program 1 times [2019-09-10 07:01:18,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:18,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:18,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:19,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:19,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:19,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:19,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:19,069 INFO L87 Difference]: Start difference. First operand 23889 states and 33630 transitions. Second operand 3 states. [2019-09-10 07:01:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:19,153 INFO L93 Difference]: Finished difference Result 23893 states and 33366 transitions. [2019-09-10 07:01:19,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:19,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 07:01:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:19,182 INFO L225 Difference]: With dead ends: 23893 [2019-09-10 07:01:19,183 INFO L226 Difference]: Without dead ends: 23893 [2019-09-10 07:01:19,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23893 states. [2019-09-10 07:01:19,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23893 to 23889. [2019-09-10 07:01:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23889 states. [2019-09-10 07:01:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23889 states to 23889 states and 33364 transitions. [2019-09-10 07:01:19,474 INFO L78 Accepts]: Start accepts. Automaton has 23889 states and 33364 transitions. Word has length 75 [2019-09-10 07:01:19,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:19,475 INFO L475 AbstractCegarLoop]: Abstraction has 23889 states and 33364 transitions. [2019-09-10 07:01:19,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 23889 states and 33364 transitions. [2019-09-10 07:01:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:01:19,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:19,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:19,481 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash 42269280, now seen corresponding path program 1 times [2019-09-10 07:01:19,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:19,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:19,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:19,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:19,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:19,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:19,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:19,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:19,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:19,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:19,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:19,578 INFO L87 Difference]: Start difference. First operand 23889 states and 33364 transitions. Second operand 3 states. [2019-09-10 07:01:19,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:19,793 INFO L93 Difference]: Finished difference Result 35475 states and 49876 transitions. [2019-09-10 07:01:19,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:19,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 07:01:19,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:19,829 INFO L225 Difference]: With dead ends: 35475 [2019-09-10 07:01:19,830 INFO L226 Difference]: Without dead ends: 35475 [2019-09-10 07:01:19,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35475 states. [2019-09-10 07:01:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35475 to 27733. [2019-09-10 07:01:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27733 states. [2019-09-10 07:01:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27733 states to 27733 states and 38960 transitions. [2019-09-10 07:01:20,202 INFO L78 Accepts]: Start accepts. Automaton has 27733 states and 38960 transitions. Word has length 76 [2019-09-10 07:01:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:20,202 INFO L475 AbstractCegarLoop]: Abstraction has 27733 states and 38960 transitions. [2019-09-10 07:01:20,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 27733 states and 38960 transitions. [2019-09-10 07:01:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:01:20,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:20,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:20,207 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2110038432, now seen corresponding path program 1 times [2019-09-10 07:01:20,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:20,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:20,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:20,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:20,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:20,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:20,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:20,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:20,293 INFO L87 Difference]: Start difference. First operand 27733 states and 38960 transitions. Second operand 3 states. [2019-09-10 07:01:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:20,446 INFO L93 Difference]: Finished difference Result 35751 states and 50300 transitions. [2019-09-10 07:01:20,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:20,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 07:01:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:20,499 INFO L225 Difference]: With dead ends: 35751 [2019-09-10 07:01:20,500 INFO L226 Difference]: Without dead ends: 35751 [2019-09-10 07:01:20,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35751 states. [2019-09-10 07:01:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35751 to 26503. [2019-09-10 07:01:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26503 states. [2019-09-10 07:01:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26503 states to 26503 states and 37301 transitions. [2019-09-10 07:01:20,999 INFO L78 Accepts]: Start accepts. Automaton has 26503 states and 37301 transitions. Word has length 76 [2019-09-10 07:01:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:21,000 INFO L475 AbstractCegarLoop]: Abstraction has 26503 states and 37301 transitions. [2019-09-10 07:01:21,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 26503 states and 37301 transitions. [2019-09-10 07:01:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:01:21,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:21,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:21,008 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:21,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:21,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1012060291, now seen corresponding path program 1 times [2019-09-10 07:01:21,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:21,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:21,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:21,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:21,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:21,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:21,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:01:21,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:21,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:01:21,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:01:21,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:21,333 INFO L87 Difference]: Start difference. First operand 26503 states and 37301 transitions. Second operand 9 states. [2019-09-10 07:01:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:23,359 INFO L93 Difference]: Finished difference Result 82284 states and 116605 transitions. [2019-09-10 07:01:23,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:01:23,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-10 07:01:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:23,479 INFO L225 Difference]: With dead ends: 82284 [2019-09-10 07:01:23,480 INFO L226 Difference]: Without dead ends: 82284 [2019-09-10 07:01:23,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:01:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82284 states. [2019-09-10 07:01:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82284 to 26467. [2019-09-10 07:01:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26467 states. [2019-09-10 07:01:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26467 states to 26467 states and 37252 transitions. [2019-09-10 07:01:24,010 INFO L78 Accepts]: Start accepts. Automaton has 26467 states and 37252 transitions. Word has length 77 [2019-09-10 07:01:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:24,010 INFO L475 AbstractCegarLoop]: Abstraction has 26467 states and 37252 transitions. [2019-09-10 07:01:24,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:01:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 26467 states and 37252 transitions. [2019-09-10 07:01:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:01:24,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:24,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:24,014 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:24,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:24,015 INFO L82 PathProgramCache]: Analyzing trace with hash 386283916, now seen corresponding path program 1 times [2019-09-10 07:01:24,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:24,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:24,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:24,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:24,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:24,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:24,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:24,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:24,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:24,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:24,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:24,115 INFO L87 Difference]: Start difference. First operand 26467 states and 37252 transitions. Second operand 3 states. [2019-09-10 07:01:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:24,225 INFO L93 Difference]: Finished difference Result 26471 states and 36865 transitions. [2019-09-10 07:01:24,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:24,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 07:01:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:24,263 INFO L225 Difference]: With dead ends: 26471 [2019-09-10 07:01:24,263 INFO L226 Difference]: Without dead ends: 26471 [2019-09-10 07:01:24,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26471 states. [2019-09-10 07:01:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26471 to 26467. [2019-09-10 07:01:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26467 states. [2019-09-10 07:01:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26467 states to 26467 states and 36863 transitions. [2019-09-10 07:01:24,562 INFO L78 Accepts]: Start accepts. Automaton has 26467 states and 36863 transitions. Word has length 78 [2019-09-10 07:01:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:24,562 INFO L475 AbstractCegarLoop]: Abstraction has 26467 states and 36863 transitions. [2019-09-10 07:01:24,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 26467 states and 36863 transitions. [2019-09-10 07:01:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:01:24,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:24,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:24,569 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:24,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:24,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1282642039, now seen corresponding path program 1 times [2019-09-10 07:01:24,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:24,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:24,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:24,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:24,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:24,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:24,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:24,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:24,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:24,646 INFO L87 Difference]: Start difference. First operand 26467 states and 36863 transitions. Second operand 3 states. [2019-09-10 07:01:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:24,843 INFO L93 Difference]: Finished difference Result 40568 states and 56655 transitions. [2019-09-10 07:01:24,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:24,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:01:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:24,899 INFO L225 Difference]: With dead ends: 40568 [2019-09-10 07:01:24,899 INFO L226 Difference]: Without dead ends: 40568 [2019-09-10 07:01:24,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40568 states. [2019-09-10 07:01:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40568 to 26353. [2019-09-10 07:01:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26353 states. [2019-09-10 07:01:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26353 states to 26353 states and 36637 transitions. [2019-09-10 07:01:25,424 INFO L78 Accepts]: Start accepts. Automaton has 26353 states and 36637 transitions. Word has length 80 [2019-09-10 07:01:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:25,424 INFO L475 AbstractCegarLoop]: Abstraction has 26353 states and 36637 transitions. [2019-09-10 07:01:25,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 26353 states and 36637 transitions. [2019-09-10 07:01:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:01:25,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:25,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:25,430 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:25,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1433154749, now seen corresponding path program 1 times [2019-09-10 07:01:25,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:25,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:25,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:25,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:25,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:26,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:26,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:01:26,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:26,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:01:26,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:01:26,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:01:26,273 INFO L87 Difference]: Start difference. First operand 26353 states and 36637 transitions. Second operand 17 states. [2019-09-10 07:01:26,973 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 07:01:27,237 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 07:01:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:28,755 INFO L93 Difference]: Finished difference Result 43733 states and 60942 transitions. [2019-09-10 07:01:28,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:01:28,756 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2019-09-10 07:01:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:28,797 INFO L225 Difference]: With dead ends: 43733 [2019-09-10 07:01:28,797 INFO L226 Difference]: Without dead ends: 43733 [2019-09-10 07:01:28,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:01:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43733 states. [2019-09-10 07:01:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43733 to 26321. [2019-09-10 07:01:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26321 states. [2019-09-10 07:01:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26321 states to 26321 states and 36597 transitions. [2019-09-10 07:01:29,059 INFO L78 Accepts]: Start accepts. Automaton has 26321 states and 36597 transitions. Word has length 80 [2019-09-10 07:01:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:29,059 INFO L475 AbstractCegarLoop]: Abstraction has 26321 states and 36597 transitions. [2019-09-10 07:01:29,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:01:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 26321 states and 36597 transitions. [2019-09-10 07:01:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:01:29,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:29,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:29,064 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:29,065 INFO L82 PathProgramCache]: Analyzing trace with hash 81860216, now seen corresponding path program 1 times [2019-09-10 07:01:29,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:29,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:29,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:29,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:29,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:30,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:01:30,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:30,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:01:30,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:30,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:01:30,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:01:30,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:01:30,159 INFO L87 Difference]: Start difference. First operand 26321 states and 36597 transitions. Second operand 16 states. [2019-09-10 07:01:30,887 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 07:01:31,126 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 07:01:31,404 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 07:01:31,635 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:01:31,847 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:01:33,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:33,814 INFO L93 Difference]: Finished difference Result 79402 states and 111440 transitions. [2019-09-10 07:01:33,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:01:33,814 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2019-09-10 07:01:33,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:33,895 INFO L225 Difference]: With dead ends: 79402 [2019-09-10 07:01:33,895 INFO L226 Difference]: Without dead ends: 79402 [2019-09-10 07:01:33,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:01:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79402 states. [2019-09-10 07:01:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79402 to 26317. [2019-09-10 07:01:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26317 states. [2019-09-10 07:01:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26317 states to 26317 states and 36592 transitions. [2019-09-10 07:01:34,565 INFO L78 Accepts]: Start accepts. Automaton has 26317 states and 36592 transitions. Word has length 81 [2019-09-10 07:01:34,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:34,565 INFO L475 AbstractCegarLoop]: Abstraction has 26317 states and 36592 transitions. [2019-09-10 07:01:34,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:01:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 26317 states and 36592 transitions. [2019-09-10 07:01:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:01:34,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:34,580 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] [2019-09-10 07:01:34,580 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:34,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:34,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2040450539, now seen corresponding path program 1 times [2019-09-10 07:01:34,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:34,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:34,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:34,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:34,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:34,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:34,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:01:34,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:34,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:01:34,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:01:34,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:01:34,703 INFO L87 Difference]: Start difference. First operand 26317 states and 36592 transitions. Second operand 7 states. [2019-09-10 07:01:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:35,315 INFO L93 Difference]: Finished difference Result 178614 states and 246464 transitions. [2019-09-10 07:01:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:01:35,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:01:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:35,545 INFO L225 Difference]: With dead ends: 178614 [2019-09-10 07:01:35,545 INFO L226 Difference]: Without dead ends: 178614 [2019-09-10 07:01:35,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:01:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178614 states. [2019-09-10 07:01:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178614 to 99577. [2019-09-10 07:01:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99577 states. [2019-09-10 07:01:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99577 states to 99577 states and 137677 transitions. [2019-09-10 07:01:36,846 INFO L78 Accepts]: Start accepts. Automaton has 99577 states and 137677 transitions. Word has length 90 [2019-09-10 07:01:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:36,846 INFO L475 AbstractCegarLoop]: Abstraction has 99577 states and 137677 transitions. [2019-09-10 07:01:36,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:01:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 99577 states and 137677 transitions. [2019-09-10 07:01:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:01:36,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:36,872 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] [2019-09-10 07:01:36,873 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:36,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:36,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1916809887, now seen corresponding path program 1 times [2019-09-10 07:01:36,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:36,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:36,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:36,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:36,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:37,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:37,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:37,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:37,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:37,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:37,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:37,014 INFO L87 Difference]: Start difference. First operand 99577 states and 137677 transitions. Second operand 6 states. [2019-09-10 07:01:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:37,532 INFO L93 Difference]: Finished difference Result 113805 states and 154120 transitions. [2019-09-10 07:01:37,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:01:37,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-10 07:01:37,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:37,771 INFO L225 Difference]: With dead ends: 113805 [2019-09-10 07:01:37,771 INFO L226 Difference]: Without dead ends: 113478 [2019-09-10 07:01:37,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113478 states. [2019-09-10 07:01:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113478 to 85016. [2019-09-10 07:01:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85016 states. [2019-09-10 07:01:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85016 states to 85016 states and 115362 transitions. [2019-09-10 07:01:40,648 INFO L78 Accepts]: Start accepts. Automaton has 85016 states and 115362 transitions. Word has length 91 [2019-09-10 07:01:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:40,648 INFO L475 AbstractCegarLoop]: Abstraction has 85016 states and 115362 transitions. [2019-09-10 07:01:40,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 85016 states and 115362 transitions. [2019-09-10 07:01:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:01:40,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:40,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:40,670 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:40,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:40,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1828567747, now seen corresponding path program 1 times [2019-09-10 07:01:40,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:40,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:40,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:40,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:40,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:40,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:40,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:40,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:40,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:40,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:40,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:40,801 INFO L87 Difference]: Start difference. First operand 85016 states and 115362 transitions. Second operand 6 states. [2019-09-10 07:01:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:41,270 INFO L93 Difference]: Finished difference Result 156104 states and 209180 transitions. [2019-09-10 07:01:41,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:01:41,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-09-10 07:01:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:41,482 INFO L225 Difference]: With dead ends: 156104 [2019-09-10 07:01:41,483 INFO L226 Difference]: Without dead ends: 156104 [2019-09-10 07:01:41,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:41,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156104 states. [2019-09-10 07:01:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156104 to 86753. [2019-09-10 07:01:42,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86753 states. [2019-09-10 07:01:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86753 states to 86753 states and 116520 transitions. [2019-09-10 07:01:42,762 INFO L78 Accepts]: Start accepts. Automaton has 86753 states and 116520 transitions. Word has length 92 [2019-09-10 07:01:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:42,763 INFO L475 AbstractCegarLoop]: Abstraction has 86753 states and 116520 transitions. [2019-09-10 07:01:42,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 86753 states and 116520 transitions. [2019-09-10 07:01:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:01:42,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:42,786 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] [2019-09-10 07:01:42,786 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:42,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:42,786 INFO L82 PathProgramCache]: Analyzing trace with hash -375474182, now seen corresponding path program 1 times [2019-09-10 07:01:42,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:42,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:42,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:42,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:42,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:42,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:42,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:42,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:42,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:42,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:42,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:42,876 INFO L87 Difference]: Start difference. First operand 86753 states and 116520 transitions. Second operand 3 states. [2019-09-10 07:01:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:43,279 INFO L93 Difference]: Finished difference Result 157536 states and 209661 transitions. [2019-09-10 07:01:43,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:43,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 07:01:43,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:43,460 INFO L225 Difference]: With dead ends: 157536 [2019-09-10 07:01:43,460 INFO L226 Difference]: Without dead ends: 157536 [2019-09-10 07:01:43,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157536 states. [2019-09-10 07:01:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157536 to 141349. [2019-09-10 07:01:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141349 states. [2019-09-10 07:01:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141349 states to 141349 states and 189362 transitions. [2019-09-10 07:01:46,942 INFO L78 Accepts]: Start accepts. Automaton has 141349 states and 189362 transitions. Word has length 93 [2019-09-10 07:01:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:46,943 INFO L475 AbstractCegarLoop]: Abstraction has 141349 states and 189362 transitions. [2019-09-10 07:01:46,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 141349 states and 189362 transitions. [2019-09-10 07:01:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:01:46,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:46,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:46,959 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:46,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1137111418, now seen corresponding path program 1 times [2019-09-10 07:01:46,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:46,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:46,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:46,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:46,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:47,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:47,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:47,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:47,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:47,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:47,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:47,053 INFO L87 Difference]: Start difference. First operand 141349 states and 189362 transitions. Second operand 3 states. [2019-09-10 07:01:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:47,637 INFO L93 Difference]: Finished difference Result 268969 states and 354805 transitions. [2019-09-10 07:01:47,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:47,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 07:01:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:48,006 INFO L225 Difference]: With dead ends: 268969 [2019-09-10 07:01:48,006 INFO L226 Difference]: Without dead ends: 268969 [2019-09-10 07:01:48,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:48,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268969 states. [2019-09-10 07:01:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268969 to 253550. [2019-09-10 07:01:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253550 states. [2019-09-10 07:01:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253550 states to 253550 states and 334203 transitions. [2019-09-10 07:01:53,645 INFO L78 Accepts]: Start accepts. Automaton has 253550 states and 334203 transitions. Word has length 94 [2019-09-10 07:01:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:53,645 INFO L475 AbstractCegarLoop]: Abstraction has 253550 states and 334203 transitions. [2019-09-10 07:01:53,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 253550 states and 334203 transitions. [2019-09-10 07:01:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:01:53,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:53,658 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] [2019-09-10 07:01:53,659 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:53,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:53,659 INFO L82 PathProgramCache]: Analyzing trace with hash -566766327, now seen corresponding path program 1 times [2019-09-10 07:01:53,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:53,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:53,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:53,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:53,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:53,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:53,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:53,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:53,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:53,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:53,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:53,748 INFO L87 Difference]: Start difference. First operand 253550 states and 334203 transitions. Second operand 3 states. [2019-09-10 07:01:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:55,036 INFO L93 Difference]: Finished difference Result 475173 states and 616794 transitions. [2019-09-10 07:01:55,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:55,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 07:01:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:55,722 INFO L225 Difference]: With dead ends: 475173 [2019-09-10 07:01:55,722 INFO L226 Difference]: Without dead ends: 467070 [2019-09-10 07:01:55,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467070 states. [2019-09-10 07:02:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467070 to 433780. [2019-09-10 07:02:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433780 states. [2019-09-10 07:02:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433780 states to 433780 states and 565696 transitions. [2019-09-10 07:02:05,572 INFO L78 Accepts]: Start accepts. Automaton has 433780 states and 565696 transitions. Word has length 95 [2019-09-10 07:02:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:05,572 INFO L475 AbstractCegarLoop]: Abstraction has 433780 states and 565696 transitions. [2019-09-10 07:02:05,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 433780 states and 565696 transitions. [2019-09-10 07:02:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:02:05,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:05,582 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] [2019-09-10 07:02:05,583 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:05,583 INFO L82 PathProgramCache]: Analyzing trace with hash -917299920, now seen corresponding path program 1 times [2019-09-10 07:02:05,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:05,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:05,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:05,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:05,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:06,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:07,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:07,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:07,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:07,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:07,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:07,001 INFO L87 Difference]: Start difference. First operand 433780 states and 565696 transitions. Second operand 3 states. [2019-09-10 07:02:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:08,869 INFO L93 Difference]: Finished difference Result 830987 states and 1066634 transitions. [2019-09-10 07:02:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:08,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 07:02:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:18,897 INFO L225 Difference]: With dead ends: 830987 [2019-09-10 07:02:18,897 INFO L226 Difference]: Without dead ends: 830987 [2019-09-10 07:02:18,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830987 states. [2019-09-10 07:02:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830987 to 776236. [2019-09-10 07:02:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776236 states. [2019-09-10 07:02:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776236 states to 776236 states and 998503 transitions. [2019-09-10 07:02:28,241 INFO L78 Accepts]: Start accepts. Automaton has 776236 states and 998503 transitions. Word has length 96 [2019-09-10 07:02:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:28,241 INFO L475 AbstractCegarLoop]: Abstraction has 776236 states and 998503 transitions. [2019-09-10 07:02:28,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 776236 states and 998503 transitions. [2019-09-10 07:02:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:02:28,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:28,251 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] [2019-09-10 07:02:28,251 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:28,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:28,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1449742106, now seen corresponding path program 1 times [2019-09-10 07:02:28,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:28,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:28,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:28,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:28,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:36,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:36,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:36,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:36,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:36,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:36,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:36,740 INFO L87 Difference]: Start difference. First operand 776236 states and 998503 transitions. Second operand 3 states. [2019-09-10 07:02:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:40,077 INFO L93 Difference]: Finished difference Result 1184911 states and 1503906 transitions. [2019-09-10 07:02:40,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:40,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:02:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:41,730 INFO L225 Difference]: With dead ends: 1184911 [2019-09-10 07:02:41,730 INFO L226 Difference]: Without dead ends: 1184482 [2019-09-10 07:02:41,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184482 states. [2019-09-10 07:03:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184482 to 1181129. [2019-09-10 07:03:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181129 states. [2019-09-10 07:03:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181129 states to 1181129 states and 1498776 transitions. [2019-09-10 07:03:29,768 INFO L78 Accepts]: Start accepts. Automaton has 1181129 states and 1498776 transitions. Word has length 99 [2019-09-10 07:03:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:29,768 INFO L475 AbstractCegarLoop]: Abstraction has 1181129 states and 1498776 transitions. [2019-09-10 07:03:29,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1181129 states and 1498776 transitions. [2019-09-10 07:03:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 07:03:29,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:29,844 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:29,844 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:29,845 INFO L82 PathProgramCache]: Analyzing trace with hash 144771352, now seen corresponding path program 1 times [2019-09-10 07:03:29,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:29,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:29,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:29,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:29,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:03:30,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:03:30,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:03:30,044 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 07:03:30,047 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [82], [85], [88], [91], [93], [97], [146], [149], [152], [165], [168], [181], [184], [197], [200], [213], [216], [219], [223], [225], [228], [231], [242], [244], [247], [258], [260], [263], [274], [276], [279], [290], [292], [294], [297], [300], [302], [304], [307], [308], [310], [312], [314], [316], [321], [334], [336], [349], [357], [376], [387], [389], [402], [410], [429], [440], [442], [455], [463], [482], [493], [495], [498], [501], [504], [506], [508], [561], [623], [768], [1069], [1764], [1778], [1782], [1960], [2058], [2062], [2100], [2128], [2131], [2134], [2138], [2142], [4436], [4437], [4441], [4442], [4443] [2019-09-10 07:03:30,116 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:03:30,117 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:03:30,470 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:03:31,579 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:03:31,583 INFO L272 AbstractInterpreter]: Visited 115 different actions 698 times. Merged at 48 different actions 514 times. Widened at 19 different actions 99 times. Performed 2722 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2722 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 72 fixpoints after 15 different actions. Largest state had 469 variables. [2019-09-10 07:03:31,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:31,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:03:31,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:03:31,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:03:31,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:31,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:03:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:32,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 2501 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:03:32,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:03:32,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:32,597 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:03:34,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:34,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:03:34,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 21 [2019-09-10 07:03:34,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:03:34,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:03:34,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:03:34,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:03:34,820 INFO L87 Difference]: Start difference. First operand 1181129 states and 1498776 transitions. Second operand 13 states. [2019-09-10 07:04:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:20,673 INFO L93 Difference]: Finished difference Result 4841951 states and 6085991 transitions. [2019-09-10 07:04:20,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 07:04:20,674 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 125 [2019-09-10 07:04:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:49,519 INFO L225 Difference]: With dead ends: 4841951 [2019-09-10 07:04:49,519 INFO L226 Difference]: Without dead ends: 4832264 [2019-09-10 07:04:49,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1389, Invalid=4463, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 07:04:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832264 states.