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.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:26:54,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:26:54,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:26:54,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:26:54,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:26:54,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:26:54,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:26:54,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:26:54,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:26:54,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:26:54,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:26:54,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:26:54,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:26:54,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:26:54,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:26:54,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:26:54,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:26:54,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:26:54,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:26:54,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:26:54,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:26:54,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:26:54,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:26:54,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:26:54,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:26:54,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:26:54,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:26:54,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:26:54,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:26:54,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:26:54,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:26:54,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:26:54,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:26:54,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:26:54,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:26:54,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:26:54,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:26:54,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:26:54,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:26:54,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:26:54,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:26:54,654 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 08:26:54,669 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:26:54,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:26:54,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:26:54,669 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:26:54,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:26:54,670 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:26:54,670 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:26:54,671 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:26:54,671 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:26:54,671 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:26:54,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:26:54,672 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:26:54,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:26:54,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:26:54,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:26:54,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:26:54,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:26:54,673 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:26:54,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:26:54,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:26:54,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:26:54,674 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:26:54,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:26:54,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:26:54,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:26:54,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:26:54,675 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:26:54,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:26:54,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:26:54,675 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:26:54,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:26:54,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:26:54,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:26:54,727 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:26:54,727 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:26:54,728 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:26:54,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9e7d9be/a77ab82a54f449aab55a20e3587d0a74/FLAG5e35e7d2a [2019-09-10 08:26:55,364 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:26:55,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:26:55,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9e7d9be/a77ab82a54f449aab55a20e3587d0a74/FLAG5e35e7d2a [2019-09-10 08:26:55,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9e7d9be/a77ab82a54f449aab55a20e3587d0a74 [2019-09-10 08:26:55,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:26:55,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:26:55,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:26:55,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:26:55,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:26:55,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:26:55" (1/1) ... [2019-09-10 08:26:55,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7ecedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:55, skipping insertion in model container [2019-09-10 08:26:55,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:26:55" (1/1) ... [2019-09-10 08:26:55,680 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:26:55,760 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:26:56,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:26:56,388 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:26:56,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:26:56,549 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:26:56,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:56 WrapperNode [2019-09-10 08:26:56,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:26:56,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:26:56,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:26:56,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:26:56,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:56" (1/1) ... [2019-09-10 08:26:56,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:56" (1/1) ... [2019-09-10 08:26:56,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:56" (1/1) ... [2019-09-10 08:26:56,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:56" (1/1) ... [2019-09-10 08:26:56,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:56" (1/1) ... [2019-09-10 08:26:56,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:56" (1/1) ... [2019-09-10 08:26:56,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:56" (1/1) ... [2019-09-10 08:26:56,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:26:56,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:26:56,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:26:56,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:26:56,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:26:56,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:26:56,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:26:56,721 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:26:56,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:26:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:26:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:26:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:26:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:26:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:26:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:26:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:26:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:26:56,723 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:26:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:26:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:26:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:26:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:26:56,724 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:26:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:26:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:26:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:26:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:26:56,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:26:57,902 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:26:57,902 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:26:57,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:26:57 BoogieIcfgContainer [2019-09-10 08:26:57,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:26:57,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:26:57,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:26:57,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:26:57,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:26:55" (1/3) ... [2019-09-10 08:26:57,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e739748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:26:57, skipping insertion in model container [2019-09-10 08:26:57,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:56" (2/3) ... [2019-09-10 08:26:57,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e739748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:26:57, skipping insertion in model container [2019-09-10 08:26:57,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:26:57" (3/3) ... [2019-09-10 08:26:57,911 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:26:57,923 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:26:57,943 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:26:57,959 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:26:57,984 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:26:57,984 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:26:57,984 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:26:57,984 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:26:57,984 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:26:57,984 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:26:57,985 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:26:57,985 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:26:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-09-10 08:26:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:26:58,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:58,023 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:58,025 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:58,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:58,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1579256941, now seen corresponding path program 1 times [2019-09-10 08:26:58,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:58,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:58,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:58,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:58,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:58,551 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 08:26:58,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:58,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:26:58,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:58,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:26:58,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:26:58,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:26:58,577 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2019-09-10 08:26:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:58,733 INFO L93 Difference]: Finished difference Result 313 states and 524 transitions. [2019-09-10 08:26:58,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:26:58,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:26:58,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:58,750 INFO L225 Difference]: With dead ends: 313 [2019-09-10 08:26:58,750 INFO L226 Difference]: Without dead ends: 305 [2019-09-10 08:26:58,752 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 08:26:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-10 08:26:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2019-09-10 08:26:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-10 08:26:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 435 transitions. [2019-09-10 08:26:58,842 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 435 transitions. Word has length 111 [2019-09-10 08:26:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:58,843 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 435 transitions. [2019-09-10 08:26:58,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:26:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 435 transitions. [2019-09-10 08:26:58,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:26:58,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:58,847 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:58,847 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:58,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:58,848 INFO L82 PathProgramCache]: Analyzing trace with hash -529337958, now seen corresponding path program 1 times [2019-09-10 08:26:58,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:58,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:58,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:58,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:58,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:59,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 08:26:59,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:59,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:26:59,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:59,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:26:59,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:26:59,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:26:59,101 INFO L87 Difference]: Start difference. First operand 303 states and 435 transitions. Second operand 5 states. [2019-09-10 08:26:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:59,556 INFO L93 Difference]: Finished difference Result 506 states and 754 transitions. [2019-09-10 08:26:59,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:26:59,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:26:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:59,563 INFO L225 Difference]: With dead ends: 506 [2019-09-10 08:26:59,563 INFO L226 Difference]: Without dead ends: 506 [2019-09-10 08:26:59,564 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 08:26:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-10 08:26:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-09-10 08:26:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-10 08:26:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 753 transitions. [2019-09-10 08:26:59,610 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 753 transitions. Word has length 113 [2019-09-10 08:26:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:59,611 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 753 transitions. [2019-09-10 08:26:59,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:26:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 753 transitions. [2019-09-10 08:26:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:26:59,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:59,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:59,621 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:59,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1399262783, now seen corresponding path program 1 times [2019-09-10 08:26:59,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:59,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:59,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:59,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:59,846 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 08:26:59,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:59,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:26:59,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:59,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:26:59,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:26:59,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:26:59,848 INFO L87 Difference]: Start difference. First operand 504 states and 753 transitions. Second operand 5 states. [2019-09-10 08:27:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:00,083 INFO L93 Difference]: Finished difference Result 504 states and 748 transitions. [2019-09-10 08:27:00,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:27:00,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-10 08:27:00,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:00,089 INFO L225 Difference]: With dead ends: 504 [2019-09-10 08:27:00,089 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 08:27:00,090 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 08:27:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 08:27:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-10 08:27:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-10 08:27:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 748 transitions. [2019-09-10 08:27:00,107 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 748 transitions. Word has length 114 [2019-09-10 08:27:00,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:00,109 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 748 transitions. [2019-09-10 08:27:00,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:27:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 748 transitions. [2019-09-10 08:27:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:00,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:00,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:00,116 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:00,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:00,116 INFO L82 PathProgramCache]: Analyzing trace with hash -360394647, now seen corresponding path program 1 times [2019-09-10 08:27:00,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:00,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:00,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:00,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:00,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:00,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:00,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:27:00,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:00,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:27:00,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:27:00,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:27:00,331 INFO L87 Difference]: Start difference. First operand 504 states and 748 transitions. Second operand 5 states. [2019-09-10 08:27:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:00,538 INFO L93 Difference]: Finished difference Result 504 states and 743 transitions. [2019-09-10 08:27:00,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:27:00,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-09-10 08:27:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:00,542 INFO L225 Difference]: With dead ends: 504 [2019-09-10 08:27:00,542 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 08:27:00,543 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 08:27:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 08:27:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-10 08:27:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-10 08:27:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 743 transitions. [2019-09-10 08:27:00,558 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 743 transitions. Word has length 115 [2019-09-10 08:27:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:00,559 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 743 transitions. [2019-09-10 08:27:00,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:27:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 743 transitions. [2019-09-10 08:27:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:27:00,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:00,561 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:00,561 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:00,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash -72559888, now seen corresponding path program 1 times [2019-09-10 08:27:00,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:00,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:00,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:00,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:00,699 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 08:27:00,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:00,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:27:00,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:00,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:27:00,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:27:00,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:27:00,702 INFO L87 Difference]: Start difference. First operand 504 states and 743 transitions. Second operand 5 states. [2019-09-10 08:27:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:00,889 INFO L93 Difference]: Finished difference Result 504 states and 738 transitions. [2019-09-10 08:27:00,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:27:00,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-10 08:27:00,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:00,892 INFO L225 Difference]: With dead ends: 504 [2019-09-10 08:27:00,892 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 08:27:00,892 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 08:27:00,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 08:27:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-10 08:27:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-10 08:27:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 738 transitions. [2019-09-10 08:27:00,906 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 738 transitions. Word has length 116 [2019-09-10 08:27:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:00,906 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 738 transitions. [2019-09-10 08:27:00,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:27:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 738 transitions. [2019-09-10 08:27:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:27:00,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:00,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:00,909 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1918050182, now seen corresponding path program 1 times [2019-09-10 08:27:00,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:00,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:00,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:00,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:00,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:01,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 08:27:01,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:01,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:27:01,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:01,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:27:01,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:27:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:27:01,050 INFO L87 Difference]: Start difference. First operand 504 states and 738 transitions. Second operand 5 states. [2019-09-10 08:27:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:01,228 INFO L93 Difference]: Finished difference Result 504 states and 733 transitions. [2019-09-10 08:27:01,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:27:01,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-09-10 08:27:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:01,232 INFO L225 Difference]: With dead ends: 504 [2019-09-10 08:27:01,233 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 08:27:01,233 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 08:27:01,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 08:27:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-10 08:27:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-10 08:27:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 733 transitions. [2019-09-10 08:27:01,250 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 733 transitions. Word has length 117 [2019-09-10 08:27:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:01,259 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 733 transitions. [2019-09-10 08:27:01,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:27:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 733 transitions. [2019-09-10 08:27:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:27:01,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:01,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:01,268 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:01,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:01,268 INFO L82 PathProgramCache]: Analyzing trace with hash -694845729, now seen corresponding path program 1 times [2019-09-10 08:27:01,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:01,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:01,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:01,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:01,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:01,376 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 08:27:01,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:01,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:27:01,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:01,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:27:01,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:27:01,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:27:01,378 INFO L87 Difference]: Start difference. First operand 504 states and 733 transitions. Second operand 5 states. [2019-09-10 08:27:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:01,586 INFO L93 Difference]: Finished difference Result 504 states and 728 transitions. [2019-09-10 08:27:01,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:27:01,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-09-10 08:27:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:01,590 INFO L225 Difference]: With dead ends: 504 [2019-09-10 08:27:01,591 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 08:27:01,593 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 08:27:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 08:27:01,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-10 08:27:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-10 08:27:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 728 transitions. [2019-09-10 08:27:01,608 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 728 transitions. Word has length 118 [2019-09-10 08:27:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:01,608 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 728 transitions. [2019-09-10 08:27:01,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:27:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 728 transitions. [2019-09-10 08:27:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:27:01,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:01,612 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:01,612 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1872587080, now seen corresponding path program 1 times [2019-09-10 08:27:01,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:01,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:01,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:01,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:01,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:01,793 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 08:27:01,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:01,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:27:01,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:01,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:27:01,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:27:01,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:27:01,795 INFO L87 Difference]: Start difference. First operand 504 states and 728 transitions. Second operand 5 states. [2019-09-10 08:27:02,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:02,014 INFO L93 Difference]: Finished difference Result 504 states and 723 transitions. [2019-09-10 08:27:02,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:27:02,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-09-10 08:27:02,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:02,018 INFO L225 Difference]: With dead ends: 504 [2019-09-10 08:27:02,018 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 08:27:02,018 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 08:27:02,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 08:27:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-10 08:27:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-10 08:27:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 723 transitions. [2019-09-10 08:27:02,032 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 723 transitions. Word has length 119 [2019-09-10 08:27:02,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:02,032 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 723 transitions. [2019-09-10 08:27:02,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:27:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 723 transitions. [2019-09-10 08:27:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:02,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:02,034 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:02,035 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:02,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:02,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1611484050, now seen corresponding path program 1 times [2019-09-10 08:27:02,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:02,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:02,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:02,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:02,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:02,168 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 08:27:02,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:02,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:27:02,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:02,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:27:02,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:27:02,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:27:02,170 INFO L87 Difference]: Start difference. First operand 504 states and 723 transitions. Second operand 5 states. [2019-09-10 08:27:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:02,304 INFO L93 Difference]: Finished difference Result 1314 states and 1946 transitions. [2019-09-10 08:27:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:27:02,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:27:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:02,314 INFO L225 Difference]: With dead ends: 1314 [2019-09-10 08:27:02,314 INFO L226 Difference]: Without dead ends: 1314 [2019-09-10 08:27:02,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:27:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-09-10 08:27:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1202. [2019-09-10 08:27:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1202 states. [2019-09-10 08:27:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1787 transitions. [2019-09-10 08:27:02,352 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1787 transitions. Word has length 120 [2019-09-10 08:27:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:02,353 INFO L475 AbstractCegarLoop]: Abstraction has 1202 states and 1787 transitions. [2019-09-10 08:27:02,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:27:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1787 transitions. [2019-09-10 08:27:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:02,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:02,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:02,356 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:02,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:02,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1110184227, now seen corresponding path program 1 times [2019-09-10 08:27:02,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:02,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:02,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:02,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:02,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:02,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 08:27:02,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:02,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:27:02,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:02,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:27:02,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:27:02,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:27:02,513 INFO L87 Difference]: Start difference. First operand 1202 states and 1787 transitions. Second operand 5 states. [2019-09-10 08:27:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:02,635 INFO L93 Difference]: Finished difference Result 2195 states and 3286 transitions. [2019-09-10 08:27:02,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:27:02,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:27:02,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:02,646 INFO L225 Difference]: With dead ends: 2195 [2019-09-10 08:27:02,647 INFO L226 Difference]: Without dead ends: 2195 [2019-09-10 08:27:02,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:27:02,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2019-09-10 08:27:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1703. [2019-09-10 08:27:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-09-10 08:27:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2552 transitions. [2019-09-10 08:27:02,701 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2552 transitions. Word has length 120 [2019-09-10 08:27:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:02,702 INFO L475 AbstractCegarLoop]: Abstraction has 1703 states and 2552 transitions. [2019-09-10 08:27:02,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:27:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2552 transitions. [2019-09-10 08:27:02,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:02,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:02,704 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:02,704 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:02,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1346892231, now seen corresponding path program 1 times [2019-09-10 08:27:02,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:02,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:02,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:02,894 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 08:27:02,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:02,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:27:02,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:02,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:27:02,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:27:02,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:27:02,896 INFO L87 Difference]: Start difference. First operand 1703 states and 2552 transitions. Second operand 5 states. [2019-09-10 08:27:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:03,039 INFO L93 Difference]: Finished difference Result 2601 states and 3907 transitions. [2019-09-10 08:27:03,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:27:03,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:27:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:03,055 INFO L225 Difference]: With dead ends: 2601 [2019-09-10 08:27:03,055 INFO L226 Difference]: Without dead ends: 2601 [2019-09-10 08:27:03,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:27:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2019-09-10 08:27:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2189. [2019-09-10 08:27:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2019-09-10 08:27:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3293 transitions. [2019-09-10 08:27:03,129 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3293 transitions. Word has length 120 [2019-09-10 08:27:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:03,129 INFO L475 AbstractCegarLoop]: Abstraction has 2189 states and 3293 transitions. [2019-09-10 08:27:03,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:27:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3293 transitions. [2019-09-10 08:27:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:03,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:03,132 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:03,132 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:03,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:03,133 INFO L82 PathProgramCache]: Analyzing trace with hash 628970857, now seen corresponding path program 1 times [2019-09-10 08:27:03,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:03,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:03,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:03,225 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 08:27:03,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:03,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:27:03,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:03,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:27:03,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:27:03,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:27:03,228 INFO L87 Difference]: Start difference. First operand 2189 states and 3293 transitions. Second operand 3 states. [2019-09-10 08:27:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:03,294 INFO L93 Difference]: Finished difference Result 2191 states and 3284 transitions. [2019-09-10 08:27:03,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:27:03,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:27:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:03,306 INFO L225 Difference]: With dead ends: 2191 [2019-09-10 08:27:03,307 INFO L226 Difference]: Without dead ends: 2191 [2019-09-10 08:27:03,307 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 08:27:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2019-09-10 08:27:03,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2189. [2019-09-10 08:27:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2019-09-10 08:27:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3283 transitions. [2019-09-10 08:27:03,374 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3283 transitions. Word has length 120 [2019-09-10 08:27:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:03,374 INFO L475 AbstractCegarLoop]: Abstraction has 2189 states and 3283 transitions. [2019-09-10 08:27:03,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:27:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3283 transitions. [2019-09-10 08:27:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:03,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:03,377 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:03,377 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:03,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:03,377 INFO L82 PathProgramCache]: Analyzing trace with hash 385846506, now seen corresponding path program 1 times [2019-09-10 08:27:03,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:03,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:03,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:03,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:03,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:03,449 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 08:27:03,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:03,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:27:03,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:03,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:27:03,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:27:03,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:27:03,452 INFO L87 Difference]: Start difference. First operand 2189 states and 3283 transitions. Second operand 3 states. [2019-09-10 08:27:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:03,506 INFO L93 Difference]: Finished difference Result 3921 states and 5832 transitions. [2019-09-10 08:27:03,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:27:03,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:27:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:03,525 INFO L225 Difference]: With dead ends: 3921 [2019-09-10 08:27:03,525 INFO L226 Difference]: Without dead ends: 3921 [2019-09-10 08:27:03,526 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 08:27:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2019-09-10 08:27:03,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 3871. [2019-09-10 08:27:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3871 states. [2019-09-10 08:27:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 3871 states and 5759 transitions. [2019-09-10 08:27:03,631 INFO L78 Accepts]: Start accepts. Automaton has 3871 states and 5759 transitions. Word has length 120 [2019-09-10 08:27:03,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:03,632 INFO L475 AbstractCegarLoop]: Abstraction has 3871 states and 5759 transitions. [2019-09-10 08:27:03,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:27:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3871 states and 5759 transitions. [2019-09-10 08:27:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:03,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:03,634 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:03,634 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:03,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1534182572, now seen corresponding path program 1 times [2019-09-10 08:27:03,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:03,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:03,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:03,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:03,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:03,972 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 08:27:03,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:03,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:03,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:03,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:03,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:03,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:03,974 INFO L87 Difference]: Start difference. First operand 3871 states and 5759 transitions. Second operand 9 states. [2019-09-10 08:27:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:04,463 INFO L93 Difference]: Finished difference Result 11050 states and 16477 transitions. [2019-09-10 08:27:04,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:27:04,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:04,532 INFO L225 Difference]: With dead ends: 11050 [2019-09-10 08:27:04,532 INFO L226 Difference]: Without dead ends: 11050 [2019-09-10 08:27:04,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:27:04,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11050 states. [2019-09-10 08:27:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11050 to 4469. [2019-09-10 08:27:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4469 states. [2019-09-10 08:27:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4469 states to 4469 states and 6651 transitions. [2019-09-10 08:27:04,731 INFO L78 Accepts]: Start accepts. Automaton has 4469 states and 6651 transitions. Word has length 120 [2019-09-10 08:27:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:04,731 INFO L475 AbstractCegarLoop]: Abstraction has 4469 states and 6651 transitions. [2019-09-10 08:27:04,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4469 states and 6651 transitions. [2019-09-10 08:27:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:04,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:04,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:04,734 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:04,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2082666138, now seen corresponding path program 1 times [2019-09-10 08:27:04,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:04,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:04,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:04,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:04,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:04,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:27:04,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:04,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:27:04,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:27:04,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:27:04,876 INFO L87 Difference]: Start difference. First operand 4469 states and 6651 transitions. Second operand 5 states. [2019-09-10 08:27:05,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:05,007 INFO L93 Difference]: Finished difference Result 5775 states and 8583 transitions. [2019-09-10 08:27:05,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:27:05,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:27:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:05,023 INFO L225 Difference]: With dead ends: 5775 [2019-09-10 08:27:05,023 INFO L226 Difference]: Without dead ends: 5775 [2019-09-10 08:27:05,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:27:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2019-09-10 08:27:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5067. [2019-09-10 08:27:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5067 states. [2019-09-10 08:27:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5067 states to 5067 states and 7545 transitions. [2019-09-10 08:27:05,192 INFO L78 Accepts]: Start accepts. Automaton has 5067 states and 7545 transitions. Word has length 120 [2019-09-10 08:27:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:05,192 INFO L475 AbstractCegarLoop]: Abstraction has 5067 states and 7545 transitions. [2019-09-10 08:27:05,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:27:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 7545 transitions. [2019-09-10 08:27:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:05,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:27:05,196 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:05,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:05,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1273267460, now seen corresponding path program 1 times [2019-09-10 08:27:05,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:05,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:05,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:05,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:05,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:05,437 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 08:27:05,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:05,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:05,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:05,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:05,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:05,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:05,441 INFO L87 Difference]: Start difference. First operand 5067 states and 7545 transitions. Second operand 9 states. [2019-09-10 08:27:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:05,785 INFO L93 Difference]: Finished difference Result 13270 states and 19797 transitions. [2019-09-10 08:27:05,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:27:05,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:05,819 INFO L225 Difference]: With dead ends: 13270 [2019-09-10 08:27:05,819 INFO L226 Difference]: Without dead ends: 13270 [2019-09-10 08:27:05,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:27:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13270 states. [2019-09-10 08:27:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13270 to 5987. [2019-09-10 08:27:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5987 states. [2019-09-10 08:27:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 8917 transitions. [2019-09-10 08:27:06,056 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 8917 transitions. Word has length 120 [2019-09-10 08:27:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:06,056 INFO L475 AbstractCegarLoop]: Abstraction has 5987 states and 8917 transitions. [2019-09-10 08:27:06,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 8917 transitions. [2019-09-10 08:27:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:06,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:06,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:06,061 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:06,062 INFO L82 PathProgramCache]: Analyzing trace with hash -229628659, now seen corresponding path program 1 times [2019-09-10 08:27:06,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:06,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:06,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:06,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:06,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:06,215 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 08:27:06,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:06,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:27:06,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:06,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:27:06,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:27:06,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:27:06,217 INFO L87 Difference]: Start difference. First operand 5987 states and 8917 transitions. Second operand 5 states. [2019-09-10 08:27:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:06,424 INFO L93 Difference]: Finished difference Result 11642 states and 17363 transitions. [2019-09-10 08:27:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:27:06,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:27:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:06,446 INFO L225 Difference]: With dead ends: 11642 [2019-09-10 08:27:06,446 INFO L226 Difference]: Without dead ends: 11642 [2019-09-10 08:27:06,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:27:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11642 states. [2019-09-10 08:27:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11642 to 11384. [2019-09-10 08:27:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11384 states. [2019-09-10 08:27:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11384 states to 11384 states and 16988 transitions. [2019-09-10 08:27:06,659 INFO L78 Accepts]: Start accepts. Automaton has 11384 states and 16988 transitions. Word has length 120 [2019-09-10 08:27:06,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:06,659 INFO L475 AbstractCegarLoop]: Abstraction has 11384 states and 16988 transitions. [2019-09-10 08:27:06,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:27:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 11384 states and 16988 transitions. [2019-09-10 08:27:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:27:06,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:06,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:06,663 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1978649096, now seen corresponding path program 1 times [2019-09-10 08:27:06,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:06,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:06,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:06,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:06,788 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 08:27:06,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:06,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:27:06,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:06,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:27:06,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:27:06,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:27:06,790 INFO L87 Difference]: Start difference. First operand 11384 states and 16988 transitions. Second operand 5 states. [2019-09-10 08:27:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:06,890 INFO L93 Difference]: Finished difference Result 20258 states and 30096 transitions. [2019-09-10 08:27:06,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:27:06,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-10 08:27:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:06,932 INFO L225 Difference]: With dead ends: 20258 [2019-09-10 08:27:06,933 INFO L226 Difference]: Without dead ends: 20258 [2019-09-10 08:27:06,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:27:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20258 states. [2019-09-10 08:27:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20258 to 11472. [2019-09-10 08:27:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11472 states. [2019-09-10 08:27:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17054 transitions. [2019-09-10 08:27:07,289 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17054 transitions. Word has length 121 [2019-09-10 08:27:07,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:07,289 INFO L475 AbstractCegarLoop]: Abstraction has 11472 states and 17054 transitions. [2019-09-10 08:27:07,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:27:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17054 transitions. [2019-09-10 08:27:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:27:07,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:07,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:07,295 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash -690965260, now seen corresponding path program 1 times [2019-09-10 08:27:07,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:07,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:07,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:07,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:07,573 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 08:27:07,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:07,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:07,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:07,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:07,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:07,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:07,577 INFO L87 Difference]: Start difference. First operand 11472 states and 17054 transitions. Second operand 9 states. [2019-09-10 08:27:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:08,428 INFO L93 Difference]: Finished difference Result 22570 states and 33574 transitions. [2019-09-10 08:27:08,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:27:08,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:27:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:08,473 INFO L225 Difference]: With dead ends: 22570 [2019-09-10 08:27:08,474 INFO L226 Difference]: Without dead ends: 22570 [2019-09-10 08:27:08,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:27:08,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22570 states. [2019-09-10 08:27:08,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22570 to 11472. [2019-09-10 08:27:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11472 states. [2019-09-10 08:27:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17053 transitions. [2019-09-10 08:27:08,771 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17053 transitions. Word has length 121 [2019-09-10 08:27:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:08,771 INFO L475 AbstractCegarLoop]: Abstraction has 11472 states and 17053 transitions. [2019-09-10 08:27:08,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17053 transitions. [2019-09-10 08:27:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:27:08,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:08,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:08,776 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:08,776 INFO L82 PathProgramCache]: Analyzing trace with hash -66846392, now seen corresponding path program 1 times [2019-09-10 08:27:08,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:08,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:08,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:08,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:08,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:09,270 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 08:27:09,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:09,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:27:09,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:09,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:27:09,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:27:09,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:27:09,272 INFO L87 Difference]: Start difference. First operand 11472 states and 17053 transitions. Second operand 10 states. [2019-09-10 08:27:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:10,583 INFO L93 Difference]: Finished difference Result 19750 states and 29233 transitions. [2019-09-10 08:27:10,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:27:10,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2019-09-10 08:27:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:10,620 INFO L225 Difference]: With dead ends: 19750 [2019-09-10 08:27:10,620 INFO L226 Difference]: Without dead ends: 19750 [2019-09-10 08:27:10,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:27:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19750 states. [2019-09-10 08:27:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19750 to 11472. [2019-09-10 08:27:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11472 states. [2019-09-10 08:27:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17050 transitions. [2019-09-10 08:27:11,040 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17050 transitions. Word has length 122 [2019-09-10 08:27:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:11,041 INFO L475 AbstractCegarLoop]: Abstraction has 11472 states and 17050 transitions. [2019-09-10 08:27:11,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:27:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17050 transitions. [2019-09-10 08:27:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:27:11,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:27:11,045 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:11,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:11,045 INFO L82 PathProgramCache]: Analyzing trace with hash 593355322, now seen corresponding path program 1 times [2019-09-10 08:27:11,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:11,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:11,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:11,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:11,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:11,367 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 08:27:11,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:11,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:27:11,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:11,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:27:11,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:27:11,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:27:11,370 INFO L87 Difference]: Start difference. First operand 11472 states and 17050 transitions. Second operand 10 states. [2019-09-10 08:27:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:12,396 INFO L93 Difference]: Finished difference Result 23043 states and 34123 transitions. [2019-09-10 08:27:12,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:27:12,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2019-09-10 08:27:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:12,429 INFO L225 Difference]: With dead ends: 23043 [2019-09-10 08:27:12,429 INFO L226 Difference]: Without dead ends: 23043 [2019-09-10 08:27:12,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:27:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23043 states. [2019-09-10 08:27:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23043 to 11472. [2019-09-10 08:27:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11472 states. [2019-09-10 08:27:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17039 transitions. [2019-09-10 08:27:12,684 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17039 transitions. Word has length 122 [2019-09-10 08:27:12,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:12,684 INFO L475 AbstractCegarLoop]: Abstraction has 11472 states and 17039 transitions. [2019-09-10 08:27:12,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:27:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17039 transitions. [2019-09-10 08:27:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:27:12,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:12,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:12,688 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:12,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:12,689 INFO L82 PathProgramCache]: Analyzing trace with hash -340793067, now seen corresponding path program 1 times [2019-09-10 08:27:12,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:12,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:12,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:12,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:12,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:13,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:13,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:27:13,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:13,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:27:13,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:27:13,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:27:13,015 INFO L87 Difference]: Start difference. First operand 11472 states and 17039 transitions. Second operand 10 states. [2019-09-10 08:27:13,491 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2019-09-10 08:27:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:14,368 INFO L93 Difference]: Finished difference Result 43295 states and 63723 transitions. [2019-09-10 08:27:14,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:27:14,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2019-09-10 08:27:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:14,424 INFO L225 Difference]: With dead ends: 43295 [2019-09-10 08:27:14,425 INFO L226 Difference]: Without dead ends: 43295 [2019-09-10 08:27:14,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:27:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43295 states. [2019-09-10 08:27:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43295 to 11529. [2019-09-10 08:27:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2019-09-10 08:27:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 17115 transitions. [2019-09-10 08:27:14,787 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 17115 transitions. Word has length 123 [2019-09-10 08:27:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:14,787 INFO L475 AbstractCegarLoop]: Abstraction has 11529 states and 17115 transitions. [2019-09-10 08:27:14,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:27:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 17115 transitions. [2019-09-10 08:27:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:27:14,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:14,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:14,791 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:14,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:14,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1421082261, now seen corresponding path program 1 times [2019-09-10 08:27:14,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:14,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:14,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:15,028 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 08:27:15,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:15,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:27:15,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:15,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:27:15,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:27:15,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:27:15,030 INFO L87 Difference]: Start difference. First operand 11529 states and 17115 transitions. Second operand 10 states. [2019-09-10 08:27:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:16,091 INFO L93 Difference]: Finished difference Result 23121 states and 34199 transitions. [2019-09-10 08:27:16,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:27:16,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2019-09-10 08:27:16,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:16,116 INFO L225 Difference]: With dead ends: 23121 [2019-09-10 08:27:16,116 INFO L226 Difference]: Without dead ends: 23121 [2019-09-10 08:27:16,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:27:16,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23121 states. [2019-09-10 08:27:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23121 to 11529. [2019-09-10 08:27:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2019-09-10 08:27:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 17100 transitions. [2019-09-10 08:27:16,305 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 17100 transitions. Word has length 124 [2019-09-10 08:27:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:16,306 INFO L475 AbstractCegarLoop]: Abstraction has 11529 states and 17100 transitions. [2019-09-10 08:27:16,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:27:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 17100 transitions. [2019-09-10 08:27:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:27:16,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:16,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:16,309 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:16,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1124170001, now seen corresponding path program 1 times [2019-09-10 08:27:16,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:16,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:16,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:16,533 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 08:27:16,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:16,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:27:16,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:16,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:27:16,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:27:16,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:27:16,538 INFO L87 Difference]: Start difference. First operand 11529 states and 17100 transitions. Second operand 10 states. [2019-09-10 08:27:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:17,569 INFO L93 Difference]: Finished difference Result 23134 states and 34210 transitions. [2019-09-10 08:27:17,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:27:17,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2019-09-10 08:27:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:17,591 INFO L225 Difference]: With dead ends: 23134 [2019-09-10 08:27:17,591 INFO L226 Difference]: Without dead ends: 23134 [2019-09-10 08:27:17,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:27:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23134 states. [2019-09-10 08:27:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23134 to 11529. [2019-09-10 08:27:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2019-09-10 08:27:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 17094 transitions. [2019-09-10 08:27:17,784 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 17094 transitions. Word has length 125 [2019-09-10 08:27:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:17,784 INFO L475 AbstractCegarLoop]: Abstraction has 11529 states and 17094 transitions. [2019-09-10 08:27:17,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:27:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 17094 transitions. [2019-09-10 08:27:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:27:17,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:17,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:17,787 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:17,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:17,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1464723913, now seen corresponding path program 1 times [2019-09-10 08:27:17,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:17,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:17,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:17,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:17,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:18,159 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 08:27:18,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:18,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:27:18,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:18,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:27:18,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:27:18,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:27:18,161 INFO L87 Difference]: Start difference. First operand 11529 states and 17094 transitions. Second operand 10 states. [2019-09-10 08:27:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:19,211 INFO L93 Difference]: Finished difference Result 23066 states and 34084 transitions. [2019-09-10 08:27:19,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:27:19,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-09-10 08:27:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:19,238 INFO L225 Difference]: With dead ends: 23066 [2019-09-10 08:27:19,238 INFO L226 Difference]: Without dead ends: 23066 [2019-09-10 08:27:19,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:27:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23066 states. [2019-09-10 08:27:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23066 to 11529. [2019-09-10 08:27:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2019-09-10 08:27:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 17077 transitions. [2019-09-10 08:27:19,402 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 17077 transitions. Word has length 126 [2019-09-10 08:27:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:19,403 INFO L475 AbstractCegarLoop]: Abstraction has 11529 states and 17077 transitions. [2019-09-10 08:27:19,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:27:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 17077 transitions. [2019-09-10 08:27:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:27:19,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:19,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:19,405 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:19,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:19,406 INFO L82 PathProgramCache]: Analyzing trace with hash 195353613, now seen corresponding path program 1 times [2019-09-10 08:27:19,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:19,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:19,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:19,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:19,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:20,410 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 08:27:20,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:20,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:27:20,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:20,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:27:20,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:27:20,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:27:20,412 INFO L87 Difference]: Start difference. First operand 11529 states and 17077 transitions. Second operand 19 states. [2019-09-10 08:27:21,234 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-09-10 08:27:21,421 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:27:21,726 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-10 08:27:22,071 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-10 08:27:22,265 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:27:22,400 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 08:27:22,673 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:27:22,961 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:27:23,131 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 08:27:23,376 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 08:27:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:24,496 INFO L93 Difference]: Finished difference Result 62946 states and 93541 transitions. [2019-09-10 08:27:24,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:27:24,496 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 127 [2019-09-10 08:27:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:24,570 INFO L225 Difference]: With dead ends: 62946 [2019-09-10 08:27:24,571 INFO L226 Difference]: Without dead ends: 62946 [2019-09-10 08:27:24,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:27:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62946 states. [2019-09-10 08:27:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62946 to 11559. [2019-09-10 08:27:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11559 states. [2019-09-10 08:27:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11559 states to 11559 states and 17103 transitions. [2019-09-10 08:27:25,747 INFO L78 Accepts]: Start accepts. Automaton has 11559 states and 17103 transitions. Word has length 127 [2019-09-10 08:27:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:25,747 INFO L475 AbstractCegarLoop]: Abstraction has 11559 states and 17103 transitions. [2019-09-10 08:27:25,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:27:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11559 states and 17103 transitions. [2019-09-10 08:27:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:27:25,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:25,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:25,749 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:25,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:25,749 INFO L82 PathProgramCache]: Analyzing trace with hash -944880079, now seen corresponding path program 1 times [2019-09-10 08:27:25,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:25,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:25,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:25,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:25,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:26,810 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 08:27:26,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:26,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:27:26,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:26,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:27:26,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:27:26,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:27:26,812 INFO L87 Difference]: Start difference. First operand 11559 states and 17103 transitions. Second operand 18 states. [2019-09-10 08:27:27,639 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 08:27:27,864 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 08:27:28,209 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:27:28,398 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:27:28,610 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:27:28,796 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 08:27:29,091 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 08:27:29,402 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:27:29,821 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:27:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:30,595 INFO L93 Difference]: Finished difference Result 72343 states and 106944 transitions. [2019-09-10 08:27:30,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:27:30,596 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 127 [2019-09-10 08:27:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:30,671 INFO L225 Difference]: With dead ends: 72343 [2019-09-10 08:27:30,671 INFO L226 Difference]: Without dead ends: 72343 [2019-09-10 08:27:30,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:27:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72343 states. [2019-09-10 08:27:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72343 to 11581. [2019-09-10 08:27:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11581 states. [2019-09-10 08:27:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11581 states to 11581 states and 17136 transitions. [2019-09-10 08:27:31,115 INFO L78 Accepts]: Start accepts. Automaton has 11581 states and 17136 transitions. Word has length 127 [2019-09-10 08:27:31,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:31,115 INFO L475 AbstractCegarLoop]: Abstraction has 11581 states and 17136 transitions. [2019-09-10 08:27:31,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:27:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 11581 states and 17136 transitions. [2019-09-10 08:27:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:27:31,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:27:31,118 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:31,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:31,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2019210254, now seen corresponding path program 1 times [2019-09-10 08:27:31,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:31,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:31,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:31,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:31,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:32,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 08:27:32,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:32,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 08:27:32,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:32,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 08:27:32,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 08:27:32,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:27:32,687 INFO L87 Difference]: Start difference. First operand 11581 states and 17136 transitions. Second operand 24 states. [2019-09-10 08:27:34,280 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:27:34,579 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 08:27:35,024 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 08:27:35,726 WARN L188 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-10 08:27:36,411 WARN L188 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 109 [2019-09-10 08:27:36,665 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:27:36,906 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:27:37,169 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:27:37,510 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 08:27:37,825 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:27:38,196 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-10 08:27:38,524 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 08:27:38,880 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 08:27:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:41,197 INFO L93 Difference]: Finished difference Result 85109 states and 125813 transitions. [2019-09-10 08:27:41,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:27:41,198 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2019-09-10 08:27:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:41,425 INFO L225 Difference]: With dead ends: 85109 [2019-09-10 08:27:41,426 INFO L226 Difference]: Without dead ends: 85109 [2019-09-10 08:27:41,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=532, Invalid=2120, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 08:27:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85109 states. [2019-09-10 08:27:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85109 to 11601. [2019-09-10 08:27:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11601 states. [2019-09-10 08:27:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11601 states to 11601 states and 17159 transitions. [2019-09-10 08:27:41,859 INFO L78 Accepts]: Start accepts. Automaton has 11601 states and 17159 transitions. Word has length 127 [2019-09-10 08:27:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:41,859 INFO L475 AbstractCegarLoop]: Abstraction has 11601 states and 17159 transitions. [2019-09-10 08:27:41,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 08:27:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 11601 states and 17159 transitions. [2019-09-10 08:27:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:27:41,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:41,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:41,861 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:41,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:41,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1008657458, now seen corresponding path program 1 times [2019-09-10 08:27:41,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:41,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:41,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:41,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:41,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:41,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:41,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:27:41,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:41,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:27:41,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:27:41,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:27:41,937 INFO L87 Difference]: Start difference. First operand 11601 states and 17159 transitions. Second operand 3 states. [2019-09-10 08:27:42,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:42,002 INFO L93 Difference]: Finished difference Result 22107 states and 32769 transitions. [2019-09-10 08:27:42,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:27:42,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-10 08:27:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:42,027 INFO L225 Difference]: With dead ends: 22107 [2019-09-10 08:27:42,027 INFO L226 Difference]: Without dead ends: 22107 [2019-09-10 08:27:42,027 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 08:27:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22107 states. [2019-09-10 08:27:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22107 to 21513. [2019-09-10 08:27:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21513 states. [2019-09-10 08:27:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21513 states to 21513 states and 31732 transitions. [2019-09-10 08:27:42,224 INFO L78 Accepts]: Start accepts. Automaton has 21513 states and 31732 transitions. Word has length 127 [2019-09-10 08:27:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:42,225 INFO L475 AbstractCegarLoop]: Abstraction has 21513 states and 31732 transitions. [2019-09-10 08:27:42,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:27:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 21513 states and 31732 transitions. [2019-09-10 08:27:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:27:42,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:42,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:42,227 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:42,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:42,228 INFO L82 PathProgramCache]: Analyzing trace with hash 125385868, now seen corresponding path program 1 times [2019-09-10 08:27:42,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:42,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:42,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:43,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 08:27:43,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:43,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:27:43,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:43,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:27:43,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:27:43,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:27:43,270 INFO L87 Difference]: Start difference. First operand 21513 states and 31732 transitions. Second operand 19 states. [2019-09-10 08:27:43,966 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-10 08:27:44,172 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 08:27:44,481 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 08:27:44,842 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-10 08:27:45,051 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 08:27:45,290 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 08:27:45,563 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:27:45,874 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:27:46,057 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:27:46,316 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:27:47,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:47,356 INFO L93 Difference]: Finished difference Result 67173 states and 99268 transitions. [2019-09-10 08:27:47,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:27:47,356 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 127 [2019-09-10 08:27:47,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:47,416 INFO L225 Difference]: With dead ends: 67173 [2019-09-10 08:27:47,416 INFO L226 Difference]: Without dead ends: 67173 [2019-09-10 08:27:47,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:27:47,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67173 states. [2019-09-10 08:27:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67173 to 21503. [2019-09-10 08:27:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21503 states. [2019-09-10 08:27:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21503 states to 21503 states and 31712 transitions. [2019-09-10 08:27:47,815 INFO L78 Accepts]: Start accepts. Automaton has 21503 states and 31712 transitions. Word has length 127 [2019-09-10 08:27:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:47,816 INFO L475 AbstractCegarLoop]: Abstraction has 21503 states and 31712 transitions. [2019-09-10 08:27:47,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:27:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 21503 states and 31712 transitions. [2019-09-10 08:27:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:27:47,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:47,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:47,818 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:47,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:47,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1410801195, now seen corresponding path program 1 times [2019-09-10 08:27:47,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:47,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:47,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:47,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:47,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:48,791 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:27:49,049 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-10 08:27:49,663 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 08:27:49,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:49,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:27:49,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:49,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:27:49,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:27:49,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:27:49,665 INFO L87 Difference]: Start difference. First operand 21503 states and 31712 transitions. Second operand 25 states. [2019-09-10 08:27:50,633 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-10 08:27:51,002 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-10 08:27:51,284 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-10 08:27:51,670 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 08:27:52,089 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-09-10 08:27:52,665 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 109 [2019-09-10 08:27:53,250 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 116 [2019-09-10 08:27:53,507 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-10 08:27:54,031 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-10 08:27:54,527 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 08:27:54,764 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 08:27:55,159 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 08:27:55,687 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:27:56,146 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:27:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:58,710 INFO L93 Difference]: Finished difference Result 119733 states and 177048 transitions. [2019-09-10 08:27:58,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 08:27:58,711 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 127 [2019-09-10 08:27:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:58,827 INFO L225 Difference]: With dead ends: 119733 [2019-09-10 08:27:58,827 INFO L226 Difference]: Without dead ends: 119733 [2019-09-10 08:27:58,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:27:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119733 states. [2019-09-10 08:27:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119733 to 21521. [2019-09-10 08:27:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21521 states. [2019-09-10 08:27:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21521 states to 21521 states and 31732 transitions. [2019-09-10 08:27:59,713 INFO L78 Accepts]: Start accepts. Automaton has 21521 states and 31732 transitions. Word has length 127 [2019-09-10 08:27:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:59,713 INFO L475 AbstractCegarLoop]: Abstraction has 21521 states and 31732 transitions. [2019-09-10 08:27:59,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:27:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 21521 states and 31732 transitions. [2019-09-10 08:27:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:27:59,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:59,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:27:59,715 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:59,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:59,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2022749332, now seen corresponding path program 1 times [2019-09-10 08:27:59,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:59,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:59,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:00,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:00,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:28:00,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:00,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:28:00,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:28:00,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:28:00,517 INFO L87 Difference]: Start difference. First operand 21521 states and 31732 transitions. Second operand 17 states. [2019-09-10 08:28:01,308 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:28:01,616 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-09-10 08:28:01,784 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 08:28:01,951 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 08:28:02,175 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 08:28:02,381 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 08:28:02,544 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 08:28:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:03,570 INFO L93 Difference]: Finished difference Result 65197 states and 96410 transitions. [2019-09-10 08:28:03,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:28:03,571 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 127 [2019-09-10 08:28:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:03,628 INFO L225 Difference]: With dead ends: 65197 [2019-09-10 08:28:03,628 INFO L226 Difference]: Without dead ends: 65197 [2019-09-10 08:28:03,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:28:03,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65197 states. [2019-09-10 08:28:04,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65197 to 21481. [2019-09-10 08:28:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21481 states. [2019-09-10 08:28:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21481 states to 21481 states and 31682 transitions. [2019-09-10 08:28:04,907 INFO L78 Accepts]: Start accepts. Automaton has 21481 states and 31682 transitions. Word has length 127 [2019-09-10 08:28:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:04,908 INFO L475 AbstractCegarLoop]: Abstraction has 21481 states and 31682 transitions. [2019-09-10 08:28:04,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:28:04,908 INFO L276 IsEmpty]: Start isEmpty. Operand 21481 states and 31682 transitions. [2019-09-10 08:28:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:28:04,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:04,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:04,909 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:04,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:04,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1115215921, now seen corresponding path program 1 times [2019-09-10 08:28:04,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:04,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:04,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:04,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:04,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:05,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:05,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:28:05,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:05,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:28:05,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:28:05,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:28:05,063 INFO L87 Difference]: Start difference. First operand 21481 states and 31682 transitions. Second operand 4 states. [2019-09-10 08:28:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:05,191 INFO L93 Difference]: Finished difference Result 28943 states and 42519 transitions. [2019-09-10 08:28:05,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:28:05,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 08:28:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:05,230 INFO L225 Difference]: With dead ends: 28943 [2019-09-10 08:28:05,231 INFO L226 Difference]: Without dead ends: 28943 [2019-09-10 08:28:05,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:28:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28943 states. [2019-09-10 08:28:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28943 to 28833. [2019-09-10 08:28:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28833 states. [2019-09-10 08:28:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28833 states to 28833 states and 42410 transitions. [2019-09-10 08:28:05,588 INFO L78 Accepts]: Start accepts. Automaton has 28833 states and 42410 transitions. Word has length 128 [2019-09-10 08:28:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:05,588 INFO L475 AbstractCegarLoop]: Abstraction has 28833 states and 42410 transitions. [2019-09-10 08:28:05,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:28:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 28833 states and 42410 transitions. [2019-09-10 08:28:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:28:05,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:05,590 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:05,590 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:05,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:05,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1141789032, now seen corresponding path program 1 times [2019-09-10 08:28:05,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:05,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:05,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:05,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:05,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:06,502 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 08:28:06,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:06,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:28:06,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:06,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:28:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:28:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:28:06,504 INFO L87 Difference]: Start difference. First operand 28833 states and 42410 transitions. Second operand 16 states. [2019-09-10 08:28:06,704 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 08:28:07,059 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:28:07,290 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 08:28:07,556 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:28:07,783 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-10 08:28:08,134 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-09-10 08:28:08,455 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-09-10 08:28:08,800 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-09-10 08:28:08,976 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:28:09,143 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:28:09,474 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-10 08:28:09,693 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:28:09,919 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:28:10,218 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2019-09-10 08:28:11,158 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:28:11,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:11,814 INFO L93 Difference]: Finished difference Result 170970 states and 252003 transitions. [2019-09-10 08:28:11,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:28:11,815 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 128 [2019-09-10 08:28:11,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:12,338 INFO L225 Difference]: With dead ends: 170970 [2019-09-10 08:28:12,338 INFO L226 Difference]: Without dead ends: 170970 [2019-09-10 08:28:12,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:28:12,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170970 states. [2019-09-10 08:28:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170970 to 28749. [2019-09-10 08:28:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28749 states. [2019-09-10 08:28:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28749 states to 28749 states and 42292 transitions. [2019-09-10 08:28:13,459 INFO L78 Accepts]: Start accepts. Automaton has 28749 states and 42292 transitions. Word has length 128 [2019-09-10 08:28:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:13,460 INFO L475 AbstractCegarLoop]: Abstraction has 28749 states and 42292 transitions. [2019-09-10 08:28:13,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:28:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 28749 states and 42292 transitions. [2019-09-10 08:28:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:28:13,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:13,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:13,461 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:13,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1623352999, now seen corresponding path program 1 times [2019-09-10 08:28:13,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:13,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:13,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:13,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:13,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:14,434 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 08:28:14,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:14,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:28:14,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:14,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:28:14,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:28:14,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:28:14,436 INFO L87 Difference]: Start difference. First operand 28749 states and 42292 transitions. Second operand 19 states. [2019-09-10 08:28:15,108 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 08:28:15,317 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:28:15,642 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-10 08:28:16,127 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 08:28:16,295 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:28:16,631 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:28:16,888 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:28:17,246 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 08:28:17,480 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 08:28:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:18,808 INFO L93 Difference]: Finished difference Result 157345 states and 232064 transitions. [2019-09-10 08:28:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:28:18,809 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2019-09-10 08:28:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:18,968 INFO L225 Difference]: With dead ends: 157345 [2019-09-10 08:28:18,969 INFO L226 Difference]: Without dead ends: 157345 [2019-09-10 08:28:18,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:28:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157345 states. [2019-09-10 08:28:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157345 to 28749. [2019-09-10 08:28:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28749 states. [2019-09-10 08:28:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28749 states to 28749 states and 42289 transitions. [2019-09-10 08:28:19,990 INFO L78 Accepts]: Start accepts. Automaton has 28749 states and 42289 transitions. Word has length 128 [2019-09-10 08:28:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:19,990 INFO L475 AbstractCegarLoop]: Abstraction has 28749 states and 42289 transitions. [2019-09-10 08:28:19,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:28:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 28749 states and 42289 transitions. [2019-09-10 08:28:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:28:19,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:19,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:19,991 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:19,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:19,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1665133977, now seen corresponding path program 1 times [2019-09-10 08:28:19,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:19,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:19,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:19,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:19,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:20,621 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 08:28:20,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:20,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:28:20,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:20,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:28:20,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:28:20,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:28:20,623 INFO L87 Difference]: Start difference. First operand 28749 states and 42289 transitions. Second operand 13 states. [2019-09-10 08:28:21,027 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 08:28:21,211 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:28:21,395 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:28:21,742 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:28:21,984 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 08:28:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:22,389 INFO L93 Difference]: Finished difference Result 113976 states and 167980 transitions. [2019-09-10 08:28:22,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:22,390 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 128 [2019-09-10 08:28:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:22,756 INFO L225 Difference]: With dead ends: 113976 [2019-09-10 08:28:22,756 INFO L226 Difference]: Without dead ends: 113976 [2019-09-10 08:28:22,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:28:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113976 states. [2019-09-10 08:28:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113976 to 28723. [2019-09-10 08:28:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28723 states. [2019-09-10 08:28:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 42255 transitions. [2019-09-10 08:28:23,502 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 42255 transitions. Word has length 128 [2019-09-10 08:28:23,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:23,502 INFO L475 AbstractCegarLoop]: Abstraction has 28723 states and 42255 transitions. [2019-09-10 08:28:23,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:28:23,502 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 42255 transitions. [2019-09-10 08:28:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:28:23,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:23,503 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:23,503 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:23,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1025878600, now seen corresponding path program 1 times [2019-09-10 08:28:23,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:23,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:23,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:23,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:23,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:24,124 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-10 08:28:24,410 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 08:28:24,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:24,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:28:24,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:24,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:28:24,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:28:24,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:28:24,411 INFO L87 Difference]: Start difference. First operand 28723 states and 42255 transitions. Second operand 16 states. [2019-09-10 08:28:25,202 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 08:28:25,399 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 08:28:25,607 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 08:28:25,993 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 08:28:26,282 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 08:28:26,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:26,915 INFO L93 Difference]: Finished difference Result 59511 states and 87699 transitions. [2019-09-10 08:28:26,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:28:26,915 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 129 [2019-09-10 08:28:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:26,971 INFO L225 Difference]: With dead ends: 59511 [2019-09-10 08:28:26,971 INFO L226 Difference]: Without dead ends: 59511 [2019-09-10 08:28:26,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:28:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59511 states. [2019-09-10 08:28:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59511 to 28653. [2019-09-10 08:28:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28653 states. [2019-09-10 08:28:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28653 states to 28653 states and 42173 transitions. [2019-09-10 08:28:27,411 INFO L78 Accepts]: Start accepts. Automaton has 28653 states and 42173 transitions. Word has length 129 [2019-09-10 08:28:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:27,411 INFO L475 AbstractCegarLoop]: Abstraction has 28653 states and 42173 transitions. [2019-09-10 08:28:27,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:28:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 28653 states and 42173 transitions. [2019-09-10 08:28:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:28:27,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:27,412 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:27,413 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:27,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:27,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1300257325, now seen corresponding path program 1 times [2019-09-10 08:28:27,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:27,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:27,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:27,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:27,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:27,829 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-09-10 08:28:27,949 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-09-10 08:28:28,214 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-10 08:28:28,495 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 08:28:28,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:28,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:28:28,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:28,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:28:28,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:28:28,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:28:28,496 INFO L87 Difference]: Start difference. First operand 28653 states and 42173 transitions. Second operand 14 states. [2019-09-10 08:28:29,129 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:28:29,284 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:28:29,426 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 08:28:29,652 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 08:28:29,849 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 08:28:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:30,318 INFO L93 Difference]: Finished difference Result 113834 states and 167818 transitions. [2019-09-10 08:28:30,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:28:30,319 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 129 [2019-09-10 08:28:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:30,451 INFO L225 Difference]: With dead ends: 113834 [2019-09-10 08:28:30,451 INFO L226 Difference]: Without dead ends: 113834 [2019-09-10 08:28:30,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:28:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113834 states. [2019-09-10 08:28:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113834 to 28609. [2019-09-10 08:28:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28609 states. [2019-09-10 08:28:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28609 states to 28609 states and 42121 transitions. [2019-09-10 08:28:31,406 INFO L78 Accepts]: Start accepts. Automaton has 28609 states and 42121 transitions. Word has length 129 [2019-09-10 08:28:31,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:31,406 INFO L475 AbstractCegarLoop]: Abstraction has 28609 states and 42121 transitions. [2019-09-10 08:28:31,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:28:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 28609 states and 42121 transitions. [2019-09-10 08:28:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:28:31,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:31,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:31,407 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:31,407 INFO L82 PathProgramCache]: Analyzing trace with hash 29788909, now seen corresponding path program 1 times [2019-09-10 08:28:31,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:31,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:31,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:31,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:31,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:31,952 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 08:28:31,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:31,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:28:31,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:31,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:28:31,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:28:31,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:28:31,953 INFO L87 Difference]: Start difference. First operand 28609 states and 42121 transitions. Second operand 13 states. [2019-09-10 08:28:32,477 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 08:28:32,659 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:28:32,870 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:28:33,204 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:28:33,447 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:28:33,613 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:28:34,142 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 08:28:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:34,463 INFO L93 Difference]: Finished difference Result 142147 states and 209607 transitions. [2019-09-10 08:28:34,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:28:34,464 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-10 08:28:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:34,639 INFO L225 Difference]: With dead ends: 142147 [2019-09-10 08:28:34,639 INFO L226 Difference]: Without dead ends: 142147 [2019-09-10 08:28:34,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:28:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142147 states. [2019-09-10 08:28:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142147 to 28548. [2019-09-10 08:28:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28548 states. [2019-09-10 08:28:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28548 states to 28548 states and 42049 transitions. [2019-09-10 08:28:35,850 INFO L78 Accepts]: Start accepts. Automaton has 28548 states and 42049 transitions. Word has length 129 [2019-09-10 08:28:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:35,851 INFO L475 AbstractCegarLoop]: Abstraction has 28548 states and 42049 transitions. [2019-09-10 08:28:35,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:28:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 28548 states and 42049 transitions. [2019-09-10 08:28:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:28:35,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:35,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:35,852 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash -355232424, now seen corresponding path program 1 times [2019-09-10 08:28:35,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:35,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:35,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:36,408 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 08:28:36,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:36,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:28:36,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:36,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:28:36,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:28:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:28:36,410 INFO L87 Difference]: Start difference. First operand 28548 states and 42049 transitions. Second operand 13 states. [2019-09-10 08:28:36,985 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:28:37,168 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:28:37,367 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:28:37,763 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:28:38,012 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:28:38,171 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 08:28:38,532 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:28:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:38,922 INFO L93 Difference]: Finished difference Result 128866 states and 189639 transitions. [2019-09-10 08:28:38,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:28:38,922 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-10 08:28:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:39,066 INFO L225 Difference]: With dead ends: 128866 [2019-09-10 08:28:39,067 INFO L226 Difference]: Without dead ends: 128866 [2019-09-10 08:28:39,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:28:39,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128866 states. [2019-09-10 08:28:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128866 to 28550. [2019-09-10 08:28:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28550 states. [2019-09-10 08:28:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28550 states to 28550 states and 42052 transitions. [2019-09-10 08:28:39,978 INFO L78 Accepts]: Start accepts. Automaton has 28550 states and 42052 transitions. Word has length 129 [2019-09-10 08:28:39,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:39,978 INFO L475 AbstractCegarLoop]: Abstraction has 28550 states and 42052 transitions. [2019-09-10 08:28:39,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:28:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 28550 states and 42052 transitions. [2019-09-10 08:28:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:28:39,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:39,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:39,979 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:39,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:39,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1828191149, now seen corresponding path program 1 times [2019-09-10 08:28:39,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:39,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:39,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:39,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:39,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:41,022 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 08:28:41,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:41,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:28:41,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:41,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:28:41,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:28:41,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:28:41,024 INFO L87 Difference]: Start difference. First operand 28550 states and 42052 transitions. Second operand 17 states. [2019-09-10 08:28:41,790 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 08:28:41,940 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:28:42,297 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 08:28:42,479 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:28:42,662 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:28:42,950 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:28:43,309 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 08:28:43,489 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:28:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:43,952 INFO L93 Difference]: Finished difference Result 52533 states and 77528 transitions. [2019-09-10 08:28:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:28:43,952 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 129 [2019-09-10 08:28:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:44,017 INFO L225 Difference]: With dead ends: 52533 [2019-09-10 08:28:44,017 INFO L226 Difference]: Without dead ends: 52529 [2019-09-10 08:28:44,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:28:44,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52529 states. [2019-09-10 08:28:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52529 to 26343. [2019-09-10 08:28:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26343 states. [2019-09-10 08:28:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26343 states to 26343 states and 38847 transitions. [2019-09-10 08:28:44,475 INFO L78 Accepts]: Start accepts. Automaton has 26343 states and 38847 transitions. Word has length 129 [2019-09-10 08:28:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:44,475 INFO L475 AbstractCegarLoop]: Abstraction has 26343 states and 38847 transitions. [2019-09-10 08:28:44,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:28:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 26343 states and 38847 transitions. [2019-09-10 08:28:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:28:44,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:44,479 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:28:44,479 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:44,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:44,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2075775711, now seen corresponding path program 1 times [2019-09-10 08:28:44,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:44,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:44,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:44,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:44,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:44,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:44,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:28:44,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:44,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:28:44,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:28:44,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:28:44,614 INFO L87 Difference]: Start difference. First operand 26343 states and 38847 transitions. Second operand 7 states. [2019-09-10 08:28:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:45,431 INFO L93 Difference]: Finished difference Result 133917 states and 195426 transitions. [2019-09-10 08:28:45,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:28:45,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-10 08:28:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:45,594 INFO L225 Difference]: With dead ends: 133917 [2019-09-10 08:28:45,594 INFO L226 Difference]: Without dead ends: 133917 [2019-09-10 08:28:45,594 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 08:28:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133917 states. [2019-09-10 08:28:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133917 to 56247. [2019-09-10 08:28:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56247 states. [2019-09-10 08:28:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56247 states to 56247 states and 82731 transitions. [2019-09-10 08:28:46,622 INFO L78 Accepts]: Start accepts. Automaton has 56247 states and 82731 transitions. Word has length 164 [2019-09-10 08:28:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:46,623 INFO L475 AbstractCegarLoop]: Abstraction has 56247 states and 82731 transitions. [2019-09-10 08:28:46,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:28:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 56247 states and 82731 transitions. [2019-09-10 08:28:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:28:46,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:46,627 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:28:46,628 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:46,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:46,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1984049311, now seen corresponding path program 1 times [2019-09-10 08:28:46,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:46,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:46,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:46,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:46,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:46,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:46,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:28:46,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:46,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:28:46,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:28:46,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:28:46,745 INFO L87 Difference]: Start difference. First operand 56247 states and 82731 transitions. Second operand 7 states. [2019-09-10 08:28:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:48,248 INFO L93 Difference]: Finished difference Result 252789 states and 366870 transitions. [2019-09-10 08:28:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:28:48,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-10 08:28:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:48,560 INFO L225 Difference]: With dead ends: 252789 [2019-09-10 08:28:48,560 INFO L226 Difference]: Without dead ends: 252789 [2019-09-10 08:28:48,561 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 08:28:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252789 states. [2019-09-10 08:28:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252789 to 119775. [2019-09-10 08:28:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119775 states. [2019-09-10 08:28:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119775 states to 119775 states and 175707 transitions. [2019-09-10 08:28:50,683 INFO L78 Accepts]: Start accepts. Automaton has 119775 states and 175707 transitions. Word has length 164 [2019-09-10 08:28:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:50,684 INFO L475 AbstractCegarLoop]: Abstraction has 119775 states and 175707 transitions. [2019-09-10 08:28:50,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:28:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 119775 states and 175707 transitions. [2019-09-10 08:28:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:28:50,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:50,690 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:28:50,690 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:50,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:50,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1474728358, now seen corresponding path program 1 times [2019-09-10 08:28:50,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:50,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:50,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:50,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:50,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:50,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:28:50,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:28:50,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2019-09-10 08:28:50,836 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], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [157], [160], [163], [165], [169], [172], [175], [177], [181], [184], [187], [189], [193], [196], [199], [201], [205], [208], [211], [213], [217], [220], [223], [225], [229], [232], [235], [237], [240], [244], [247], [250], [254], [257], [261], [264], [267], [269], [272], [275], [278], [280], [283], [286], [289], [291], [294], [297], [300], [302], [305], [308], [311], [313], [316], [319], [322], [324], [326], [329], [332], [335], [337], [339], [342], [349], [351], [354], [355], [357], [375], [378], [386], [388], [391], [399], [401], [404], [412], [414], [417], [425], [427], [430], [438], [448], [473], [498], [523], [548], [577], [580], [583], [585], [600], [603], [605], [609], [612], [770], [771], [775], [776], [777] [2019-09-10 08:28:50,909 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:28:50,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:28:51,112 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:28:51,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:28:51,655 INFO L272 AbstractInterpreter]: Visited 156 different actions 285 times. Merged at 41 different actions 123 times. Never widened. Performed 1176 root evaluator evaluations with a maximum evaluation depth of 9. Performed 1176 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 8 fixpoints after 5 different actions. Largest state had 194 variables. [2019-09-10 08:28:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:51,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:28:51,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:28:51,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:28:51,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:51,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:28:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:51,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:28:51,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:28:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:52,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:28:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 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 08:28:52,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:28:52,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 08:28:52,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:28:52,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:28:52,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:28:52,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:28:52,166 INFO L87 Difference]: Start difference. First operand 119775 states and 175707 transitions. Second operand 11 states. [2019-09-10 08:28:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:54,575 INFO L93 Difference]: Finished difference Result 372405 states and 540918 transitions. [2019-09-10 08:28:54,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:28:54,576 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 164 [2019-09-10 08:28:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:55,520 INFO L225 Difference]: With dead ends: 372405 [2019-09-10 08:28:55,520 INFO L226 Difference]: Without dead ends: 372405 [2019-09-10 08:28:55,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 320 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:28:55,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372405 states. [2019-09-10 08:29:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372405 to 249805. [2019-09-10 08:29:03,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249805 states. [2019-09-10 08:29:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249805 states to 249805 states and 364633 transitions. [2019-09-10 08:29:04,219 INFO L78 Accepts]: Start accepts. Automaton has 249805 states and 364633 transitions. Word has length 164 [2019-09-10 08:29:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:04,219 INFO L475 AbstractCegarLoop]: Abstraction has 249805 states and 364633 transitions. [2019-09-10 08:29:04,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:29:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 249805 states and 364633 transitions. [2019-09-10 08:29:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:29:04,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:04,231 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:29:04,232 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:04,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:04,232 INFO L82 PathProgramCache]: Analyzing trace with hash -465450009, now seen corresponding path program 1 times [2019-09-10 08:29:04,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:04,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:04,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:04,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:04,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:04,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:04,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:29:04,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:04,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:29:04,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:29:04,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:04,416 INFO L87 Difference]: Start difference. First operand 249805 states and 364633 transitions. Second operand 7 states. [2019-09-10 08:29:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:06,845 INFO L93 Difference]: Finished difference Result 816067 states and 1173916 transitions. [2019-09-10 08:29:06,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:29:06,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-10 08:29:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:08,292 INFO L225 Difference]: With dead ends: 816067 [2019-09-10 08:29:08,293 INFO L226 Difference]: Without dead ends: 816067 [2019-09-10 08:29:08,293 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 08:29:08,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816067 states. [2019-09-10 08:29:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816067 to 529213. [2019-09-10 08:29:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529213 states. [2019-09-10 08:29:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529213 states to 529213 states and 770761 transitions. [2019-09-10 08:29:25,166 INFO L78 Accepts]: Start accepts. Automaton has 529213 states and 770761 transitions. Word has length 164 [2019-09-10 08:29:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:25,167 INFO L475 AbstractCegarLoop]: Abstraction has 529213 states and 770761 transitions. [2019-09-10 08:29:25,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:29:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 529213 states and 770761 transitions. [2019-09-10 08:29:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:29:25,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:25,175 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:29:25,176 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:25,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash -406758821, now seen corresponding path program 1 times [2019-09-10 08:29:25,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:25,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:25,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:25,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:25,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:25,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:25,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:29:25,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:25,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:29:25,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:29:25,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:25,304 INFO L87 Difference]: Start difference. First operand 529213 states and 770761 transitions. Second operand 7 states. [2019-09-10 08:29:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:47,617 INFO L93 Difference]: Finished difference Result 1899811 states and 2734540 transitions. [2019-09-10 08:29:47,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:29:47,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-10 08:29:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:50,714 INFO L225 Difference]: With dead ends: 1899811 [2019-09-10 08:29:50,714 INFO L226 Difference]: Without dead ends: 1899811 [2019-09-10 08:29:50,715 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 08:29:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899811 states. [2019-09-10 08:30:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899811 to 1117789. [2019-09-10 08:30:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117789 states. [2019-09-10 08:30:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117789 states to 1117789 states and 1624681 transitions. [2019-09-10 08:30:32,914 INFO L78 Accepts]: Start accepts. Automaton has 1117789 states and 1624681 transitions. Word has length 164 [2019-09-10 08:30:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:32,915 INFO L475 AbstractCegarLoop]: Abstraction has 1117789 states and 1624681 transitions. [2019-09-10 08:30:32,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:30:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1117789 states and 1624681 transitions. [2019-09-10 08:30:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:30:32,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:32,926 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:30:32,926 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:32,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:32,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1387854129, now seen corresponding path program 1 times [2019-09-10 08:30:32,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:32,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:32,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:32,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:32,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:33,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:33,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:30:33,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:33,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:30:33,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:30:33,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:30:33,066 INFO L87 Difference]: Start difference. First operand 1117789 states and 1624681 transitions. Second operand 7 states. [2019-09-10 08:31:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:06,068 INFO L93 Difference]: Finished difference Result 2994759 states and 4325437 transitions. [2019-09-10 08:31:06,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:31:06,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-10 08:31:06,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:13,431 INFO L225 Difference]: With dead ends: 2994759 [2019-09-10 08:31:13,431 INFO L226 Difference]: Without dead ends: 2994759 [2019-09-10 08:31:13,432 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 08:31:31,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994759 states.