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.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:55:22,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:55:22,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:55:22,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:55:22,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:55:22,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:55:22,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:55:22,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:55:22,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:55:22,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:55:22,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:55:22,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:55:22,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:55:22,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:55:22,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:55:22,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:55:22,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:55:22,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:55:22,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:55:22,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:55:22,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:55:22,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:55:22,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:55:22,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:55:22,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:55:22,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:55:22,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:55:22,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:55:22,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:55:22,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:55:22,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:55:22,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:55:22,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:55:22,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:55:22,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:55:22,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:55:22,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:55:22,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:55:22,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:55:22,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:55:22,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:55:22,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:55:22,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:55:22,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:55:22,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:55:22,974 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:55:22,975 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:55:22,975 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:55:22,975 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:55:22,975 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:55:22,976 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:55:22,976 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:55:22,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:55:22,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:55:22,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:55:22,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:55:22,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:55:22,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:55:22,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:55:22,980 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:55:22,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:55:22,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:55:22,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:55:22,981 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:55:22,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:55:22,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:55:22,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:55:22,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:55:22,982 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:55:22,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:55:22,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:55:22,982 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:55:23,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:55:23,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:55:23,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:55:23,053 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:55:23,054 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:55:23,054 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.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:55:23,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf077291/ebc8be1b6fc0448790624d092401966f/FLAG55fd79742 [2019-09-10 06:55:23,767 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:55:23,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:55:23,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf077291/ebc8be1b6fc0448790624d092401966f/FLAG55fd79742 [2019-09-10 06:55:23,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf077291/ebc8be1b6fc0448790624d092401966f [2019-09-10 06:55:23,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:55:23,949 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:55:23,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:55:23,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:55:23,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:55:23,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:55:23" (1/1) ... [2019-09-10 06:55:23,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c75d207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:55:23, skipping insertion in model container [2019-09-10 06:55:23,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:55:23" (1/1) ... [2019-09-10 06:55:23,965 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:55:24,070 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:55:24,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:55:24,961 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:55:25,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:55:25,261 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:55:25,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:55:25 WrapperNode [2019-09-10 06:55:25,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:55:25,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:55:25,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:55:25,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:55:25,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:55:25" (1/1) ... [2019-09-10 06:55:25,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:55:25" (1/1) ... [2019-09-10 06:55:25,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:55:25" (1/1) ... [2019-09-10 06:55:25,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:55:25" (1/1) ... [2019-09-10 06:55:25,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:55:25" (1/1) ... [2019-09-10 06:55:25,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:55:25" (1/1) ... [2019-09-10 06:55:25,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:55:25" (1/1) ... [2019-09-10 06:55:25,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:55:25,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:55:25,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:55:25,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:55:25,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:55:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:55:25,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:55:25,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:55:25,519 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:55:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:55:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:55:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:55:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:55:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:55:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:55:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:55:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:55:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:55:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:55:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:55:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:55:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:55:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:55:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:55:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:55:28,338 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:55:28,338 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:55:28,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:55:28 BoogieIcfgContainer [2019-09-10 06:55:28,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:55:28,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:55:28,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:55:28,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:55:28,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:55:23" (1/3) ... [2019-09-10 06:55:28,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194c4bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:55:28, skipping insertion in model container [2019-09-10 06:55:28,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:55:25" (2/3) ... [2019-09-10 06:55:28,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194c4bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:55:28, skipping insertion in model container [2019-09-10 06:55:28,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:55:28" (3/3) ... [2019-09-10 06:55:28,348 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:55:28,357 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:55:28,367 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 06:55:28,383 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 06:55:28,410 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:55:28,410 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:55:28,410 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:55:28,411 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:55:28,411 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:55:28,411 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:55:28,411 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:55:28,411 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:55:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states. [2019-09-10 06:55:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:55:28,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:28,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:28,466 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:28,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:28,472 INFO L82 PathProgramCache]: Analyzing trace with hash -550378324, now seen corresponding path program 1 times [2019-09-10 06:55:28,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:28,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:28,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:28,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:28,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:28,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:28,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:28,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:28,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:29,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:29,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:29,014 INFO L87 Difference]: Start difference. First operand 710 states. Second operand 3 states. [2019-09-10 06:55:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:29,190 INFO L93 Difference]: Finished difference Result 858 states and 1494 transitions. [2019-09-10 06:55:29,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:29,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:55:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:29,230 INFO L225 Difference]: With dead ends: 858 [2019-09-10 06:55:29,230 INFO L226 Difference]: Without dead ends: 850 [2019-09-10 06:55:29,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-09-10 06:55:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 848. [2019-09-10 06:55:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-09-10 06:55:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1156 transitions. [2019-09-10 06:55:29,317 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1156 transitions. Word has length 67 [2019-09-10 06:55:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:29,318 INFO L475 AbstractCegarLoop]: Abstraction has 848 states and 1156 transitions. [2019-09-10 06:55:29,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1156 transitions. [2019-09-10 06:55:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:55:29,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:29,325 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:29,325 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:29,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash -808974753, now seen corresponding path program 1 times [2019-09-10 06:55:29,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:29,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:29,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:29,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:29,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:29,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:29,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:29,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:29,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:29,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:29,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:29,517 INFO L87 Difference]: Start difference. First operand 848 states and 1156 transitions. Second operand 3 states. [2019-09-10 06:55:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:29,674 INFO L93 Difference]: Finished difference Result 1232 states and 1661 transitions. [2019-09-10 06:55:29,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:29,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:55:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:29,682 INFO L225 Difference]: With dead ends: 1232 [2019-09-10 06:55:29,682 INFO L226 Difference]: Without dead ends: 1232 [2019-09-10 06:55:29,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-09-10 06:55:29,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1228. [2019-09-10 06:55:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2019-09-10 06:55:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1659 transitions. [2019-09-10 06:55:29,729 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1659 transitions. Word has length 68 [2019-09-10 06:55:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:29,730 INFO L475 AbstractCegarLoop]: Abstraction has 1228 states and 1659 transitions. [2019-09-10 06:55:29,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1659 transitions. [2019-09-10 06:55:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:55:29,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:29,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:29,737 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:29,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:29,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1886079761, now seen corresponding path program 1 times [2019-09-10 06:55:29,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:29,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:29,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:29,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:29,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:29,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:29,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:55:29,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:29,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:55:29,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:55:29,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:55:29,960 INFO L87 Difference]: Start difference. First operand 1228 states and 1659 transitions. Second operand 6 states. [2019-09-10 06:55:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:30,804 INFO L93 Difference]: Finished difference Result 1900 states and 2665 transitions. [2019-09-10 06:55:30,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:55:30,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-10 06:55:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:30,818 INFO L225 Difference]: With dead ends: 1900 [2019-09-10 06:55:30,818 INFO L226 Difference]: Without dead ends: 1900 [2019-09-10 06:55:30,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:55:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2019-09-10 06:55:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1896. [2019-09-10 06:55:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-09-10 06:55:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2663 transitions. [2019-09-10 06:55:30,874 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2663 transitions. Word has length 68 [2019-09-10 06:55:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:30,875 INFO L475 AbstractCegarLoop]: Abstraction has 1896 states and 2663 transitions. [2019-09-10 06:55:30,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:55:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2663 transitions. [2019-09-10 06:55:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:55:30,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:30,882 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 06:55:30,882 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:30,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1179154145, now seen corresponding path program 1 times [2019-09-10 06:55:30,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:30,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:30,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:31,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:31,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:31,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:31,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:31,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:31,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:31,084 INFO L87 Difference]: Start difference. First operand 1896 states and 2663 transitions. Second operand 3 states. [2019-09-10 06:55:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:31,286 INFO L93 Difference]: Finished difference Result 2727 states and 3811 transitions. [2019-09-10 06:55:31,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:31,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:55:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:31,305 INFO L225 Difference]: With dead ends: 2727 [2019-09-10 06:55:31,305 INFO L226 Difference]: Without dead ends: 2727 [2019-09-10 06:55:31,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2019-09-10 06:55:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2717. [2019-09-10 06:55:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2717 states. [2019-09-10 06:55:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3802 transitions. [2019-09-10 06:55:31,386 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3802 transitions. Word has length 69 [2019-09-10 06:55:31,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:31,389 INFO L475 AbstractCegarLoop]: Abstraction has 2717 states and 3802 transitions. [2019-09-10 06:55:31,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3802 transitions. [2019-09-10 06:55:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:55:31,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:31,394 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 06:55:31,394 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1808255150, now seen corresponding path program 1 times [2019-09-10 06:55:31,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:31,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:31,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:31,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:55:31,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:31,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:55:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:55:31,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:55:31,585 INFO L87 Difference]: Start difference. First operand 2717 states and 3802 transitions. Second operand 6 states. [2019-09-10 06:55:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:32,255 INFO L93 Difference]: Finished difference Result 5621 states and 7946 transitions. [2019-09-10 06:55:32,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:55:32,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:55:32,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:32,282 INFO L225 Difference]: With dead ends: 5621 [2019-09-10 06:55:32,282 INFO L226 Difference]: Without dead ends: 5621 [2019-09-10 06:55:32,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:55:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5621 states. [2019-09-10 06:55:32,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5621 to 5613. [2019-09-10 06:55:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-09-10 06:55:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 7942 transitions. [2019-09-10 06:55:32,426 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 7942 transitions. Word has length 70 [2019-09-10 06:55:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:32,426 INFO L475 AbstractCegarLoop]: Abstraction has 5613 states and 7942 transitions. [2019-09-10 06:55:32,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:55:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 7942 transitions. [2019-09-10 06:55:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:55:32,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:32,431 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 06:55:32,432 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:32,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:32,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2110264071, now seen corresponding path program 1 times [2019-09-10 06:55:32,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:32,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:32,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:32,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:32,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 06:55:32,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:32,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:32,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:32,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:32,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:32,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:32,605 INFO L87 Difference]: Start difference. First operand 5613 states and 7942 transitions. Second operand 3 states. [2019-09-10 06:55:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:32,683 INFO L93 Difference]: Finished difference Result 8120 states and 11407 transitions. [2019-09-10 06:55:32,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:32,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 06:55:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:32,719 INFO L225 Difference]: With dead ends: 8120 [2019-09-10 06:55:32,719 INFO L226 Difference]: Without dead ends: 8120 [2019-09-10 06:55:32,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8120 states. [2019-09-10 06:55:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8120 to 8076. [2019-09-10 06:55:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8076 states. [2019-09-10 06:55:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8076 states to 8076 states and 11365 transitions. [2019-09-10 06:55:32,890 INFO L78 Accepts]: Start accepts. Automaton has 8076 states and 11365 transitions. Word has length 70 [2019-09-10 06:55:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:32,891 INFO L475 AbstractCegarLoop]: Abstraction has 8076 states and 11365 transitions. [2019-09-10 06:55:32,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 8076 states and 11365 transitions. [2019-09-10 06:55:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:55:32,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:32,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:32,898 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1046244720, now seen corresponding path program 1 times [2019-09-10 06:55:32,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:32,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:32,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:32,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:32,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:33,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:33,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:55:33,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:33,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:55:33,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:55:33,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:55:33,011 INFO L87 Difference]: Start difference. First operand 8076 states and 11365 transitions. Second operand 7 states. [2019-09-10 06:55:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:34,366 INFO L93 Difference]: Finished difference Result 29846 states and 42939 transitions. [2019-09-10 06:55:34,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:55:34,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 06:55:34,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:34,443 INFO L225 Difference]: With dead ends: 29846 [2019-09-10 06:55:34,444 INFO L226 Difference]: Without dead ends: 29846 [2019-09-10 06:55:34,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:55:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29846 states. [2019-09-10 06:55:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29846 to 8100. [2019-09-10 06:55:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8100 states. [2019-09-10 06:55:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8100 states to 8100 states and 11397 transitions. [2019-09-10 06:55:34,835 INFO L78 Accepts]: Start accepts. Automaton has 8100 states and 11397 transitions. Word has length 71 [2019-09-10 06:55:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:34,836 INFO L475 AbstractCegarLoop]: Abstraction has 8100 states and 11397 transitions. [2019-09-10 06:55:34,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:55:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 8100 states and 11397 transitions. [2019-09-10 06:55:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:55:34,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:34,843 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 06:55:34,843 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:34,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:34,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1662354062, now seen corresponding path program 1 times [2019-09-10 06:55:34,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:34,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:34,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:34,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:34,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:34,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:34,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:55:34,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:34,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:55:34,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:55:34,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:55:34,943 INFO L87 Difference]: Start difference. First operand 8100 states and 11397 transitions. Second operand 5 states. [2019-09-10 06:55:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:35,537 INFO L93 Difference]: Finished difference Result 11141 states and 15628 transitions. [2019-09-10 06:55:35,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:55:35,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:55:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:35,558 INFO L225 Difference]: With dead ends: 11141 [2019-09-10 06:55:35,558 INFO L226 Difference]: Without dead ends: 11141 [2019-09-10 06:55:35,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:55:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11141 states. [2019-09-10 06:55:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11141 to 8100. [2019-09-10 06:55:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8100 states. [2019-09-10 06:55:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8100 states to 8100 states and 11346 transitions. [2019-09-10 06:55:35,699 INFO L78 Accepts]: Start accepts. Automaton has 8100 states and 11346 transitions. Word has length 71 [2019-09-10 06:55:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:35,700 INFO L475 AbstractCegarLoop]: Abstraction has 8100 states and 11346 transitions. [2019-09-10 06:55:35,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:55:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 8100 states and 11346 transitions. [2019-09-10 06:55:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:55:35,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:35,707 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 06:55:35,708 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:35,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:35,708 INFO L82 PathProgramCache]: Analyzing trace with hash 781936563, now seen corresponding path program 1 times [2019-09-10 06:55:35,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:35,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:35,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:35,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:35,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:35,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:35,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:55:35,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:35,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:55:35,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:55:35,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:55:35,815 INFO L87 Difference]: Start difference. First operand 8100 states and 11346 transitions. Second operand 6 states. [2019-09-10 06:55:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:36,424 INFO L93 Difference]: Finished difference Result 16684 states and 23273 transitions. [2019-09-10 06:55:36,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:55:36,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-10 06:55:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:36,456 INFO L225 Difference]: With dead ends: 16684 [2019-09-10 06:55:36,457 INFO L226 Difference]: Without dead ends: 16684 [2019-09-10 06:55:36,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:55:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16684 states. [2019-09-10 06:55:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16684 to 16576. [2019-09-10 06:55:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16576 states. [2019-09-10 06:55:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16576 states to 16576 states and 23169 transitions. [2019-09-10 06:55:36,671 INFO L78 Accepts]: Start accepts. Automaton has 16576 states and 23169 transitions. Word has length 72 [2019-09-10 06:55:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:36,671 INFO L475 AbstractCegarLoop]: Abstraction has 16576 states and 23169 transitions. [2019-09-10 06:55:36,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:55:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 16576 states and 23169 transitions. [2019-09-10 06:55:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:55:36,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:36,680 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 06:55:36,680 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:36,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1774096579, now seen corresponding path program 1 times [2019-09-10 06:55:36,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:36,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:36,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:36,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:36,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:36,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:36,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:55:36,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:36,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:55:36,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:55:36,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:55:36,822 INFO L87 Difference]: Start difference. First operand 16576 states and 23169 transitions. Second operand 7 states. [2019-09-10 06:55:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:37,960 INFO L93 Difference]: Finished difference Result 53845 states and 75262 transitions. [2019-09-10 06:55:37,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:55:37,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-10 06:55:37,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:38,050 INFO L225 Difference]: With dead ends: 53845 [2019-09-10 06:55:38,051 INFO L226 Difference]: Without dead ends: 53845 [2019-09-10 06:55:38,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:55:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53845 states. [2019-09-10 06:55:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53845 to 16604. [2019-09-10 06:55:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16604 states. [2019-09-10 06:55:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16604 states to 16604 states and 23205 transitions. [2019-09-10 06:55:39,276 INFO L78 Accepts]: Start accepts. Automaton has 16604 states and 23205 transitions. Word has length 72 [2019-09-10 06:55:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:39,276 INFO L475 AbstractCegarLoop]: Abstraction has 16604 states and 23205 transitions. [2019-09-10 06:55:39,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:55:39,276 INFO L276 IsEmpty]: Start isEmpty. Operand 16604 states and 23205 transitions. [2019-09-10 06:55:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:55:39,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:39,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:39,284 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:39,285 INFO L82 PathProgramCache]: Analyzing trace with hash -985771663, now seen corresponding path program 1 times [2019-09-10 06:55:39,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:39,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:39,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:39,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:39,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:39,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:39,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:55:39,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:39,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:55:39,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:55:39,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:55:39,395 INFO L87 Difference]: Start difference. First operand 16604 states and 23205 transitions. Second operand 7 states. [2019-09-10 06:55:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:40,730 INFO L93 Difference]: Finished difference Result 70766 states and 99979 transitions. [2019-09-10 06:55:40,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:55:40,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-10 06:55:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:40,831 INFO L225 Difference]: With dead ends: 70766 [2019-09-10 06:55:40,832 INFO L226 Difference]: Without dead ends: 70766 [2019-09-10 06:55:40,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:55:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70766 states. [2019-09-10 06:55:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70766 to 16701. [2019-09-10 06:55:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16701 states. [2019-09-10 06:55:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16701 states to 16701 states and 23334 transitions. [2019-09-10 06:55:41,564 INFO L78 Accepts]: Start accepts. Automaton has 16701 states and 23334 transitions. Word has length 73 [2019-09-10 06:55:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:41,564 INFO L475 AbstractCegarLoop]: Abstraction has 16701 states and 23334 transitions. [2019-09-10 06:55:41,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:55:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 16701 states and 23334 transitions. [2019-09-10 06:55:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:55:41,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:41,573 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 06:55:41,574 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:41,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash -748097079, now seen corresponding path program 1 times [2019-09-10 06:55:41,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:41,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:41,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:41,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:41,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:41,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:41,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:55:41,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:41,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:55:41,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:55:41,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:55:41,831 INFO L87 Difference]: Start difference. First operand 16701 states and 23334 transitions. Second operand 10 states. [2019-09-10 06:55:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:45,996 INFO L93 Difference]: Finished difference Result 85299 states and 121143 transitions. [2019-09-10 06:55:45,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:55:45,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-10 06:55:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:46,069 INFO L225 Difference]: With dead ends: 85299 [2019-09-10 06:55:46,069 INFO L226 Difference]: Without dead ends: 85299 [2019-09-10 06:55:46,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:55:46,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85299 states. [2019-09-10 06:55:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85299 to 16701. [2019-09-10 06:55:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16701 states. [2019-09-10 06:55:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16701 states to 16701 states and 23332 transitions. [2019-09-10 06:55:46,585 INFO L78 Accepts]: Start accepts. Automaton has 16701 states and 23332 transitions. Word has length 74 [2019-09-10 06:55:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:46,585 INFO L475 AbstractCegarLoop]: Abstraction has 16701 states and 23332 transitions. [2019-09-10 06:55:46,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:55:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 16701 states and 23332 transitions. [2019-09-10 06:55:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:55:46,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:46,596 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 06:55:46,596 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:46,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1361960620, now seen corresponding path program 1 times [2019-09-10 06:55:46,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:46,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:46,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:46,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:46,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:46,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:46,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:55:46,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:46,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:55:46,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:55:46,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:55:46,958 INFO L87 Difference]: Start difference. First operand 16701 states and 23332 transitions. Second operand 9 states. [2019-09-10 06:55:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:48,707 INFO L93 Difference]: Finished difference Result 41641 states and 58936 transitions. [2019-09-10 06:55:48,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:55:48,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-09-10 06:55:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:48,741 INFO L225 Difference]: With dead ends: 41641 [2019-09-10 06:55:48,741 INFO L226 Difference]: Without dead ends: 41641 [2019-09-10 06:55:48,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:55:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41641 states. [2019-09-10 06:55:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41641 to 16697. [2019-09-10 06:55:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16697 states. [2019-09-10 06:55:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16697 states to 16697 states and 23324 transitions. [2019-09-10 06:55:49,011 INFO L78 Accepts]: Start accepts. Automaton has 16697 states and 23324 transitions. Word has length 74 [2019-09-10 06:55:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:49,012 INFO L475 AbstractCegarLoop]: Abstraction has 16697 states and 23324 transitions. [2019-09-10 06:55:49,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:55:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 16697 states and 23324 transitions. [2019-09-10 06:55:49,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:55:49,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:49,020 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 06:55:49,020 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:49,020 INFO L82 PathProgramCache]: Analyzing trace with hash -496781760, now seen corresponding path program 1 times [2019-09-10 06:55:49,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:49,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:49,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:49,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:49,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:49,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:49,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:55:49,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:49,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:55:49,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:55:49,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:55:49,454 INFO L87 Difference]: Start difference. First operand 16697 states and 23324 transitions. Second operand 12 states. [2019-09-10 06:55:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:52,046 INFO L93 Difference]: Finished difference Result 91742 states and 130574 transitions. [2019-09-10 06:55:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:55:52,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2019-09-10 06:55:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:52,132 INFO L225 Difference]: With dead ends: 91742 [2019-09-10 06:55:52,133 INFO L226 Difference]: Without dead ends: 91742 [2019-09-10 06:55:52,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:55:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91742 states. [2019-09-10 06:55:52,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91742 to 16473. [2019-09-10 06:55:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16473 states. [2019-09-10 06:55:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16473 states to 16473 states and 23044 transitions. [2019-09-10 06:55:52,541 INFO L78 Accepts]: Start accepts. Automaton has 16473 states and 23044 transitions. Word has length 75 [2019-09-10 06:55:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:52,541 INFO L475 AbstractCegarLoop]: Abstraction has 16473 states and 23044 transitions. [2019-09-10 06:55:52,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:55:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 16473 states and 23044 transitions. [2019-09-10 06:55:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:55:52,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:52,548 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 06:55:52,549 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:52,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash -800259869, now seen corresponding path program 1 times [2019-09-10 06:55:52,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:52,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:52,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:52,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:52,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:52,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:55:52,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:52,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:55:52,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:55:52,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:55:52,656 INFO L87 Difference]: Start difference. First operand 16473 states and 23044 transitions. Second operand 7 states. [2019-09-10 06:55:54,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:54,112 INFO L93 Difference]: Finished difference Result 60861 states and 85536 transitions. [2019-09-10 06:55:54,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:55:54,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-09-10 06:55:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:54,171 INFO L225 Difference]: With dead ends: 60861 [2019-09-10 06:55:54,171 INFO L226 Difference]: Without dead ends: 60861 [2019-09-10 06:55:54,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:55:54,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60861 states. [2019-09-10 06:55:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60861 to 16561. [2019-09-10 06:55:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16561 states. [2019-09-10 06:55:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16561 states to 16561 states and 23165 transitions. [2019-09-10 06:55:54,517 INFO L78 Accepts]: Start accepts. Automaton has 16561 states and 23165 transitions. Word has length 75 [2019-09-10 06:55:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:54,517 INFO L475 AbstractCegarLoop]: Abstraction has 16561 states and 23165 transitions. [2019-09-10 06:55:54,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:55:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 16561 states and 23165 transitions. [2019-09-10 06:55:54,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:55:54,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:54,523 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 06:55:54,523 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:54,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:54,523 INFO L82 PathProgramCache]: Analyzing trace with hash 396030427, now seen corresponding path program 1 times [2019-09-10 06:55:54,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:54,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:54,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:54,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:54,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:55,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:55,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:55:55,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:55,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:55:55,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:55:55,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:55:55,056 INFO L87 Difference]: Start difference. First operand 16561 states and 23165 transitions. Second operand 12 states. [2019-09-10 06:55:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:57,627 INFO L93 Difference]: Finished difference Result 91218 states and 129980 transitions. [2019-09-10 06:55:57,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:55:57,628 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2019-09-10 06:55:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:57,710 INFO L225 Difference]: With dead ends: 91218 [2019-09-10 06:55:57,710 INFO L226 Difference]: Without dead ends: 91218 [2019-09-10 06:55:57,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:55:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91218 states. [2019-09-10 06:55:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91218 to 16529. [2019-09-10 06:55:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16529 states. [2019-09-10 06:55:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16529 states to 16529 states and 23123 transitions. [2019-09-10 06:55:58,112 INFO L78 Accepts]: Start accepts. Automaton has 16529 states and 23123 transitions. Word has length 75 [2019-09-10 06:55:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:58,113 INFO L475 AbstractCegarLoop]: Abstraction has 16529 states and 23123 transitions. [2019-09-10 06:55:58,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:55:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 16529 states and 23123 transitions. [2019-09-10 06:55:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:55:58,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:58,118 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 06:55:58,119 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1982405688, now seen corresponding path program 1 times [2019-09-10 06:55:58,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:58,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:58,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:58,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:58,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:55:58,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:58,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:55:58,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:55:58,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:55:58,319 INFO L87 Difference]: Start difference. First operand 16529 states and 23123 transitions. Second operand 9 states. [2019-09-10 06:56:00,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:00,476 INFO L93 Difference]: Finished difference Result 68192 states and 97313 transitions. [2019-09-10 06:56:00,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:56:00,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 06:56:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:00,536 INFO L225 Difference]: With dead ends: 68192 [2019-09-10 06:56:00,536 INFO L226 Difference]: Without dead ends: 68192 [2019-09-10 06:56:00,537 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 06:56:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68192 states. [2019-09-10 06:56:01,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68192 to 16501. [2019-09-10 06:56:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16501 states. [2019-09-10 06:56:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16501 states to 16501 states and 23079 transitions. [2019-09-10 06:56:01,064 INFO L78 Accepts]: Start accepts. Automaton has 16501 states and 23079 transitions. Word has length 75 [2019-09-10 06:56:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:01,064 INFO L475 AbstractCegarLoop]: Abstraction has 16501 states and 23079 transitions. [2019-09-10 06:56:01,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 16501 states and 23079 transitions. [2019-09-10 06:56:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:56:01,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:01,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:01,069 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:01,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash -721956628, now seen corresponding path program 1 times [2019-09-10 06:56:01,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:01,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:01,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:01,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:01,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:01,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:56:01,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:01,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:56:01,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:56:01,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:56:01,172 INFO L87 Difference]: Start difference. First operand 16501 states and 23079 transitions. Second operand 7 states. [2019-09-10 06:56:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:02,412 INFO L93 Difference]: Finished difference Result 70402 states and 99545 transitions. [2019-09-10 06:56:02,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:56:02,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-09-10 06:56:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:02,474 INFO L225 Difference]: With dead ends: 70402 [2019-09-10 06:56:02,474 INFO L226 Difference]: Without dead ends: 70402 [2019-09-10 06:56:02,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:56:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70402 states. [2019-09-10 06:56:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70402 to 16531. [2019-09-10 06:56:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16531 states. [2019-09-10 06:56:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16531 states to 16531 states and 23119 transitions. [2019-09-10 06:56:02,861 INFO L78 Accepts]: Start accepts. Automaton has 16531 states and 23119 transitions. Word has length 76 [2019-09-10 06:56:02,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:02,861 INFO L475 AbstractCegarLoop]: Abstraction has 16531 states and 23119 transitions. [2019-09-10 06:56:02,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:56:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 16531 states and 23119 transitions. [2019-09-10 06:56:02,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:56:02,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:02,867 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:02,867 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:02,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1501607501, now seen corresponding path program 1 times [2019-09-10 06:56:02,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:02,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:02,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:02,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:02,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:03,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:03,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:56:03,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:03,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:56:03,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:56:03,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:56:03,063 INFO L87 Difference]: Start difference. First operand 16531 states and 23119 transitions. Second operand 10 states. [2019-09-10 06:56:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:05,676 INFO L93 Difference]: Finished difference Result 70776 states and 100308 transitions. [2019-09-10 06:56:05,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:56:05,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2019-09-10 06:56:05,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:05,746 INFO L225 Difference]: With dead ends: 70776 [2019-09-10 06:56:05,747 INFO L226 Difference]: Without dead ends: 70776 [2019-09-10 06:56:05,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:56:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70776 states. [2019-09-10 06:56:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70776 to 16345. [2019-09-10 06:56:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16345 states. [2019-09-10 06:56:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16345 states to 16345 states and 22877 transitions. [2019-09-10 06:56:06,100 INFO L78 Accepts]: Start accepts. Automaton has 16345 states and 22877 transitions. Word has length 76 [2019-09-10 06:56:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:06,100 INFO L475 AbstractCegarLoop]: Abstraction has 16345 states and 22877 transitions. [2019-09-10 06:56:06,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:56:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 16345 states and 22877 transitions. [2019-09-10 06:56:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:56:06,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:06,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:06,107 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:06,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:06,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1544377412, now seen corresponding path program 1 times [2019-09-10 06:56:06,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:06,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:06,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:06,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:06,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:06,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:06,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:56:06,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:06,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:56:06,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:56:06,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:56:06,214 INFO L87 Difference]: Start difference. First operand 16345 states and 22877 transitions. Second operand 7 states. [2019-09-10 06:56:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:07,454 INFO L93 Difference]: Finished difference Result 60589 states and 85191 transitions. [2019-09-10 06:56:07,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:56:07,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-09-10 06:56:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:07,508 INFO L225 Difference]: With dead ends: 60589 [2019-09-10 06:56:07,508 INFO L226 Difference]: Without dead ends: 60589 [2019-09-10 06:56:07,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:56:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60589 states. [2019-09-10 06:56:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60589 to 16388. [2019-09-10 06:56:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16388 states. [2019-09-10 06:56:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16388 states to 16388 states and 22938 transitions. [2019-09-10 06:56:07,857 INFO L78 Accepts]: Start accepts. Automaton has 16388 states and 22938 transitions. Word has length 76 [2019-09-10 06:56:07,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:07,857 INFO L475 AbstractCegarLoop]: Abstraction has 16388 states and 22938 transitions. [2019-09-10 06:56:07,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:56:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 16388 states and 22938 transitions. [2019-09-10 06:56:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:56:07,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:07,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:07,865 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:07,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:07,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2116167533, now seen corresponding path program 1 times [2019-09-10 06:56:07,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:07,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:07,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:07,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:07,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:08,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:08,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:56:08,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:08,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:56:08,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:56:08,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:56:08,267 INFO L87 Difference]: Start difference. First operand 16388 states and 22938 transitions. Second operand 13 states. [2019-09-10 06:56:09,062 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 06:56:09,295 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 06:56:09,541 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 06:56:09,879 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 06:56:10,040 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 06:56:10,368 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 06:56:10,771 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 06:56:11,516 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 06:56:11,813 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 06:56:12,367 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 06:56:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:13,080 INFO L93 Difference]: Finished difference Result 114528 states and 162173 transitions. [2019-09-10 06:56:13,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:56:13,080 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2019-09-10 06:56:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:13,190 INFO L225 Difference]: With dead ends: 114528 [2019-09-10 06:56:13,190 INFO L226 Difference]: Without dead ends: 114528 [2019-09-10 06:56:13,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=371, Invalid=1189, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:56:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114528 states. [2019-09-10 06:56:13,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114528 to 16356. [2019-09-10 06:56:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16356 states. [2019-09-10 06:56:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16356 states to 16356 states and 22895 transitions. [2019-09-10 06:56:13,663 INFO L78 Accepts]: Start accepts. Automaton has 16356 states and 22895 transitions. Word has length 76 [2019-09-10 06:56:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:13,663 INFO L475 AbstractCegarLoop]: Abstraction has 16356 states and 22895 transitions. [2019-09-10 06:56:13,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:56:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 16356 states and 22895 transitions. [2019-09-10 06:56:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:56:13,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:13,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:13,670 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:13,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:13,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1252560031, now seen corresponding path program 1 times [2019-09-10 06:56:13,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:13,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:13,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:13,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:13,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:14,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:14,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:56:14,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:14,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:56:14,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:56:14,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:56:14,287 INFO L87 Difference]: Start difference. First operand 16356 states and 22895 transitions. Second operand 13 states. [2019-09-10 06:56:15,308 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:56:15,590 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 06:56:15,889 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:56:16,290 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:56:16,502 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 06:56:16,713 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:56:16,961 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:56:17,177 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 06:56:17,360 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:56:17,582 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:56:18,105 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 06:56:18,326 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:56:18,640 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 06:56:19,096 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 06:56:19,490 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:56:19,712 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 06:56:19,930 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:56:20,277 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:56:20,474 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:56:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:21,281 INFO L93 Difference]: Finished difference Result 135376 states and 192302 transitions. [2019-09-10 06:56:21,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 06:56:21,283 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-09-10 06:56:21,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:21,415 INFO L225 Difference]: With dead ends: 135376 [2019-09-10 06:56:21,415 INFO L226 Difference]: Without dead ends: 135376 [2019-09-10 06:56:21,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=457, Invalid=1435, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 06:56:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135376 states. [2019-09-10 06:56:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135376 to 16347. [2019-09-10 06:56:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16347 states. [2019-09-10 06:56:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16347 states to 16347 states and 22883 transitions. [2019-09-10 06:56:22,002 INFO L78 Accepts]: Start accepts. Automaton has 16347 states and 22883 transitions. Word has length 77 [2019-09-10 06:56:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:22,002 INFO L475 AbstractCegarLoop]: Abstraction has 16347 states and 22883 transitions. [2019-09-10 06:56:22,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:56:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 16347 states and 22883 transitions. [2019-09-10 06:56:22,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:56:22,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:22,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 06:56:22,008 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:22,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:22,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1021172735, now seen corresponding path program 1 times [2019-09-10 06:56:22,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:22,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:22,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:22,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:22,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:22,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:22,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:56:22,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:22,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:56:22,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:56:22,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:56:22,236 INFO L87 Difference]: Start difference. First operand 16347 states and 22883 transitions. Second operand 10 states. [2019-09-10 06:56:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:25,274 INFO L93 Difference]: Finished difference Result 59832 states and 84522 transitions. [2019-09-10 06:56:25,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:56:25,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-09-10 06:56:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:25,330 INFO L225 Difference]: With dead ends: 59832 [2019-09-10 06:56:25,330 INFO L226 Difference]: Without dead ends: 59832 [2019-09-10 06:56:25,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:56:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59832 states. [2019-09-10 06:56:25,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59832 to 16347. [2019-09-10 06:56:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16347 states. [2019-09-10 06:56:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16347 states to 16347 states and 22881 transitions. [2019-09-10 06:56:25,670 INFO L78 Accepts]: Start accepts. Automaton has 16347 states and 22881 transitions. Word has length 77 [2019-09-10 06:56:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:25,671 INFO L475 AbstractCegarLoop]: Abstraction has 16347 states and 22881 transitions. [2019-09-10 06:56:25,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:56:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 16347 states and 22881 transitions. [2019-09-10 06:56:25,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:56:25,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:25,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:25,675 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:25,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1655595086, now seen corresponding path program 1 times [2019-09-10 06:56:25,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:25,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:25,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:25,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:25,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:25,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:25,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:25,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:25,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:25,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:25,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:25,736 INFO L87 Difference]: Start difference. First operand 16347 states and 22881 transitions. Second operand 3 states. [2019-09-10 06:56:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:25,815 INFO L93 Difference]: Finished difference Result 16351 states and 22646 transitions. [2019-09-10 06:56:25,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:25,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:56:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:25,837 INFO L225 Difference]: With dead ends: 16351 [2019-09-10 06:56:25,837 INFO L226 Difference]: Without dead ends: 16351 [2019-09-10 06:56:25,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16351 states. [2019-09-10 06:56:26,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16351 to 16347. [2019-09-10 06:56:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16347 states. [2019-09-10 06:56:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16347 states to 16347 states and 22644 transitions. [2019-09-10 06:56:26,038 INFO L78 Accepts]: Start accepts. Automaton has 16347 states and 22644 transitions. Word has length 77 [2019-09-10 06:56:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:26,038 INFO L475 AbstractCegarLoop]: Abstraction has 16347 states and 22644 transitions. [2019-09-10 06:56:26,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 16347 states and 22644 transitions. [2019-09-10 06:56:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:56:26,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:26,045 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:26,045 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:26,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:26,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2116867699, now seen corresponding path program 1 times [2019-09-10 06:56:26,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:26,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:26,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:26,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:26,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:26,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:26,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:26,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:26,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:26,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:26,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:26,116 INFO L87 Difference]: Start difference. First operand 16347 states and 22644 transitions. Second operand 3 states. [2019-09-10 06:56:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:26,305 INFO L93 Difference]: Finished difference Result 23716 states and 33132 transitions. [2019-09-10 06:56:26,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:26,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:56:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:26,335 INFO L225 Difference]: With dead ends: 23716 [2019-09-10 06:56:26,335 INFO L226 Difference]: Without dead ends: 23716 [2019-09-10 06:56:26,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23716 states. [2019-09-10 06:56:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23716 to 18752. [2019-09-10 06:56:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18752 states. [2019-09-10 06:56:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18752 states to 18752 states and 26150 transitions. [2019-09-10 06:56:26,565 INFO L78 Accepts]: Start accepts. Automaton has 18752 states and 26150 transitions. Word has length 77 [2019-09-10 06:56:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:26,565 INFO L475 AbstractCegarLoop]: Abstraction has 18752 states and 26150 transitions. [2019-09-10 06:56:26,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 18752 states and 26150 transitions. [2019-09-10 06:56:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:56:26,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:26,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:26,571 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:26,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:26,572 INFO L82 PathProgramCache]: Analyzing trace with hash 356792185, now seen corresponding path program 1 times [2019-09-10 06:56:26,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:26,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:26,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:26,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:26,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:26,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:26,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:26,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:26,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:26,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:26,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:26,640 INFO L87 Difference]: Start difference. First operand 18752 states and 26150 transitions. Second operand 3 states. [2019-09-10 06:56:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:26,711 INFO L93 Difference]: Finished difference Result 18754 states and 25895 transitions. [2019-09-10 06:56:26,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:26,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:56:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:26,732 INFO L225 Difference]: With dead ends: 18754 [2019-09-10 06:56:26,732 INFO L226 Difference]: Without dead ends: 18754 [2019-09-10 06:56:26,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18754 states. [2019-09-10 06:56:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18754 to 18752. [2019-09-10 06:56:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18752 states. [2019-09-10 06:56:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18752 states to 18752 states and 25894 transitions. [2019-09-10 06:56:26,868 INFO L78 Accepts]: Start accepts. Automaton has 18752 states and 25894 transitions. Word has length 78 [2019-09-10 06:56:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:26,868 INFO L475 AbstractCegarLoop]: Abstraction has 18752 states and 25894 transitions. [2019-09-10 06:56:26,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 18752 states and 25894 transitions. [2019-09-10 06:56:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:56:26,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:26,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] [2019-09-10 06:56:26,872 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:26,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:26,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1518027636, now seen corresponding path program 1 times [2019-09-10 06:56:26,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:26,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:26,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:26,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:26,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:26,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:26,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:26,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:26,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:26,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:26,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:26,932 INFO L87 Difference]: Start difference. First operand 18752 states and 25894 transitions. Second operand 3 states. [2019-09-10 06:56:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:26,985 INFO L93 Difference]: Finished difference Result 18421 states and 25177 transitions. [2019-09-10 06:56:26,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:26,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:56:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:27,000 INFO L225 Difference]: With dead ends: 18421 [2019-09-10 06:56:27,000 INFO L226 Difference]: Without dead ends: 18421 [2019-09-10 06:56:27,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18421 states. [2019-09-10 06:56:27,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18421 to 18419. [2019-09-10 06:56:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18419 states. [2019-09-10 06:56:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18419 states to 18419 states and 25176 transitions. [2019-09-10 06:56:27,191 INFO L78 Accepts]: Start accepts. Automaton has 18419 states and 25176 transitions. Word has length 78 [2019-09-10 06:56:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:27,191 INFO L475 AbstractCegarLoop]: Abstraction has 18419 states and 25176 transitions. [2019-09-10 06:56:27,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 18419 states and 25176 transitions. [2019-09-10 06:56:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:56:27,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:27,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:27,196 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:27,196 INFO L82 PathProgramCache]: Analyzing trace with hash 466583394, now seen corresponding path program 1 times [2019-09-10 06:56:27,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:27,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:27,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:27,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:27,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:27,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:27,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:27,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:27,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:27,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:27,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:27,244 INFO L87 Difference]: Start difference. First operand 18419 states and 25176 transitions. Second operand 3 states. [2019-09-10 06:56:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:27,334 INFO L93 Difference]: Finished difference Result 27388 states and 37647 transitions. [2019-09-10 06:56:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:27,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 06:56:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:27,357 INFO L225 Difference]: With dead ends: 27388 [2019-09-10 06:56:27,357 INFO L226 Difference]: Without dead ends: 27388 [2019-09-10 06:56:27,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:27,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27388 states. [2019-09-10 06:56:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27388 to 18032. [2019-09-10 06:56:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18032 states. [2019-09-10 06:56:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18032 states to 18032 states and 24656 transitions. [2019-09-10 06:56:27,505 INFO L78 Accepts]: Start accepts. Automaton has 18032 states and 24656 transitions. Word has length 79 [2019-09-10 06:56:27,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:27,505 INFO L475 AbstractCegarLoop]: Abstraction has 18032 states and 24656 transitions. [2019-09-10 06:56:27,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 18032 states and 24656 transitions. [2019-09-10 06:56:27,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:56:27,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:27,509 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:27,509 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:27,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1453165948, now seen corresponding path program 1 times [2019-09-10 06:56:27,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:27,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:27,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:27,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:27,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:27,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:27,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:27,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:27,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:27,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:27,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:27,566 INFO L87 Difference]: Start difference. First operand 18032 states and 24656 transitions. Second operand 3 states. [2019-09-10 06:56:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:27,683 INFO L93 Difference]: Finished difference Result 27124 states and 37221 transitions. [2019-09-10 06:56:27,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:27,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 06:56:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:27,706 INFO L225 Difference]: With dead ends: 27124 [2019-09-10 06:56:27,706 INFO L226 Difference]: Without dead ends: 27124 [2019-09-10 06:56:27,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27124 states. [2019-09-10 06:56:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27124 to 17766. [2019-09-10 06:56:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17766 states. [2019-09-10 06:56:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17766 states to 17766 states and 24265 transitions. [2019-09-10 06:56:27,855 INFO L78 Accepts]: Start accepts. Automaton has 17766 states and 24265 transitions. Word has length 79 [2019-09-10 06:56:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:27,855 INFO L475 AbstractCegarLoop]: Abstraction has 17766 states and 24265 transitions. [2019-09-10 06:56:27,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 17766 states and 24265 transitions. [2019-09-10 06:56:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:56:27,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:27,858 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:27,859 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:27,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1034435502, now seen corresponding path program 1 times [2019-09-10 06:56:27,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:27,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:27,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:27,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 06:56:27,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:27,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:27,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:28,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:28,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:28,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:28,000 INFO L87 Difference]: Start difference. First operand 17766 states and 24265 transitions. Second operand 9 states. [2019-09-10 06:56:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:29,524 INFO L93 Difference]: Finished difference Result 47056 states and 64794 transitions. [2019-09-10 06:56:29,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:56:29,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-10 06:56:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:29,578 INFO L225 Difference]: With dead ends: 47056 [2019-09-10 06:56:29,578 INFO L226 Difference]: Without dead ends: 47056 [2019-09-10 06:56:29,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:56:29,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47056 states. [2019-09-10 06:56:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47056 to 17762. [2019-09-10 06:56:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17762 states. [2019-09-10 06:56:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17762 states to 17762 states and 24257 transitions. [2019-09-10 06:56:29,815 INFO L78 Accepts]: Start accepts. Automaton has 17762 states and 24257 transitions. Word has length 79 [2019-09-10 06:56:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:29,815 INFO L475 AbstractCegarLoop]: Abstraction has 17762 states and 24257 transitions. [2019-09-10 06:56:29,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:29,816 INFO L276 IsEmpty]: Start isEmpty. Operand 17762 states and 24257 transitions. [2019-09-10 06:56:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:56:29,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:29,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:29,819 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:29,819 INFO L82 PathProgramCache]: Analyzing trace with hash 703952672, now seen corresponding path program 1 times [2019-09-10 06:56:29,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:29,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:29,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:29,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:29,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:29,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:29,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:29,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:29,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:29,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:29,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:29,953 INFO L87 Difference]: Start difference. First operand 17762 states and 24257 transitions. Second operand 9 states. [2019-09-10 06:56:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:31,318 INFO L93 Difference]: Finished difference Result 29562 states and 40520 transitions. [2019-09-10 06:56:31,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:56:31,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-10 06:56:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:31,348 INFO L225 Difference]: With dead ends: 29562 [2019-09-10 06:56:31,348 INFO L226 Difference]: Without dead ends: 29562 [2019-09-10 06:56:31,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:56:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29562 states. [2019-09-10 06:56:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29562 to 17762. [2019-09-10 06:56:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17762 states. [2019-09-10 06:56:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17762 states to 17762 states and 24255 transitions. [2019-09-10 06:56:31,524 INFO L78 Accepts]: Start accepts. Automaton has 17762 states and 24255 transitions. Word has length 79 [2019-09-10 06:56:31,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:31,525 INFO L475 AbstractCegarLoop]: Abstraction has 17762 states and 24255 transitions. [2019-09-10 06:56:31,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 17762 states and 24255 transitions. [2019-09-10 06:56:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:56:31,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:31,530 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 06:56:31,530 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:31,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:31,531 INFO L82 PathProgramCache]: Analyzing trace with hash 703453167, now seen corresponding path program 1 times [2019-09-10 06:56:31,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:31,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:31,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:31,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:31,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:31,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:31,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:31,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:31,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:31,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:31,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:31,710 INFO L87 Difference]: Start difference. First operand 17762 states and 24255 transitions. Second operand 9 states. [2019-09-10 06:56:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:33,124 INFO L93 Difference]: Finished difference Result 29562 states and 40518 transitions. [2019-09-10 06:56:33,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:56:33,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 06:56:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:33,153 INFO L225 Difference]: With dead ends: 29562 [2019-09-10 06:56:33,153 INFO L226 Difference]: Without dead ends: 29562 [2019-09-10 06:56:33,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:56:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29562 states. [2019-09-10 06:56:33,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29562 to 17762. [2019-09-10 06:56:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17762 states. [2019-09-10 06:56:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17762 states to 17762 states and 24253 transitions. [2019-09-10 06:56:33,313 INFO L78 Accepts]: Start accepts. Automaton has 17762 states and 24253 transitions. Word has length 80 [2019-09-10 06:56:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:33,314 INFO L475 AbstractCegarLoop]: Abstraction has 17762 states and 24253 transitions. [2019-09-10 06:56:33,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 17762 states and 24253 transitions. [2019-09-10 06:56:33,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:56:33,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:33,317 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 06:56:33,317 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:33,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:33,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1367950000, now seen corresponding path program 1 times [2019-09-10 06:56:33,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:33,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:33,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:33,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:33,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:33,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:33,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:33,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:33,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:33,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:33,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:33,455 INFO L87 Difference]: Start difference. First operand 17762 states and 24253 transitions. Second operand 9 states. [2019-09-10 06:56:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:35,349 INFO L93 Difference]: Finished difference Result 54862 states and 75564 transitions. [2019-09-10 06:56:35,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:56:35,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 06:56:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:35,402 INFO L225 Difference]: With dead ends: 54862 [2019-09-10 06:56:35,402 INFO L226 Difference]: Without dead ends: 54862 [2019-09-10 06:56:35,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:56:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54862 states. [2019-09-10 06:56:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54862 to 17762. [2019-09-10 06:56:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17762 states. [2019-09-10 06:56:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17762 states to 17762 states and 24251 transitions. [2019-09-10 06:56:35,664 INFO L78 Accepts]: Start accepts. Automaton has 17762 states and 24251 transitions. Word has length 80 [2019-09-10 06:56:35,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:35,664 INFO L475 AbstractCegarLoop]: Abstraction has 17762 states and 24251 transitions. [2019-09-10 06:56:35,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:35,665 INFO L276 IsEmpty]: Start isEmpty. Operand 17762 states and 24251 transitions. [2019-09-10 06:56:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:56:35,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:35,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] [2019-09-10 06:56:35,670 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:35,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:35,670 INFO L82 PathProgramCache]: Analyzing trace with hash -993377329, now seen corresponding path program 1 times [2019-09-10 06:56:35,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:35,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:35,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:35,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:35,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:35,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:35,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:35,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:35,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:35,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:35,738 INFO L87 Difference]: Start difference. First operand 17762 states and 24251 transitions. Second operand 3 states. [2019-09-10 06:56:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:35,827 INFO L93 Difference]: Finished difference Result 17729 states and 23876 transitions. [2019-09-10 06:56:35,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:35,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 06:56:35,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:35,845 INFO L225 Difference]: With dead ends: 17729 [2019-09-10 06:56:35,845 INFO L226 Difference]: Without dead ends: 17729 [2019-09-10 06:56:35,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17729 states. [2019-09-10 06:56:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17729 to 14947. [2019-09-10 06:56:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14947 states. [2019-09-10 06:56:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14947 states to 14947 states and 20070 transitions. [2019-09-10 06:56:35,956 INFO L78 Accepts]: Start accepts. Automaton has 14947 states and 20070 transitions. Word has length 80 [2019-09-10 06:56:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:35,956 INFO L475 AbstractCegarLoop]: Abstraction has 14947 states and 20070 transitions. [2019-09-10 06:56:35,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 14947 states and 20070 transitions. [2019-09-10 06:56:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:56:35,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:35,960 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 06:56:35,960 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:35,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:35,960 INFO L82 PathProgramCache]: Analyzing trace with hash 348839284, now seen corresponding path program 1 times [2019-09-10 06:56:35,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:35,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:35,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:36,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:36,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:56:36,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:36,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:56:36,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:56:36,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:36,099 INFO L87 Difference]: Start difference. First operand 14947 states and 20070 transitions. Second operand 9 states. [2019-09-10 06:56:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:37,888 INFO L93 Difference]: Finished difference Result 43451 states and 59012 transitions. [2019-09-10 06:56:37,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:56:37,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 06:56:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:37,930 INFO L225 Difference]: With dead ends: 43451 [2019-09-10 06:56:37,930 INFO L226 Difference]: Without dead ends: 43451 [2019-09-10 06:56:37,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:56:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43451 states. [2019-09-10 06:56:38,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43451 to 14924. [2019-09-10 06:56:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14924 states. [2019-09-10 06:56:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14924 states to 14924 states and 20041 transitions. [2019-09-10 06:56:38,257 INFO L78 Accepts]: Start accepts. Automaton has 14924 states and 20041 transitions. Word has length 80 [2019-09-10 06:56:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:38,257 INFO L475 AbstractCegarLoop]: Abstraction has 14924 states and 20041 transitions. [2019-09-10 06:56:38,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:56:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 14924 states and 20041 transitions. [2019-09-10 06:56:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:56:38,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:38,262 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:38,262 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:38,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash -781067770, now seen corresponding path program 1 times [2019-09-10 06:56:38,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:38,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:38,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:39,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:39,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:56:39,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:39,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:56:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:56:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:56:39,709 INFO L87 Difference]: Start difference. First operand 14924 states and 20041 transitions. Second operand 23 states. [2019-09-10 06:56:40,741 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 06:56:41,017 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-10 06:56:41,372 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 06:56:41,871 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 06:56:42,179 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 06:56:42,707 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 06:56:42,982 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 06:56:43,320 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 06:56:43,592 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 06:56:43,845 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 06:56:44,288 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 06:56:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:46,492 INFO L93 Difference]: Finished difference Result 18862 states and 25315 transitions. [2019-09-10 06:56:46,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:56:46,492 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 82 [2019-09-10 06:56:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:46,512 INFO L225 Difference]: With dead ends: 18862 [2019-09-10 06:56:46,512 INFO L226 Difference]: Without dead ends: 18862 [2019-09-10 06:56:46,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=412, Invalid=1310, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:56:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2019-09-10 06:56:46,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 14916. [2019-09-10 06:56:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14916 states. [2019-09-10 06:56:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14916 states to 14916 states and 20027 transitions. [2019-09-10 06:56:46,639 INFO L78 Accepts]: Start accepts. Automaton has 14916 states and 20027 transitions. Word has length 82 [2019-09-10 06:56:46,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:46,640 INFO L475 AbstractCegarLoop]: Abstraction has 14916 states and 20027 transitions. [2019-09-10 06:56:46,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:56:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 14916 states and 20027 transitions. [2019-09-10 06:56:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:56:46,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:46,645 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:46,645 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:46,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:46,645 INFO L82 PathProgramCache]: Analyzing trace with hash -472721266, now seen corresponding path program 1 times [2019-09-10 06:56:46,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:46,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:46,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:46,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:46,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:47,362 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 06:56:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:47,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:47,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:56:47,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:47,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:56:47,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:56:47,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:56:47,988 INFO L87 Difference]: Start difference. First operand 14916 states and 20027 transitions. Second operand 22 states. [2019-09-10 06:56:48,132 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 06:56:48,872 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 06:56:49,193 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 06:56:49,450 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-09-10 06:56:49,787 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-09-10 06:56:50,590 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 80 [2019-09-10 06:56:50,966 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-10 06:56:51,237 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 06:56:51,532 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 06:56:52,136 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 06:56:52,420 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 06:56:52,681 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 06:56:53,140 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 06:56:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:56,673 INFO L93 Difference]: Finished difference Result 27583 states and 37066 transitions. [2019-09-10 06:56:56,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:56:56,674 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 83 [2019-09-10 06:56:56,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:56,699 INFO L225 Difference]: With dead ends: 27583 [2019-09-10 06:56:56,699 INFO L226 Difference]: Without dead ends: 27583 [2019-09-10 06:56:56,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=447, Invalid=1445, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 06:56:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27583 states. [2019-09-10 06:56:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27583 to 14887. [2019-09-10 06:56:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14887 states. [2019-09-10 06:56:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14887 states to 14887 states and 19991 transitions. [2019-09-10 06:56:56,841 INFO L78 Accepts]: Start accepts. Automaton has 14887 states and 19991 transitions. Word has length 83 [2019-09-10 06:56:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:56,841 INFO L475 AbstractCegarLoop]: Abstraction has 14887 states and 19991 transitions. [2019-09-10 06:56:56,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:56:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 14887 states and 19991 transitions. [2019-09-10 06:56:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:56:56,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:56,846 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:56,846 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:56,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:56,846 INFO L82 PathProgramCache]: Analyzing trace with hash -615226109, now seen corresponding path program 1 times [2019-09-10 06:56:56,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:56,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:56,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:57,391 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 06:56:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:57,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:57,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:56:57,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:57,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:56:57,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:56:57,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:56:57,686 INFO L87 Difference]: Start difference. First operand 14887 states and 19991 transitions. Second operand 14 states. [2019-09-10 06:56:58,074 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 06:56:58,285 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 06:56:58,517 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 06:56:58,840 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 06:56:59,043 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:56:59,294 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:56:59,861 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 06:57:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:00,560 INFO L93 Difference]: Finished difference Result 32503 states and 43928 transitions. [2019-09-10 06:57:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:57:00,560 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2019-09-10 06:57:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:00,591 INFO L225 Difference]: With dead ends: 32503 [2019-09-10 06:57:00,592 INFO L226 Difference]: Without dead ends: 32503 [2019-09-10 06:57:00,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:57:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32503 states. [2019-09-10 06:57:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32503 to 14841. [2019-09-10 06:57:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14841 states. [2019-09-10 06:57:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14841 states to 14841 states and 19933 transitions. [2019-09-10 06:57:00,877 INFO L78 Accepts]: Start accepts. Automaton has 14841 states and 19933 transitions. Word has length 83 [2019-09-10 06:57:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:00,877 INFO L475 AbstractCegarLoop]: Abstraction has 14841 states and 19933 transitions. [2019-09-10 06:57:00,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:57:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 14841 states and 19933 transitions. [2019-09-10 06:57:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:57:00,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:00,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:00,882 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:00,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:00,883 INFO L82 PathProgramCache]: Analyzing trace with hash 316359790, now seen corresponding path program 1 times [2019-09-10 06:57:00,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:00,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:00,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:00,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:00,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:01,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:01,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:57:01,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:01,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:57:01,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:57:01,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:57:01,786 INFO L87 Difference]: Start difference. First operand 14841 states and 19933 transitions. Second operand 18 states. [2019-09-10 06:57:02,433 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 06:57:02,664 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 06:57:02,942 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 06:57:03,228 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:57:03,538 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 06:57:03,895 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:57:04,192 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:57:04,366 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:57:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:05,700 INFO L93 Difference]: Finished difference Result 29047 states and 39243 transitions. [2019-09-10 06:57:05,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:57:05,701 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 83 [2019-09-10 06:57:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:05,728 INFO L225 Difference]: With dead ends: 29047 [2019-09-10 06:57:05,728 INFO L226 Difference]: Without dead ends: 29047 [2019-09-10 06:57:05,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:57:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29047 states. [2019-09-10 06:57:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29047 to 14810. [2019-09-10 06:57:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14810 states. [2019-09-10 06:57:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14810 states to 14810 states and 19896 transitions. [2019-09-10 06:57:05,893 INFO L78 Accepts]: Start accepts. Automaton has 14810 states and 19896 transitions. Word has length 83 [2019-09-10 06:57:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:05,894 INFO L475 AbstractCegarLoop]: Abstraction has 14810 states and 19896 transitions. [2019-09-10 06:57:05,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:57:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 14810 states and 19896 transitions. [2019-09-10 06:57:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:57:05,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:05,900 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:05,900 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:05,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:05,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1671863119, now seen corresponding path program 1 times [2019-09-10 06:57:05,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:05,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:05,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:05,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:05,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:06,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:06,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:57:06,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:06,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:57:06,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:57:06,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:57:06,269 INFO L87 Difference]: Start difference. First operand 14810 states and 19896 transitions. Second operand 11 states. [2019-09-10 06:57:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:07,460 INFO L93 Difference]: Finished difference Result 28619 states and 38695 transitions. [2019-09-10 06:57:07,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:57:07,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2019-09-10 06:57:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:07,495 INFO L225 Difference]: With dead ends: 28619 [2019-09-10 06:57:07,495 INFO L226 Difference]: Without dead ends: 28619 [2019-09-10 06:57:07,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:57:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28619 states. [2019-09-10 06:57:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28619 to 14807. [2019-09-10 06:57:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14807 states. [2019-09-10 06:57:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14807 states to 14807 states and 19890 transitions. [2019-09-10 06:57:07,678 INFO L78 Accepts]: Start accepts. Automaton has 14807 states and 19890 transitions. Word has length 84 [2019-09-10 06:57:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:07,678 INFO L475 AbstractCegarLoop]: Abstraction has 14807 states and 19890 transitions. [2019-09-10 06:57:07,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:57:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 14807 states and 19890 transitions. [2019-09-10 06:57:07,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:57:07,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:07,683 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] [2019-09-10 06:57:07,683 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:07,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:07,684 INFO L82 PathProgramCache]: Analyzing trace with hash -768344913, now seen corresponding path program 1 times [2019-09-10 06:57:07,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:07,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:07,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:07,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:08,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:08,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:57:08,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:08,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:57:08,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:57:08,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:57:08,332 INFO L87 Difference]: Start difference. First operand 14807 states and 19890 transitions. Second operand 13 states. [2019-09-10 06:57:09,182 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:57:09,425 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 06:57:09,734 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:57:09,984 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:57:10,216 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:57:10,410 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 06:57:10,746 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 06:57:10,975 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:57:11,424 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:57:11,733 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 06:57:11,916 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 06:57:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:12,433 INFO L93 Difference]: Finished difference Result 60242 states and 81735 transitions. [2019-09-10 06:57:12,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:57:12,433 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2019-09-10 06:57:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:12,483 INFO L225 Difference]: With dead ends: 60242 [2019-09-10 06:57:12,484 INFO L226 Difference]: Without dead ends: 60242 [2019-09-10 06:57:12,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=267, Invalid=725, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:57:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60242 states. [2019-09-10 06:57:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60242 to 14726. [2019-09-10 06:57:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14726 states. [2019-09-10 06:57:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14726 states to 14726 states and 19797 transitions. [2019-09-10 06:57:12,726 INFO L78 Accepts]: Start accepts. Automaton has 14726 states and 19797 transitions. Word has length 84 [2019-09-10 06:57:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:12,727 INFO L475 AbstractCegarLoop]: Abstraction has 14726 states and 19797 transitions. [2019-09-10 06:57:12,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:57:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 14726 states and 19797 transitions. [2019-09-10 06:57:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:57:12,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:12,731 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] [2019-09-10 06:57:12,731 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:12,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:12,731 INFO L82 PathProgramCache]: Analyzing trace with hash 359639667, now seen corresponding path program 1 times [2019-09-10 06:57:12,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:12,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:12,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:12,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:12,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:13,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:13,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:57:13,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:13,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:57:13,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:57:13,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:57:13,111 INFO L87 Difference]: Start difference. First operand 14726 states and 19797 transitions. Second operand 11 states. [2019-09-10 06:57:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:14,371 INFO L93 Difference]: Finished difference Result 34178 states and 46327 transitions. [2019-09-10 06:57:14,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:57:14,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2019-09-10 06:57:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:14,400 INFO L225 Difference]: With dead ends: 34178 [2019-09-10 06:57:14,400 INFO L226 Difference]: Without dead ends: 34178 [2019-09-10 06:57:14,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:57:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34178 states. [2019-09-10 06:57:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34178 to 14725. [2019-09-10 06:57:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14725 states. [2019-09-10 06:57:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14725 states to 14725 states and 19795 transitions. [2019-09-10 06:57:14,561 INFO L78 Accepts]: Start accepts. Automaton has 14725 states and 19795 transitions. Word has length 84 [2019-09-10 06:57:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:14,561 INFO L475 AbstractCegarLoop]: Abstraction has 14725 states and 19795 transitions. [2019-09-10 06:57:14,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:57:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 14725 states and 19795 transitions. [2019-09-10 06:57:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 06:57:14,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:14,567 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] [2019-09-10 06:57:14,567 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1115241070, now seen corresponding path program 1 times [2019-09-10 06:57:14,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:14,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:14,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:14,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:14,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:14,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:14,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:57:14,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:14,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:57:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:57:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:57:14,653 INFO L87 Difference]: Start difference. First operand 14725 states and 19795 transitions. Second operand 7 states. [2019-09-10 06:57:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:15,016 INFO L93 Difference]: Finished difference Result 73815 states and 98875 transitions. [2019-09-10 06:57:15,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:57:15,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 06:57:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:15,089 INFO L225 Difference]: With dead ends: 73815 [2019-09-10 06:57:15,090 INFO L226 Difference]: Without dead ends: 73815 [2019-09-10 06:57:15,090 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 06:57:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73815 states. [2019-09-10 06:57:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73815 to 46806. [2019-09-10 06:57:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46806 states. [2019-09-10 06:57:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46806 states to 46806 states and 62529 transitions. [2019-09-10 06:57:15,541 INFO L78 Accepts]: Start accepts. Automaton has 46806 states and 62529 transitions. Word has length 89 [2019-09-10 06:57:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:15,541 INFO L475 AbstractCegarLoop]: Abstraction has 46806 states and 62529 transitions. [2019-09-10 06:57:15,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:57:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 46806 states and 62529 transitions. [2019-09-10 06:57:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 06:57:15,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:15,551 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 06:57:15,551 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:15,551 INFO L82 PathProgramCache]: Analyzing trace with hash -476274046, now seen corresponding path program 1 times [2019-09-10 06:57:15,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:15,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:15,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:15,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:15,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:15,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:15,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:15,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:15,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:15,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:15,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:15,680 INFO L87 Difference]: Start difference. First operand 46806 states and 62529 transitions. Second operand 6 states. [2019-09-10 06:57:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:16,006 INFO L93 Difference]: Finished difference Result 45474 states and 60807 transitions. [2019-09-10 06:57:16,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:57:16,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-10 06:57:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:16,043 INFO L225 Difference]: With dead ends: 45474 [2019-09-10 06:57:16,043 INFO L226 Difference]: Without dead ends: 45474 [2019-09-10 06:57:16,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 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 06:57:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45474 states. [2019-09-10 06:57:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45474 to 45468. [2019-09-10 06:57:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45468 states. [2019-09-10 06:57:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45468 states to 45468 states and 60804 transitions. [2019-09-10 06:57:17,460 INFO L78 Accepts]: Start accepts. Automaton has 45468 states and 60804 transitions. Word has length 90 [2019-09-10 06:57:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:17,460 INFO L475 AbstractCegarLoop]: Abstraction has 45468 states and 60804 transitions. [2019-09-10 06:57:17,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 45468 states and 60804 transitions. [2019-09-10 06:57:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 06:57:17,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:17,473 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 06:57:17,473 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:17,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:17,474 INFO L82 PathProgramCache]: Analyzing trace with hash 60582762, now seen corresponding path program 1 times [2019-09-10 06:57:17,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:17,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:17,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:17,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:17,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:17,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:17,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:17,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:17,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:17,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:17,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:17,555 INFO L87 Difference]: Start difference. First operand 45468 states and 60804 transitions. Second operand 6 states. [2019-09-10 06:57:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:17,833 INFO L93 Difference]: Finished difference Result 88115 states and 116353 transitions. [2019-09-10 06:57:17,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:57:17,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-10 06:57:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:17,926 INFO L225 Difference]: With dead ends: 88115 [2019-09-10 06:57:17,926 INFO L226 Difference]: Without dead ends: 88115 [2019-09-10 06:57:17,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:57:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88115 states. [2019-09-10 06:57:18,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88115 to 46383. [2019-09-10 06:57:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46383 states. [2019-09-10 06:57:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46383 states to 46383 states and 61414 transitions. [2019-09-10 06:57:18,477 INFO L78 Accepts]: Start accepts. Automaton has 46383 states and 61414 transitions. Word has length 91 [2019-09-10 06:57:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:18,477 INFO L475 AbstractCegarLoop]: Abstraction has 46383 states and 61414 transitions. [2019-09-10 06:57:18,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 46383 states and 61414 transitions. [2019-09-10 06:57:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 06:57:18,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:18,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:18,489 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:18,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:18,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2000455885, now seen corresponding path program 1 times [2019-09-10 06:57:18,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:18,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:18,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:18,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:18,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:18,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:18,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:18,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:18,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:18,539 INFO L87 Difference]: Start difference. First operand 46383 states and 61414 transitions. Second operand 3 states. [2019-09-10 06:57:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:18,710 INFO L93 Difference]: Finished difference Result 84385 states and 110897 transitions. [2019-09-10 06:57:18,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:18,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 06:57:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:18,797 INFO L225 Difference]: With dead ends: 84385 [2019-09-10 06:57:18,797 INFO L226 Difference]: Without dead ends: 84385 [2019-09-10 06:57:18,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84385 states. [2019-09-10 06:57:19,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84385 to 84383. [2019-09-10 06:57:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84383 states. [2019-09-10 06:57:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84383 states to 84383 states and 110896 transitions. [2019-09-10 06:57:19,439 INFO L78 Accepts]: Start accepts. Automaton has 84383 states and 110896 transitions. Word has length 92 [2019-09-10 06:57:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:19,439 INFO L475 AbstractCegarLoop]: Abstraction has 84383 states and 110896 transitions. [2019-09-10 06:57:19,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 84383 states and 110896 transitions. [2019-09-10 06:57:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 06:57:19,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:19,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:19,456 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:19,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:19,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2068249240, now seen corresponding path program 1 times [2019-09-10 06:57:19,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:19,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:19,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:19,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:19,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:19,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:19,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:19,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:19,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:19,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:19,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:19,510 INFO L87 Difference]: Start difference. First operand 84383 states and 110896 transitions. Second operand 3 states. [2019-09-10 06:57:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:19,845 INFO L93 Difference]: Finished difference Result 161343 states and 209192 transitions. [2019-09-10 06:57:19,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:19,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 06:57:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:20,005 INFO L225 Difference]: With dead ends: 161343 [2019-09-10 06:57:20,005 INFO L226 Difference]: Without dead ends: 161343 [2019-09-10 06:57:20,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161343 states. [2019-09-10 06:57:22,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161343 to 152643. [2019-09-10 06:57:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152643 states. [2019-09-10 06:57:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152643 states to 152643 states and 198653 transitions. [2019-09-10 06:57:23,174 INFO L78 Accepts]: Start accepts. Automaton has 152643 states and 198653 transitions. Word has length 92 [2019-09-10 06:57:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:23,174 INFO L475 AbstractCegarLoop]: Abstraction has 152643 states and 198653 transitions. [2019-09-10 06:57:23,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 152643 states and 198653 transitions. [2019-09-10 06:57:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:57:23,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:23,192 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 06:57:23,192 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:23,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:23,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1900652373, now seen corresponding path program 1 times [2019-09-10 06:57:23,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:23,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:23,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:23,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:23,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:23,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:23,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:23,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:23,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:23,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:23,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:23,247 INFO L87 Difference]: Start difference. First operand 152643 states and 198653 transitions. Second operand 3 states. [2019-09-10 06:57:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:23,725 INFO L93 Difference]: Finished difference Result 240447 states and 308226 transitions. [2019-09-10 06:57:23,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:23,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 06:57:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:23,994 INFO L225 Difference]: With dead ends: 240447 [2019-09-10 06:57:23,994 INFO L226 Difference]: Without dead ends: 240447 [2019-09-10 06:57:23,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:24,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240447 states. [2019-09-10 06:57:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240447 to 228145. [2019-09-10 06:57:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228145 states. [2019-09-10 06:57:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228145 states to 228145 states and 294275 transitions. [2019-09-10 06:57:28,977 INFO L78 Accepts]: Start accepts. Automaton has 228145 states and 294275 transitions. Word has length 93 [2019-09-10 06:57:28,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:28,977 INFO L475 AbstractCegarLoop]: Abstraction has 228145 states and 294275 transitions. [2019-09-10 06:57:28,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:28,977 INFO L276 IsEmpty]: Start isEmpty. Operand 228145 states and 294275 transitions. [2019-09-10 06:57:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:57:28,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:28,984 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 06:57:28,985 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:28,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1353194803, now seen corresponding path program 1 times [2019-09-10 06:57:28,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:28,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:28,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:28,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:28,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:29,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:29,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:57:29,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:29,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:57:29,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:57:29,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:57:29,050 INFO L87 Difference]: Start difference. First operand 228145 states and 294275 transitions. Second operand 5 states. [2019-09-10 06:57:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:30,151 INFO L93 Difference]: Finished difference Result 336894 states and 425125 transitions. [2019-09-10 06:57:30,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:57:30,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-10 06:57:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:30,531 INFO L225 Difference]: With dead ends: 336894 [2019-09-10 06:57:30,531 INFO L226 Difference]: Without dead ends: 336894 [2019-09-10 06:57:30,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:57:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336894 states. [2019-09-10 06:57:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336894 to 202418. [2019-09-10 06:57:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202418 states. [2019-09-10 06:57:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202418 states to 202418 states and 255816 transitions. [2019-09-10 06:57:37,047 INFO L78 Accepts]: Start accepts. Automaton has 202418 states and 255816 transitions. Word has length 94 [2019-09-10 06:57:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:37,047 INFO L475 AbstractCegarLoop]: Abstraction has 202418 states and 255816 transitions. [2019-09-10 06:57:37,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:57:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 202418 states and 255816 transitions. [2019-09-10 06:57:37,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:57:37,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:37,055 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:37,055 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:37,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:37,055 INFO L82 PathProgramCache]: Analyzing trace with hash 462048920, now seen corresponding path program 1 times [2019-09-10 06:57:37,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:37,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:37,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:37,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:37,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:37,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:37,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:57:37,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:37,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:57:37,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:57:37,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:57:37,120 INFO L87 Difference]: Start difference. First operand 202418 states and 255816 transitions. Second operand 5 states. [2019-09-10 06:57:43,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:43,638 INFO L93 Difference]: Finished difference Result 684019 states and 849675 transitions. [2019-09-10 06:57:43,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:57:43,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-10 06:57:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:44,554 INFO L225 Difference]: With dead ends: 684019 [2019-09-10 06:57:44,555 INFO L226 Difference]: Without dead ends: 684019 [2019-09-10 06:57:44,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:57:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684019 states. [2019-09-10 06:57:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684019 to 383303. [2019-09-10 06:57:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383303 states. [2019-09-10 06:57:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383303 states to 383303 states and 483949 transitions. [2019-09-10 06:57:49,654 INFO L78 Accepts]: Start accepts. Automaton has 383303 states and 483949 transitions. Word has length 94 [2019-09-10 06:57:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:49,654 INFO L475 AbstractCegarLoop]: Abstraction has 383303 states and 483949 transitions. [2019-09-10 06:57:49,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:57:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 383303 states and 483949 transitions. [2019-09-10 06:57:49,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 06:57:49,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:49,686 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:49,687 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:49,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:49,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1021239522, now seen corresponding path program 1 times [2019-09-10 06:57:49,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:49,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:49,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:49,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:49,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 06:57:49,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:49,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:49,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:49,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:49,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:49,753 INFO L87 Difference]: Start difference. First operand 383303 states and 483949 transitions. Second operand 3 states. [2019-09-10 06:57:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:50,604 INFO L93 Difference]: Finished difference Result 400520 states and 495639 transitions. [2019-09-10 06:57:50,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:50,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-10 06:57:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:56,836 INFO L225 Difference]: With dead ends: 400520 [2019-09-10 06:57:56,836 INFO L226 Difference]: Without dead ends: 400520 [2019-09-10 06:57:56,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400520 states. [2019-09-10 06:57:59,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400520 to 386412. [2019-09-10 06:57:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386412 states. [2019-09-10 06:58:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386412 states to 386412 states and 481532 transitions. [2019-09-10 06:58:00,873 INFO L78 Accepts]: Start accepts. Automaton has 386412 states and 481532 transitions. Word has length 119 [2019-09-10 06:58:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:00,874 INFO L475 AbstractCegarLoop]: Abstraction has 386412 states and 481532 transitions. [2019-09-10 06:58:00,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 386412 states and 481532 transitions. [2019-09-10 06:58:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:58:00,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:00,899 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:00,899 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:00,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2028140461, now seen corresponding path program 1 times [2019-09-10 06:58:00,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:00,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:00,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 06:58:00,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:00,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:00,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:00,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:00,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:00,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:00,966 INFO L87 Difference]: Start difference. First operand 386412 states and 481532 transitions. Second operand 3 states. [2019-09-10 06:58:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:02,506 INFO L93 Difference]: Finished difference Result 738574 states and 901381 transitions. [2019-09-10 06:58:02,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:02,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 06:58:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:05,225 INFO L225 Difference]: With dead ends: 738574 [2019-09-10 06:58:05,226 INFO L226 Difference]: Without dead ends: 738574 [2019-09-10 06:58:05,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738574 states. [2019-09-10 06:58:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738574 to 665834. [2019-09-10 06:58:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665834 states. [2019-09-10 06:58:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665834 states to 665834 states and 816084 transitions. [2019-09-10 06:58:25,503 INFO L78 Accepts]: Start accepts. Automaton has 665834 states and 816084 transitions. Word has length 120 [2019-09-10 06:58:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:25,503 INFO L475 AbstractCegarLoop]: Abstraction has 665834 states and 816084 transitions. [2019-09-10 06:58:25,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 665834 states and 816084 transitions. [2019-09-10 06:58:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 06:58:25,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:25,536 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:25,537 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:25,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash -430965089, now seen corresponding path program 1 times [2019-09-10 06:58:25,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:25,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:25,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:25,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:25,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:58:25,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:58:25,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:58:25,672 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2019-09-10 06:58:25,674 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], [150], [153], [156], [169], [172], [185], [188], [201], [204], [217], [220], [223], [227], [229], [232], [235], [246], [248], [251], [262], [264], [267], [278], [280], [283], [294], [296], [298], [300], [303], [306], [308], [310], [313], [314], [316], [318], [320], [325], [338], [340], [353], [361], [380], [391], [393], [406], [414], [433], [444], [446], [449], [452], [455], [457], [459], [497], [499], [512], [520], [546], [602], [718], [990], [1824], [1828], [1831], [1834], [1837], [1839], [1843], [1981], [2059], [2063], [2093], [2109], [2112], [2115], [2119], [2735], [2736], [2740], [2741], [2742] [2019-09-10 06:58:25,720 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:58:25,720 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:58:25,905 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:58:26,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:58:26,566 INFO L272 AbstractInterpreter]: Visited 112 different actions 583 times. Merged at 47 different actions 417 times. Widened at 17 different actions 62 times. Performed 2184 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2184 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 55 fixpoints after 17 different actions. Largest state had 273 variables. [2019-09-10 06:58:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:26,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:58:26,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:58:26,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:58:26,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:26,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:58:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:26,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:58:26,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:58:26,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:27,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:58:27,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:58:27,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:58:27,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 21 [2019-09-10 06:58:27,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:58:27,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:58:27,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:58:27,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:58:27,651 INFO L87 Difference]: Start difference. First operand 665834 states and 816084 transitions. Second operand 13 states. [2019-09-10 06:58:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:46,870 INFO L93 Difference]: Finished difference Result 1574065 states and 1913090 transitions. [2019-09-10 06:58:46,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 06:58:46,870 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2019-09-10 06:58:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:50,770 INFO L225 Difference]: With dead ends: 1574065 [2019-09-10 06:58:50,770 INFO L226 Difference]: Without dead ends: 1574065 [2019-09-10 06:58:50,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2060 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1524, Invalid=5118, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 06:58:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574065 states. [2019-09-10 06:59:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574065 to 1133415. [2019-09-10 06:59:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133415 states. [2019-09-10 06:59:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133415 states to 1133415 states and 1392205 transitions. [2019-09-10 06:59:29,521 INFO L78 Accepts]: Start accepts. Automaton has 1133415 states and 1392205 transitions. Word has length 123 [2019-09-10 06:59:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:29,522 INFO L475 AbstractCegarLoop]: Abstraction has 1133415 states and 1392205 transitions. [2019-09-10 06:59:29,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:59:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1133415 states and 1392205 transitions. [2019-09-10 06:59:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 06:59:29,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:29,644 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:29,645 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:29,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1091464389, now seen corresponding path program 1 times [2019-09-10 06:59:29,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:29,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:29,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:29,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:29,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:59:29,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:29,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:59:29,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:29,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:59:29,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:59:29,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:59:29,771 INFO L87 Difference]: Start difference. First operand 1133415 states and 1392205 transitions. Second operand 6 states. [2019-09-10 06:59:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:44,146 INFO L93 Difference]: Finished difference Result 1866429 states and 2289005 transitions. [2019-09-10 06:59:44,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:59:44,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-10 06:59:44,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:48,333 INFO L225 Difference]: With dead ends: 1866429 [2019-09-10 06:59:48,334 INFO L226 Difference]: Without dead ends: 1866429 [2019-09-10 06:59:48,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:49,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866429 states. [2019-09-10 07:00:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866429 to 1316567. [2019-09-10 07:00:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316567 states. [2019-09-10 07:00:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316567 states to 1316567 states and 1615717 transitions. [2019-09-10 07:00:35,318 INFO L78 Accepts]: Start accepts. Automaton has 1316567 states and 1615717 transitions. Word has length 127 [2019-09-10 07:00:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:35,318 INFO L475 AbstractCegarLoop]: Abstraction has 1316567 states and 1615717 transitions. [2019-09-10 07:00:35,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:00:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1316567 states and 1615717 transitions. [2019-09-10 07:00:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:00:35,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:35,361 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, 1, 1] [2019-09-10 07:00:35,361 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:35,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1970762160, now seen corresponding path program 1 times [2019-09-10 07:00:35,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:35,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:35,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:35,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:35,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:00:35,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:00:35,443 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 07:00:35,444 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], [150], [153], [156], [169], [172], [185], [188], [201], [204], [217], [220], [223], [227], [229], [232], [235], [238], [241], [246], [248], [251], [262], [264], [267], [278], [280], [283], [294], [296], [298], [300], [303], [306], [308], [310], [313], [314], [316], [318], [327], [338], [340], [353], [361], [380], [391], [393], [406], [414], [433], [444], [446], [459], [467], [486], [488], [491], [499], [502], [505], [508], [510], [512], [546], [602], [718], [990], [1521], [1535], [1539], [1677], [1755], [1759], [1789], [1805], [1808], [1811], [1815], [1819], [2735], [2736], [2740], [2741], [2742] [2019-09-10 07:00:35,449 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:00:35,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:00:35,508 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:00:35,855 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:00:35,856 INFO L272 AbstractInterpreter]: Visited 112 different actions 453 times. Merged at 42 different actions 295 times. Widened at 15 different actions 38 times. Performed 1792 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1792 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 8 different actions. Largest state had 273 variables. [2019-09-10 07:00:35,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:35,856 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:00:36,509 INFO L227 lantSequenceWeakener]: Weakened 97 states. On average, predicates are now at 91.74% of their original sizes. [2019-09-10 07:00:36,509 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:00:48,642 INFO L420 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2019-09-10 07:00:48,642 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:00:48,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:00:48,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [75] imperfect sequences [5] total 78 [2019-09-10 07:00:48,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:48,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-10 07:00:48,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-10 07:00:48,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=4998, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 07:00:48,645 INFO L87 Difference]: Start difference. First operand 1316567 states and 1615717 transitions. Second operand 75 states.