java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:44:12,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:44:12,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:44:12,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:44:12,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:44:12,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:44:12,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:44:12,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:44:12,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:44:12,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:44:12,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:44:12,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:44:12,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:44:12,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:44:12,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:44:12,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:44:12,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:44:12,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:44:12,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:44:12,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:44:12,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:44:12,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:44:12,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:44:12,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:44:12,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:44:12,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:44:12,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:44:12,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:44:12,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:44:12,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:44:12,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:44:12,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:44:12,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:44:12,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:44:12,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:44:12,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:44:12,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:44:12,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:44:12,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:44:12,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:44:12,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:44:12,855 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:44:12,876 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:44:12,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:44:12,877 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:44:12,878 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:44:12,878 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:44:12,878 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:44:12,879 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:44:12,879 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:44:12,879 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:44:12,879 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:44:12,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:44:12,882 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:44:12,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:44:12,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:44:12,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:44:12,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:44:12,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:44:12,884 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:44:12,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:44:12,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:44:12,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:44:12,885 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:44:12,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:44:12,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:44:12,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:44:12,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:44:12,887 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:44:12,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:44:12,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:44:12,887 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:44:12,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:44:12,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:44:12,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:44:12,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:44:12,953 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:44:12,954 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:44:13,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be9ab14b/a6162d2584d649b18bcd3beb69c7cc04/FLAGd0bae26ac [2019-09-10 06:44:13,747 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:44:13,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:44:13,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be9ab14b/a6162d2584d649b18bcd3beb69c7cc04/FLAGd0bae26ac [2019-09-10 06:44:13,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be9ab14b/a6162d2584d649b18bcd3beb69c7cc04 [2019-09-10 06:44:13,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:44:13,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:44:13,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:44:13,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:44:13,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:44:13,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:44:13" (1/1) ... [2019-09-10 06:44:13,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@200f2ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:44:13, skipping insertion in model container [2019-09-10 06:44:13,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:44:13" (1/1) ... [2019-09-10 06:44:13,840 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:44:13,989 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:44:15,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:44:15,093 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:44:15,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:44:15,572 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:44:15,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:44:15 WrapperNode [2019-09-10 06:44:15,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:44:15,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:44:15,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:44:15,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:44:15,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:44:15" (1/1) ... [2019-09-10 06:44:15,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:44:15" (1/1) ... [2019-09-10 06:44:15,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:44:15" (1/1) ... [2019-09-10 06:44:15,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:44:15" (1/1) ... [2019-09-10 06:44:15,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:44:15" (1/1) ... [2019-09-10 06:44:15,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:44:15" (1/1) ... [2019-09-10 06:44:15,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:44:15" (1/1) ... [2019-09-10 06:44:15,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:44:15,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:44:15,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:44:15,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:44:15,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:44:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:44:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:44:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:44:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:44:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:44:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:44:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:44:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:44:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:44:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:44:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:44:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:44:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:44:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:44:15,892 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:44:15,892 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:44:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:44:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:44:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:44:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:44:18,884 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:44:18,884 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:44:18,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:44:18 BoogieIcfgContainer [2019-09-10 06:44:18,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:44:18,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:44:18,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:44:18,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:44:18,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:44:13" (1/3) ... [2019-09-10 06:44:18,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3049506e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:44:18, skipping insertion in model container [2019-09-10 06:44:18,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:44:15" (2/3) ... [2019-09-10 06:44:18,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3049506e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:44:18, skipping insertion in model container [2019-09-10 06:44:18,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:44:18" (3/3) ... [2019-09-10 06:44:18,901 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:44:18,911 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:44:18,929 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-10 06:44:18,946 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-10 06:44:18,973 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:44:18,974 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:44:18,974 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:44:18,974 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:44:18,974 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:44:18,974 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:44:18,974 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:44:18,974 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:44:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states. [2019-09-10 06:44:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:44:19,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:19,053 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] [2019-09-10 06:44:19,058 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:19,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:19,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2082146872, now seen corresponding path program 1 times [2019-09-10 06:44:19,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:19,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:19,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:19,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:19,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:19,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:19,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:44:19,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:19,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:44:19,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:44:19,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:44:19,641 INFO L87 Difference]: Start difference. First operand 1126 states. Second operand 6 states. [2019-09-10 06:44:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:21,387 INFO L93 Difference]: Finished difference Result 1441 states and 2485 transitions. [2019-09-10 06:44:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:44:21,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-10 06:44:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:21,413 INFO L225 Difference]: With dead ends: 1441 [2019-09-10 06:44:21,413 INFO L226 Difference]: Without dead ends: 1429 [2019-09-10 06:44:21,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:44:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2019-09-10 06:44:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1413. [2019-09-10 06:44:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-09-10 06:44:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1913 transitions. [2019-09-10 06:44:21,549 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1913 transitions. Word has length 55 [2019-09-10 06:44:21,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:21,551 INFO L475 AbstractCegarLoop]: Abstraction has 1413 states and 1913 transitions. [2019-09-10 06:44:21,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:44:21,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1913 transitions. [2019-09-10 06:44:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:44:21,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:21,557 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] [2019-09-10 06:44:21,557 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:21,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:21,558 INFO L82 PathProgramCache]: Analyzing trace with hash 995005511, now seen corresponding path program 1 times [2019-09-10 06:44:21,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:21,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:21,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:21,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:21,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:21,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:21,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:44:21,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:21,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:44:21,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:44:21,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:44:21,760 INFO L87 Difference]: Start difference. First operand 1413 states and 1913 transitions. Second operand 6 states. [2019-09-10 06:44:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:22,956 INFO L93 Difference]: Finished difference Result 2341 states and 3221 transitions. [2019-09-10 06:44:22,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:44:22,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-10 06:44:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:22,969 INFO L225 Difference]: With dead ends: 2341 [2019-09-10 06:44:22,969 INFO L226 Difference]: Without dead ends: 2341 [2019-09-10 06:44:22,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:44:22,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2019-09-10 06:44:23,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2321. [2019-09-10 06:44:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-09-10 06:44:23,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3206 transitions. [2019-09-10 06:44:23,032 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3206 transitions. Word has length 55 [2019-09-10 06:44:23,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:23,033 INFO L475 AbstractCegarLoop]: Abstraction has 2321 states and 3206 transitions. [2019-09-10 06:44:23,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:44:23,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3206 transitions. [2019-09-10 06:44:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:44:23,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:23,039 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] [2019-09-10 06:44:23,040 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:23,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:23,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1195094756, now seen corresponding path program 1 times [2019-09-10 06:44:23,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:23,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:23,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:23,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:23,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:23,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:23,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:44:23,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:23,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:44:23,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:44:23,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:44:23,275 INFO L87 Difference]: Start difference. First operand 2321 states and 3206 transitions. Second operand 5 states. [2019-09-10 06:44:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:24,484 INFO L93 Difference]: Finished difference Result 3583 states and 4932 transitions. [2019-09-10 06:44:24,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:44:24,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-10 06:44:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:24,503 INFO L225 Difference]: With dead ends: 3583 [2019-09-10 06:44:24,503 INFO L226 Difference]: Without dead ends: 3583 [2019-09-10 06:44:24,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:44:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3583 states. [2019-09-10 06:44:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3577. [2019-09-10 06:44:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-09-10 06:44:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4928 transitions. [2019-09-10 06:44:24,595 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4928 transitions. Word has length 55 [2019-09-10 06:44:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:24,597 INFO L475 AbstractCegarLoop]: Abstraction has 3577 states and 4928 transitions. [2019-09-10 06:44:24,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:44:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4928 transitions. [2019-09-10 06:44:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:44:24,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:24,602 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] [2019-09-10 06:44:24,602 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:24,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:24,603 INFO L82 PathProgramCache]: Analyzing trace with hash 103967417, now seen corresponding path program 1 times [2019-09-10 06:44:24,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:24,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:24,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:24,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:24,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:24,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:24,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:44:24,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:24,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:44:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:44:24,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:44:24,823 INFO L87 Difference]: Start difference. First operand 3577 states and 4928 transitions. Second operand 9 states. [2019-09-10 06:44:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:27,723 INFO L93 Difference]: Finished difference Result 9061 states and 13357 transitions. [2019-09-10 06:44:27,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:44:27,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-09-10 06:44:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:27,765 INFO L225 Difference]: With dead ends: 9061 [2019-09-10 06:44:27,765 INFO L226 Difference]: Without dead ends: 9061 [2019-09-10 06:44:27,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:44:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9061 states. [2019-09-10 06:44:27,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9061 to 3577. [2019-09-10 06:44:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-09-10 06:44:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4927 transitions. [2019-09-10 06:44:27,921 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4927 transitions. Word has length 56 [2019-09-10 06:44:27,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:27,922 INFO L475 AbstractCegarLoop]: Abstraction has 3577 states and 4927 transitions. [2019-09-10 06:44:27,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:44:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4927 transitions. [2019-09-10 06:44:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:44:27,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:27,928 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] [2019-09-10 06:44:27,928 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:27,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:27,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1702566800, now seen corresponding path program 1 times [2019-09-10 06:44:27,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:27,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:27,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:28,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:28,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:44:28,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:28,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:44:28,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:44:28,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:44:28,130 INFO L87 Difference]: Start difference. First operand 3577 states and 4927 transitions. Second operand 9 states. [2019-09-10 06:44:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:31,655 INFO L93 Difference]: Finished difference Result 8656 states and 12483 transitions. [2019-09-10 06:44:31,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:44:31,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-09-10 06:44:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:31,695 INFO L225 Difference]: With dead ends: 8656 [2019-09-10 06:44:31,696 INFO L226 Difference]: Without dead ends: 8656 [2019-09-10 06:44:31,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:44:31,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2019-09-10 06:44:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 3577. [2019-09-10 06:44:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-09-10 06:44:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4926 transitions. [2019-09-10 06:44:31,843 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4926 transitions. Word has length 56 [2019-09-10 06:44:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:31,844 INFO L475 AbstractCegarLoop]: Abstraction has 3577 states and 4926 transitions. [2019-09-10 06:44:31,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:44:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4926 transitions. [2019-09-10 06:44:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:44:31,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:31,849 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] [2019-09-10 06:44:31,849 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:31,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:31,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1133124815, now seen corresponding path program 1 times [2019-09-10 06:44:31,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:31,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:31,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:31,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:31,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:32,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:32,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:44:32,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:32,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:44:32,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:44:32,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:44:32,030 INFO L87 Difference]: Start difference. First operand 3577 states and 4926 transitions. Second operand 8 states. [2019-09-10 06:44:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:34,241 INFO L93 Difference]: Finished difference Result 8332 states and 12370 transitions. [2019-09-10 06:44:34,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:44:34,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-09-10 06:44:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:34,271 INFO L225 Difference]: With dead ends: 8332 [2019-09-10 06:44:34,271 INFO L226 Difference]: Without dead ends: 8332 [2019-09-10 06:44:34,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:44:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8332 states. [2019-09-10 06:44:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8332 to 3577. [2019-09-10 06:44:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-09-10 06:44:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4925 transitions. [2019-09-10 06:44:34,366 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4925 transitions. Word has length 56 [2019-09-10 06:44:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:34,366 INFO L475 AbstractCegarLoop]: Abstraction has 3577 states and 4925 transitions. [2019-09-10 06:44:34,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:44:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4925 transitions. [2019-09-10 06:44:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:44:34,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:34,371 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] [2019-09-10 06:44:34,372 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:34,372 INFO L82 PathProgramCache]: Analyzing trace with hash 609358766, now seen corresponding path program 1 times [2019-09-10 06:44:34,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:34,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:34,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:34,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:34,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:34,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:34,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:44:34,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:34,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:44:34,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:44:34,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:34,447 INFO L87 Difference]: Start difference. First operand 3577 states and 4925 transitions. Second operand 3 states. [2019-09-10 06:44:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:34,520 INFO L93 Difference]: Finished difference Result 3990 states and 5575 transitions. [2019-09-10 06:44:34,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:44:34,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-10 06:44:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:34,533 INFO L225 Difference]: With dead ends: 3990 [2019-09-10 06:44:34,533 INFO L226 Difference]: Without dead ends: 3990 [2019-09-10 06:44:34,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:34,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2019-09-10 06:44:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3684. [2019-09-10 06:44:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3684 states. [2019-09-10 06:44:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 5107 transitions. [2019-09-10 06:44:34,593 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 5107 transitions. Word has length 57 [2019-09-10 06:44:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:34,596 INFO L475 AbstractCegarLoop]: Abstraction has 3684 states and 5107 transitions. [2019-09-10 06:44:34,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:44:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 5107 transitions. [2019-09-10 06:44:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:44:34,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:34,601 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] [2019-09-10 06:44:34,601 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:34,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:34,601 INFO L82 PathProgramCache]: Analyzing trace with hash 371035602, now seen corresponding path program 1 times [2019-09-10 06:44:34,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:34,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:34,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:34,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:34,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:34,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:34,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:44:34,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:34,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:44:34,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:44:34,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:34,696 INFO L87 Difference]: Start difference. First operand 3684 states and 5107 transitions. Second operand 3 states. [2019-09-10 06:44:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:34,813 INFO L93 Difference]: Finished difference Result 4626 states and 6563 transitions. [2019-09-10 06:44:34,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:44:34,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-10 06:44:34,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:34,823 INFO L225 Difference]: With dead ends: 4626 [2019-09-10 06:44:34,824 INFO L226 Difference]: Without dead ends: 4626 [2019-09-10 06:44:34,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2019-09-10 06:44:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4174. [2019-09-10 06:44:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-09-10 06:44:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 5875 transitions. [2019-09-10 06:44:34,893 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 5875 transitions. Word has length 57 [2019-09-10 06:44:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:34,893 INFO L475 AbstractCegarLoop]: Abstraction has 4174 states and 5875 transitions. [2019-09-10 06:44:34,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:44:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 5875 transitions. [2019-09-10 06:44:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:44:34,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:34,898 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] [2019-09-10 06:44:34,898 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:34,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:34,898 INFO L82 PathProgramCache]: Analyzing trace with hash -369094904, now seen corresponding path program 1 times [2019-09-10 06:44:34,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:34,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:34,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:34,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:34,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:44:34,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:34,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:44:34,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:44:34,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:34,995 INFO L87 Difference]: Start difference. First operand 4174 states and 5875 transitions. Second operand 3 states. [2019-09-10 06:44:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:35,112 INFO L93 Difference]: Finished difference Result 5370 states and 7646 transitions. [2019-09-10 06:44:35,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:44:35,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-10 06:44:35,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:35,123 INFO L225 Difference]: With dead ends: 5370 [2019-09-10 06:44:35,123 INFO L226 Difference]: Without dead ends: 5370 [2019-09-10 06:44:35,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:35,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5370 states. [2019-09-10 06:44:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5370 to 5368. [2019-09-10 06:44:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5368 states. [2019-09-10 06:44:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7645 transitions. [2019-09-10 06:44:35,214 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7645 transitions. Word has length 57 [2019-09-10 06:44:35,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:35,215 INFO L475 AbstractCegarLoop]: Abstraction has 5368 states and 7645 transitions. [2019-09-10 06:44:35,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:44:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7645 transitions. [2019-09-10 06:44:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:44:35,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:35,219 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] [2019-09-10 06:44:35,219 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:35,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:35,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2011629158, now seen corresponding path program 1 times [2019-09-10 06:44:35,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:35,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:35,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:35,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:35,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:35,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:35,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:44:35,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:35,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:44:35,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:44:35,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:35,419 INFO L87 Difference]: Start difference. First operand 5368 states and 7645 transitions. Second operand 3 states. [2019-09-10 06:44:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:35,602 INFO L93 Difference]: Finished difference Result 8089 states and 11829 transitions. [2019-09-10 06:44:35,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:44:35,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 06:44:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:35,637 INFO L225 Difference]: With dead ends: 8089 [2019-09-10 06:44:35,637 INFO L226 Difference]: Without dead ends: 8089 [2019-09-10 06:44:35,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:35,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2019-09-10 06:44:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 6379. [2019-09-10 06:44:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6379 states. [2019-09-10 06:44:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 9282 transitions. [2019-09-10 06:44:35,771 INFO L78 Accepts]: Start accepts. Automaton has 6379 states and 9282 transitions. Word has length 58 [2019-09-10 06:44:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:35,772 INFO L475 AbstractCegarLoop]: Abstraction has 6379 states and 9282 transitions. [2019-09-10 06:44:35,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:44:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 9282 transitions. [2019-09-10 06:44:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:44:35,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:35,780 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] [2019-09-10 06:44:35,781 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:35,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:35,781 INFO L82 PathProgramCache]: Analyzing trace with hash 883688950, now seen corresponding path program 1 times [2019-09-10 06:44:35,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:35,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:35,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:35,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:35,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:44:35,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:35,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:44:35,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:44:35,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:35,861 INFO L87 Difference]: Start difference. First operand 6379 states and 9282 transitions. Second operand 3 states. [2019-09-10 06:44:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:35,966 INFO L93 Difference]: Finished difference Result 10378 states and 15336 transitions. [2019-09-10 06:44:35,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:44:35,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 06:44:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:35,986 INFO L225 Difference]: With dead ends: 10378 [2019-09-10 06:44:35,987 INFO L226 Difference]: Without dead ends: 10378 [2019-09-10 06:44:35,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-09-10 06:44:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 8062. [2019-09-10 06:44:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8062 states. [2019-09-10 06:44:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8062 states to 8062 states and 11884 transitions. [2019-09-10 06:44:36,151 INFO L78 Accepts]: Start accepts. Automaton has 8062 states and 11884 transitions. Word has length 58 [2019-09-10 06:44:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:36,151 INFO L475 AbstractCegarLoop]: Abstraction has 8062 states and 11884 transitions. [2019-09-10 06:44:36,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:44:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 8062 states and 11884 transitions. [2019-09-10 06:44:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:44:36,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:36,155 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] [2019-09-10 06:44:36,155 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:36,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:36,156 INFO L82 PathProgramCache]: Analyzing trace with hash -550232989, now seen corresponding path program 1 times [2019-09-10 06:44:36,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:36,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:36,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:36,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:36,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:44:36,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:36,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:44:36,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:44:36,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:44:36,787 INFO L87 Difference]: Start difference. First operand 8062 states and 11884 transitions. Second operand 13 states. [2019-09-10 06:44:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:38,496 INFO L93 Difference]: Finished difference Result 9426 states and 13832 transitions. [2019-09-10 06:44:38,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:44:38,496 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-09-10 06:44:38,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:38,511 INFO L225 Difference]: With dead ends: 9426 [2019-09-10 06:44:38,511 INFO L226 Difference]: Without dead ends: 9426 [2019-09-10 06:44:38,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:44:38,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9426 states. [2019-09-10 06:44:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9426 to 8058. [2019-09-10 06:44:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8058 states. [2019-09-10 06:44:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8058 states to 8058 states and 11880 transitions. [2019-09-10 06:44:38,648 INFO L78 Accepts]: Start accepts. Automaton has 8058 states and 11880 transitions. Word has length 59 [2019-09-10 06:44:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:38,649 INFO L475 AbstractCegarLoop]: Abstraction has 8058 states and 11880 transitions. [2019-09-10 06:44:38,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:44:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 8058 states and 11880 transitions. [2019-09-10 06:44:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:44:38,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:38,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:38,651 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash 74715795, now seen corresponding path program 1 times [2019-09-10 06:44:38,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:38,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:38,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:38,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:39,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:39,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:44:39,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:39,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:44:39,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:44:39,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:44:39,242 INFO L87 Difference]: Start difference. First operand 8058 states and 11880 transitions. Second operand 14 states. [2019-09-10 06:44:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:42,554 INFO L93 Difference]: Finished difference Result 16927 states and 24957 transitions. [2019-09-10 06:44:42,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:44:42,555 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-09-10 06:44:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:42,580 INFO L225 Difference]: With dead ends: 16927 [2019-09-10 06:44:42,580 INFO L226 Difference]: Without dead ends: 16927 [2019-09-10 06:44:42,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:44:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16927 states. [2019-09-10 06:44:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16927 to 8001. [2019-09-10 06:44:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8001 states. [2019-09-10 06:44:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 11805 transitions. [2019-09-10 06:44:42,763 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 11805 transitions. Word has length 59 [2019-09-10 06:44:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:42,764 INFO L475 AbstractCegarLoop]: Abstraction has 8001 states and 11805 transitions. [2019-09-10 06:44:42,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:44:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 11805 transitions. [2019-09-10 06:44:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:44:42,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:42,766 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] [2019-09-10 06:44:42,767 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:42,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:42,767 INFO L82 PathProgramCache]: Analyzing trace with hash -670303844, now seen corresponding path program 1 times [2019-09-10 06:44:42,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:42,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:42,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:42,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:42,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:43,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:43,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:44:43,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:43,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:44:43,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:44:43,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:44:43,421 INFO L87 Difference]: Start difference. First operand 8001 states and 11805 transitions. Second operand 16 states. [2019-09-10 06:44:44,091 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 06:44:44,854 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 06:44:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:47,748 INFO L93 Difference]: Finished difference Result 22456 states and 33324 transitions. [2019-09-10 06:44:47,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:44:47,748 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2019-09-10 06:44:47,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:47,780 INFO L225 Difference]: With dead ends: 22456 [2019-09-10 06:44:47,780 INFO L226 Difference]: Without dead ends: 22456 [2019-09-10 06:44:47,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:44:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22456 states. [2019-09-10 06:44:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22456 to 7997. [2019-09-10 06:44:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7997 states. [2019-09-10 06:44:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7997 states to 7997 states and 11801 transitions. [2019-09-10 06:44:47,995 INFO L78 Accepts]: Start accepts. Automaton has 7997 states and 11801 transitions. Word has length 60 [2019-09-10 06:44:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:47,995 INFO L475 AbstractCegarLoop]: Abstraction has 7997 states and 11801 transitions. [2019-09-10 06:44:47,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:44:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 7997 states and 11801 transitions. [2019-09-10 06:44:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 06:44:47,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:48,000 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] [2019-09-10 06:44:48,000 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:48,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:48,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1596599088, now seen corresponding path program 1 times [2019-09-10 06:44:48,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:48,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:48,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:48,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:48,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:48,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:48,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:44:48,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:48,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:44:48,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:44:48,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:44:48,097 INFO L87 Difference]: Start difference. First operand 7997 states and 11801 transitions. Second operand 6 states. [2019-09-10 06:44:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:48,306 INFO L93 Difference]: Finished difference Result 28605 states and 41287 transitions. [2019-09-10 06:44:48,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:44:48,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-10 06:44:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:48,338 INFO L225 Difference]: With dead ends: 28605 [2019-09-10 06:44:48,338 INFO L226 Difference]: Without dead ends: 28605 [2019-09-10 06:44:48,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:44:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28605 states. [2019-09-10 06:44:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28605 to 25017. [2019-09-10 06:44:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25017 states. [2019-09-10 06:44:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25017 states to 25017 states and 36160 transitions. [2019-09-10 06:44:49,324 INFO L78 Accepts]: Start accepts. Automaton has 25017 states and 36160 transitions. Word has length 64 [2019-09-10 06:44:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:49,324 INFO L475 AbstractCegarLoop]: Abstraction has 25017 states and 36160 transitions. [2019-09-10 06:44:49,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:44:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 25017 states and 36160 transitions. [2019-09-10 06:44:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:44:49,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:49,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:49,328 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:49,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:49,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1766576601, now seen corresponding path program 1 times [2019-09-10 06:44:49,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:49,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:49,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:49,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:49,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:49,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:49,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:44:49,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:49,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:44:49,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:44:49,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:44:49,432 INFO L87 Difference]: Start difference. First operand 25017 states and 36160 transitions. Second operand 6 states. [2019-09-10 06:44:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:49,633 INFO L93 Difference]: Finished difference Result 43976 states and 62195 transitions. [2019-09-10 06:44:49,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:44:49,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-10 06:44:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:49,709 INFO L225 Difference]: With dead ends: 43976 [2019-09-10 06:44:49,709 INFO L226 Difference]: Without dead ends: 43976 [2019-09-10 06:44:49,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:44:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43976 states. [2019-09-10 06:44:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43976 to 25983. [2019-09-10 06:44:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25983 states. [2019-09-10 06:44:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25983 states to 25983 states and 36944 transitions. [2019-09-10 06:44:50,278 INFO L78 Accepts]: Start accepts. Automaton has 25983 states and 36944 transitions. Word has length 65 [2019-09-10 06:44:50,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:50,278 INFO L475 AbstractCegarLoop]: Abstraction has 25983 states and 36944 transitions. [2019-09-10 06:44:50,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:44:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 25983 states and 36944 transitions. [2019-09-10 06:44:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:44:50,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:50,283 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] [2019-09-10 06:44:50,283 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:50,284 INFO L82 PathProgramCache]: Analyzing trace with hash -913257528, now seen corresponding path program 1 times [2019-09-10 06:44:50,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:50,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:50,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:50,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:50,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:50,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:50,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:44:50,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:50,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:44:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:44:50,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:50,351 INFO L87 Difference]: Start difference. First operand 25983 states and 36944 transitions. Second operand 3 states. [2019-09-10 06:44:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:50,592 INFO L93 Difference]: Finished difference Result 44623 states and 62454 transitions. [2019-09-10 06:44:50,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:44:50,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 06:44:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:50,656 INFO L225 Difference]: With dead ends: 44623 [2019-09-10 06:44:50,657 INFO L226 Difference]: Without dead ends: 44623 [2019-09-10 06:44:50,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44623 states. [2019-09-10 06:44:51,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44623 to 43991. [2019-09-10 06:44:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43991 states. [2019-09-10 06:44:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43991 states to 43991 states and 61823 transitions. [2019-09-10 06:44:51,321 INFO L78 Accepts]: Start accepts. Automaton has 43991 states and 61823 transitions. Word has length 66 [2019-09-10 06:44:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:51,321 INFO L475 AbstractCegarLoop]: Abstraction has 43991 states and 61823 transitions. [2019-09-10 06:44:51,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:44:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 43991 states and 61823 transitions. [2019-09-10 06:44:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:44:51,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:51,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:51,325 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:51,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:51,325 INFO L82 PathProgramCache]: Analyzing trace with hash 476487767, now seen corresponding path program 1 times [2019-09-10 06:44:51,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:51,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:51,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:51,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:51,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:44:51,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:51,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:44:51,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:44:51,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:51,393 INFO L87 Difference]: Start difference. First operand 43991 states and 61823 transitions. Second operand 3 states. [2019-09-10 06:44:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:51,533 INFO L93 Difference]: Finished difference Result 43976 states and 60775 transitions. [2019-09-10 06:44:51,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:44:51,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 06:44:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:51,591 INFO L225 Difference]: With dead ends: 43976 [2019-09-10 06:44:51,591 INFO L226 Difference]: Without dead ends: 43976 [2019-09-10 06:44:51,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43976 states. [2019-09-10 06:44:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43976 to 34224. [2019-09-10 06:44:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34224 states. [2019-09-10 06:44:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34224 states to 34224 states and 47332 transitions. [2019-09-10 06:44:51,957 INFO L78 Accepts]: Start accepts. Automaton has 34224 states and 47332 transitions. Word has length 70 [2019-09-10 06:44:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:51,957 INFO L475 AbstractCegarLoop]: Abstraction has 34224 states and 47332 transitions. [2019-09-10 06:44:51,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:44:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 34224 states and 47332 transitions. [2019-09-10 06:44:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:44:51,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:51,961 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:51,961 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:51,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:51,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2006601938, now seen corresponding path program 1 times [2019-09-10 06:44:51,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:51,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:51,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:52,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:52,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:44:52,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:52,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:44:52,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:44:52,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:44:52,037 INFO L87 Difference]: Start difference. First operand 34224 states and 47332 transitions. Second operand 5 states. [2019-09-10 06:44:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:53,364 INFO L93 Difference]: Finished difference Result 74041 states and 99411 transitions. [2019-09-10 06:44:53,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:44:53,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-10 06:44:53,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:53,452 INFO L225 Difference]: With dead ends: 74041 [2019-09-10 06:44:53,452 INFO L226 Difference]: Without dead ends: 74041 [2019-09-10 06:44:53,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:44:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74041 states. [2019-09-10 06:44:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74041 to 41508. [2019-09-10 06:44:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41508 states. [2019-09-10 06:44:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41508 states to 41508 states and 56019 transitions. [2019-09-10 06:44:54,064 INFO L78 Accepts]: Start accepts. Automaton has 41508 states and 56019 transitions. Word has length 70 [2019-09-10 06:44:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:54,064 INFO L475 AbstractCegarLoop]: Abstraction has 41508 states and 56019 transitions. [2019-09-10 06:44:54,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:44:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 41508 states and 56019 transitions. [2019-09-10 06:44:54,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:44:54,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:54,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:54,069 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:54,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:54,069 INFO L82 PathProgramCache]: Analyzing trace with hash 538296260, now seen corresponding path program 1 times [2019-09-10 06:44:54,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:54,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:54,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:54,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:54,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:54,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:54,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:44:54,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:54,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:44:54,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:44:54,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:44:54,147 INFO L87 Difference]: Start difference. First operand 41508 states and 56019 transitions. Second operand 5 states. [2019-09-10 06:44:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:55,189 INFO L93 Difference]: Finished difference Result 115929 states and 153737 transitions. [2019-09-10 06:44:55,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:44:55,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 06:44:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:55,323 INFO L225 Difference]: With dead ends: 115929 [2019-09-10 06:44:55,323 INFO L226 Difference]: Without dead ends: 115929 [2019-09-10 06:44:55,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:44:55,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115929 states. [2019-09-10 06:44:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115929 to 77833. [2019-09-10 06:44:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77833 states. [2019-09-10 06:44:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77833 states to 77833 states and 104635 transitions. [2019-09-10 06:44:56,333 INFO L78 Accepts]: Start accepts. Automaton has 77833 states and 104635 transitions. Word has length 75 [2019-09-10 06:44:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:56,334 INFO L475 AbstractCegarLoop]: Abstraction has 77833 states and 104635 transitions. [2019-09-10 06:44:56,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:44:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 77833 states and 104635 transitions. [2019-09-10 06:44:56,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:44:56,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:56,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:56,340 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:56,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:56,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1290568497, now seen corresponding path program 1 times [2019-09-10 06:44:56,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:56,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:56,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:56,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:56,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:57,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:57,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:44:57,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:57,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:44:57,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:44:57,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:57,654 INFO L87 Difference]: Start difference. First operand 77833 states and 104635 transitions. Second operand 3 states. [2019-09-10 06:44:57,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:57,928 INFO L93 Difference]: Finished difference Result 138937 states and 182594 transitions. [2019-09-10 06:44:57,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:44:57,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:44:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:58,076 INFO L225 Difference]: With dead ends: 138937 [2019-09-10 06:44:58,076 INFO L226 Difference]: Without dead ends: 138937 [2019-09-10 06:44:58,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138937 states. [2019-09-10 06:44:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138937 to 100119. [2019-09-10 06:44:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100119 states. [2019-09-10 06:44:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100119 states to 100119 states and 132191 transitions. [2019-09-10 06:44:59,385 INFO L78 Accepts]: Start accepts. Automaton has 100119 states and 132191 transitions. Word has length 78 [2019-09-10 06:44:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:59,386 INFO L475 AbstractCegarLoop]: Abstraction has 100119 states and 132191 transitions. [2019-09-10 06:44:59,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:44:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 100119 states and 132191 transitions. [2019-09-10 06:44:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:44:59,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:59,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:59,392 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:59,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:59,392 INFO L82 PathProgramCache]: Analyzing trace with hash 162122952, now seen corresponding path program 1 times [2019-09-10 06:44:59,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:59,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:59,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:59,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:59,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:59,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:59,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:44:59,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:59,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:44:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:44:59,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:59,454 INFO L87 Difference]: Start difference. First operand 100119 states and 132191 transitions. Second operand 3 states. [2019-09-10 06:44:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:59,776 INFO L93 Difference]: Finished difference Result 131078 states and 169023 transitions. [2019-09-10 06:44:59,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:44:59,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 06:44:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:59,912 INFO L225 Difference]: With dead ends: 131078 [2019-09-10 06:44:59,912 INFO L226 Difference]: Without dead ends: 131078 [2019-09-10 06:44:59,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:44:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131078 states. [2019-09-10 06:45:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131078 to 101440. [2019-09-10 06:45:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101440 states. [2019-09-10 06:45:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101440 states to 101440 states and 131668 transitions. [2019-09-10 06:45:01,514 INFO L78 Accepts]: Start accepts. Automaton has 101440 states and 131668 transitions. Word has length 81 [2019-09-10 06:45:01,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:01,515 INFO L475 AbstractCegarLoop]: Abstraction has 101440 states and 131668 transitions. [2019-09-10 06:45:01,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 101440 states and 131668 transitions. [2019-09-10 06:45:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:45:01,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:01,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:45:01,521 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:01,522 INFO L82 PathProgramCache]: Analyzing trace with hash 328610332, now seen corresponding path program 1 times [2019-09-10 06:45:01,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:01,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:01,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:01,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:01,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:01,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:01,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:45:01,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:01,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:45:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:45:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:45:01,661 INFO L87 Difference]: Start difference. First operand 101440 states and 131668 transitions. Second operand 6 states. [2019-09-10 06:45:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:02,205 INFO L93 Difference]: Finished difference Result 141044 states and 183200 transitions. [2019-09-10 06:45:02,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:45:02,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 06:45:02,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:02,355 INFO L225 Difference]: With dead ends: 141044 [2019-09-10 06:45:02,355 INFO L226 Difference]: Without dead ends: 141044 [2019-09-10 06:45:02,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:45:02,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141044 states. [2019-09-10 06:45:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141044 to 128494. [2019-09-10 06:45:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128494 states. [2019-09-10 06:45:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128494 states to 128494 states and 166948 transitions. [2019-09-10 06:45:05,821 INFO L78 Accepts]: Start accepts. Automaton has 128494 states and 166948 transitions. Word has length 84 [2019-09-10 06:45:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:05,821 INFO L475 AbstractCegarLoop]: Abstraction has 128494 states and 166948 transitions. [2019-09-10 06:45:05,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:45:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 128494 states and 166948 transitions. [2019-09-10 06:45:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:45:05,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:05,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:45:05,828 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:05,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1028439201, now seen corresponding path program 1 times [2019-09-10 06:45:05,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:05,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:05,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:05,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:05,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:05,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:05,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:45:05,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:05,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:45:05,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:45:05,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:05,894 INFO L87 Difference]: Start difference. First operand 128494 states and 166948 transitions. Second operand 3 states. [2019-09-10 06:45:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:06,288 INFO L93 Difference]: Finished difference Result 145934 states and 185379 transitions. [2019-09-10 06:45:06,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:45:06,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 06:45:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:06,471 INFO L225 Difference]: With dead ends: 145934 [2019-09-10 06:45:06,472 INFO L226 Difference]: Without dead ends: 145934 [2019-09-10 06:45:06,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145934 states. [2019-09-10 06:45:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145934 to 138552. [2019-09-10 06:45:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138552 states. [2019-09-10 06:45:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138552 states to 138552 states and 177182 transitions. [2019-09-10 06:45:08,608 INFO L78 Accepts]: Start accepts. Automaton has 138552 states and 177182 transitions. Word has length 84 [2019-09-10 06:45:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:08,608 INFO L475 AbstractCegarLoop]: Abstraction has 138552 states and 177182 transitions. [2019-09-10 06:45:08,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 138552 states and 177182 transitions. [2019-09-10 06:45:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 06:45:08,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:08,615 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:45:08,615 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:08,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash -217793458, now seen corresponding path program 1 times [2019-09-10 06:45:08,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:08,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:08,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:08,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:45:08,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:08,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:45:08,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:08,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:45:08,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:45:08,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:45:08,729 INFO L87 Difference]: Start difference. First operand 138552 states and 177182 transitions. Second operand 5 states. [2019-09-10 06:45:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:09,118 INFO L93 Difference]: Finished difference Result 71036 states and 89762 transitions. [2019-09-10 06:45:09,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:45:09,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 06:45:09,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:09,196 INFO L225 Difference]: With dead ends: 71036 [2019-09-10 06:45:09,196 INFO L226 Difference]: Without dead ends: 71036 [2019-09-10 06:45:09,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:45:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71036 states. [2019-09-10 06:45:12,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71036 to 68043. [2019-09-10 06:45:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68043 states. [2019-09-10 06:45:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68043 states to 68043 states and 86131 transitions. [2019-09-10 06:45:12,258 INFO L78 Accepts]: Start accepts. Automaton has 68043 states and 86131 transitions. Word has length 85 [2019-09-10 06:45:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:12,258 INFO L475 AbstractCegarLoop]: Abstraction has 68043 states and 86131 transitions. [2019-09-10 06:45:12,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:45:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 68043 states and 86131 transitions. [2019-09-10 06:45:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 06:45:12,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:12,264 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] [2019-09-10 06:45:12,264 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:12,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:12,265 INFO L82 PathProgramCache]: Analyzing trace with hash 708629354, now seen corresponding path program 1 times [2019-09-10 06:45:12,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:12,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:12,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:12,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:12,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:45:12,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:12,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:45:12,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:12,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:45:12,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:45:12,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:45:12,402 INFO L87 Difference]: Start difference. First operand 68043 states and 86131 transitions. Second operand 9 states. [2019-09-10 06:45:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:13,875 INFO L93 Difference]: Finished difference Result 153377 states and 193513 transitions. [2019-09-10 06:45:13,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:45:13,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 06:45:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:14,061 INFO L225 Difference]: With dead ends: 153377 [2019-09-10 06:45:14,061 INFO L226 Difference]: Without dead ends: 153377 [2019-09-10 06:45:14,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:45:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153377 states. [2019-09-10 06:45:15,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153377 to 68031. [2019-09-10 06:45:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68031 states. [2019-09-10 06:45:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68031 states to 68031 states and 86118 transitions. [2019-09-10 06:45:15,715 INFO L78 Accepts]: Start accepts. Automaton has 68031 states and 86118 transitions. Word has length 88 [2019-09-10 06:45:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:15,715 INFO L475 AbstractCegarLoop]: Abstraction has 68031 states and 86118 transitions. [2019-09-10 06:45:15,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:45:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 68031 states and 86118 transitions. [2019-09-10 06:45:15,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 06:45:15,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:15,721 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] [2019-09-10 06:45:15,722 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:15,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:15,722 INFO L82 PathProgramCache]: Analyzing trace with hash 48670285, now seen corresponding path program 1 times [2019-09-10 06:45:15,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:15,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:15,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:15,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:15,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:45:15,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:15,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:45:15,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:15,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:45:15,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:45:15,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:45:15,855 INFO L87 Difference]: Start difference. First operand 68031 states and 86118 transitions. Second operand 8 states. [2019-09-10 06:45:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:17,016 INFO L93 Difference]: Finished difference Result 131222 states and 166131 transitions. [2019-09-10 06:45:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:45:17,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-09-10 06:45:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:17,171 INFO L225 Difference]: With dead ends: 131222 [2019-09-10 06:45:17,171 INFO L226 Difference]: Without dead ends: 131222 [2019-09-10 06:45:17,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:45:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131222 states. [2019-09-10 06:45:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131222 to 68031. [2019-09-10 06:45:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68031 states. [2019-09-10 06:45:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68031 states to 68031 states and 86117 transitions. [2019-09-10 06:45:18,117 INFO L78 Accepts]: Start accepts. Automaton has 68031 states and 86117 transitions. Word has length 88 [2019-09-10 06:45:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:18,118 INFO L475 AbstractCegarLoop]: Abstraction has 68031 states and 86117 transitions. [2019-09-10 06:45:18,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:45:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 68031 states and 86117 transitions. [2019-09-10 06:45:18,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 06:45:18,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:18,124 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] [2019-09-10 06:45:18,124 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:18,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:18,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1485835272, now seen corresponding path program 1 times [2019-09-10 06:45:18,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:18,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:18,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:18,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:18,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:18,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:18,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:45:18,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-09-10 06:45:18,287 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [164], [167], [168], [170], [173], [178], [180], [201], [203], [3199], [3203], [3206], [3209], [3212], [3216], [3325], [3328], [3349], [3351], [3412], [3458], [3461], [3464], [3468], [3471], [3475], [3479], [3481], [3484], [3488], [3491], [3494], [3498], [3636], [3639], [3660], [3662], [3664], [3667], [3670], [3672], [3677], [3682], [3684], [3703], [3705], [3724], [3839], [3842], [3845], [3849], [3853], [3857], [3859], [3863], [3866], [3869], [3872], [3874], [4485], [4486], [4490], [4491], [4492] [2019-09-10 06:45:18,348 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:45:18,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:45:18,562 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:45:18,965 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:45:18,967 INFO L272 AbstractInterpreter]: Visited 84 different actions 214 times. Merged at 27 different actions 118 times. Widened at 5 different actions 5 times. Performed 1072 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1072 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 6 different actions. Largest state had 253 variables. [2019-09-10 06:45:18,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:18,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:45:18,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:18,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:45:19,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:19,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:45:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:19,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:45:19,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:45:20,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:20,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:21,524 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:45:21,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:21,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:21,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:21,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:21,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:45:21,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20 [2019-09-10 06:45:21,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:45:21,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:45:21,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:45:21,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:45:21,745 INFO L87 Difference]: Start difference. First operand 68031 states and 86117 transitions. Second operand 16 states. [2019-09-10 06:45:22,307 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 06:45:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:27,577 INFO L93 Difference]: Finished difference Result 176944 states and 222215 transitions. [2019-09-10 06:45:27,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:45:27,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-09-10 06:45:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:28,364 INFO L225 Difference]: With dead ends: 176944 [2019-09-10 06:45:28,364 INFO L226 Difference]: Without dead ends: 176944 [2019-09-10 06:45:28,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 160 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:45:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176944 states. [2019-09-10 06:45:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176944 to 68268. [2019-09-10 06:45:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68268 states. [2019-09-10 06:45:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68268 states to 68268 states and 86400 transitions. [2019-09-10 06:45:30,567 INFO L78 Accepts]: Start accepts. Automaton has 68268 states and 86400 transitions. Word has length 89 [2019-09-10 06:45:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:30,567 INFO L475 AbstractCegarLoop]: Abstraction has 68268 states and 86400 transitions. [2019-09-10 06:45:30,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:45:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 68268 states and 86400 transitions. [2019-09-10 06:45:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 06:45:30,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:30,583 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] [2019-09-10 06:45:30,583 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:30,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:30,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1635641784, now seen corresponding path program 1 times [2019-09-10 06:45:30,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:30,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:30,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:30,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:30,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:30,814 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 06:45:30,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:30,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:45:30,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:30,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:45:30,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:45:30,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:45:30,816 INFO L87 Difference]: Start difference. First operand 68268 states and 86400 transitions. Second operand 10 states. [2019-09-10 06:45:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:33,799 INFO L93 Difference]: Finished difference Result 190891 states and 240365 transitions. [2019-09-10 06:45:33,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:45:33,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 06:45:33,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:34,082 INFO L225 Difference]: With dead ends: 190891 [2019-09-10 06:45:34,083 INFO L226 Difference]: Without dead ends: 190891 [2019-09-10 06:45:34,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=314, Invalid=946, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:45:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190891 states. [2019-09-10 06:45:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190891 to 84393. [2019-09-10 06:45:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84393 states. [2019-09-10 06:45:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84393 states to 84393 states and 106800 transitions. [2019-09-10 06:45:36,047 INFO L78 Accepts]: Start accepts. Automaton has 84393 states and 106800 transitions. Word has length 89 [2019-09-10 06:45:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:36,047 INFO L475 AbstractCegarLoop]: Abstraction has 84393 states and 106800 transitions. [2019-09-10 06:45:36,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:45:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 84393 states and 106800 transitions. [2019-09-10 06:45:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 06:45:36,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:36,056 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] [2019-09-10 06:45:36,056 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:36,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:36,057 INFO L82 PathProgramCache]: Analyzing trace with hash -877671765, now seen corresponding path program 1 times [2019-09-10 06:45:36,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:36,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:36,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:36,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:36,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:36,275 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 06:45:36,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:36,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:45:36,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:36,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:45:36,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:45:36,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:45:36,277 INFO L87 Difference]: Start difference. First operand 84393 states and 106800 transitions. Second operand 12 states. [2019-09-10 06:45:38,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:38,357 INFO L93 Difference]: Finished difference Result 211175 states and 267057 transitions. [2019-09-10 06:45:38,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:45:38,357 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-10 06:45:38,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:38,611 INFO L225 Difference]: With dead ends: 211175 [2019-09-10 06:45:38,611 INFO L226 Difference]: Without dead ends: 211175 [2019-09-10 06:45:38,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:45:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211175 states. [2019-09-10 06:45:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211175 to 85300. [2019-09-10 06:45:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85300 states. [2019-09-10 06:45:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85300 states to 85300 states and 107890 transitions. [2019-09-10 06:45:40,855 INFO L78 Accepts]: Start accepts. Automaton has 85300 states and 107890 transitions. Word has length 90 [2019-09-10 06:45:40,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:40,855 INFO L475 AbstractCegarLoop]: Abstraction has 85300 states and 107890 transitions. [2019-09-10 06:45:40,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:45:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 85300 states and 107890 transitions. [2019-09-10 06:45:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 06:45:40,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:40,861 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:45:40,862 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:40,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:40,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1117583225, now seen corresponding path program 1 times [2019-09-10 06:45:40,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:40,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:40,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:40,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:40,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:40,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:40,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:45:40,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:40,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:45:40,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:45:40,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:40,924 INFO L87 Difference]: Start difference. First operand 85300 states and 107890 transitions. Second operand 3 states. [2019-09-10 06:45:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:41,155 INFO L93 Difference]: Finished difference Result 85302 states and 105913 transitions. [2019-09-10 06:45:41,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:45:41,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 06:45:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:41,246 INFO L225 Difference]: With dead ends: 85302 [2019-09-10 06:45:41,247 INFO L226 Difference]: Without dead ends: 85302 [2019-09-10 06:45:41,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85302 states. [2019-09-10 06:45:41,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85302 to 85259. [2019-09-10 06:45:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85259 states. [2019-09-10 06:45:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85259 states to 85259 states and 105867 transitions. [2019-09-10 06:45:41,987 INFO L78 Accepts]: Start accepts. Automaton has 85259 states and 105867 transitions. Word has length 90 [2019-09-10 06:45:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:41,988 INFO L475 AbstractCegarLoop]: Abstraction has 85259 states and 105867 transitions. [2019-09-10 06:45:41,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 85259 states and 105867 transitions. [2019-09-10 06:45:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 06:45:41,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:41,992 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] [2019-09-10 06:45:41,993 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:41,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:41,993 INFO L82 PathProgramCache]: Analyzing trace with hash 83626030, now seen corresponding path program 1 times [2019-09-10 06:45:41,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:41,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:41,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:42,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:42,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:45:42,134 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2019-09-10 06:45:42,134 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [164], [167], [168], [170], [173], [178], [180], [201], [203], [3199], [3203], [3206], [3209], [3212], [3216], [3325], [3328], [3349], [3351], [3412], [3458], [3461], [3464], [3468], [3471], [3475], [3479], [3481], [3484], [3488], [3491], [3494], [3498], [3636], [3639], [3642], [3658], [3662], [3664], [3667], [3670], [3672], [3677], [3682], [3684], [3703], [3705], [3724], [3839], [3842], [3845], [3849], [3853], [3857], [3859], [3863], [3866], [3869], [3872], [3874], [4485], [4486], [4490], [4491], [4492] [2019-09-10 06:45:42,139 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:45:42,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:45:42,206 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:45:42,407 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:45:42,408 INFO L272 AbstractInterpreter]: Visited 85 different actions 208 times. Merged at 28 different actions 112 times. Widened at 5 different actions 5 times. Performed 1059 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1059 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 6 different actions. Largest state had 253 variables. [2019-09-10 06:45:42,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:42,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:45:42,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:42,409 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:45:42,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:42,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:45:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:42,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 06:45:42,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:45:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:42,834 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:45:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:43,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:45:43,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 17 [2019-09-10 06:45:43,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:45:43,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:45:43,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:45:43,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:45:43,020 INFO L87 Difference]: Start difference. First operand 85259 states and 105867 transitions. Second operand 10 states. [2019-09-10 06:45:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:43,803 INFO L93 Difference]: Finished difference Result 147774 states and 181594 transitions. [2019-09-10 06:45:43,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:45:43,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-10 06:45:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:43,963 INFO L225 Difference]: With dead ends: 147774 [2019-09-10 06:45:43,963 INFO L226 Difference]: Without dead ends: 147774 [2019-09-10 06:45:43,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 168 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:45:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147774 states. [2019-09-10 06:45:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147774 to 118623. [2019-09-10 06:45:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118623 states. [2019-09-10 06:45:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118623 states to 118623 states and 147164 transitions. [2019-09-10 06:45:45,601 INFO L78 Accepts]: Start accepts. Automaton has 118623 states and 147164 transitions. Word has length 90 [2019-09-10 06:45:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:45,601 INFO L475 AbstractCegarLoop]: Abstraction has 118623 states and 147164 transitions. [2019-09-10 06:45:45,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:45:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 118623 states and 147164 transitions. [2019-09-10 06:45:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 06:45:45,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:45,607 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:45:45,608 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:45,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1407281803, now seen corresponding path program 1 times [2019-09-10 06:45:45,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:45,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:45,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:45,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:45,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:45,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:45,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:45:45,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:45,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:45:45,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:45:45,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:45:45,677 INFO L87 Difference]: Start difference. First operand 118623 states and 147164 transitions. Second operand 5 states. [2019-09-10 06:45:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:46,593 INFO L93 Difference]: Finished difference Result 124348 states and 151749 transitions. [2019-09-10 06:45:46,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:45:46,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-10 06:45:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:46,756 INFO L225 Difference]: With dead ends: 124348 [2019-09-10 06:45:46,756 INFO L226 Difference]: Without dead ends: 124348 [2019-09-10 06:45:46,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:45:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124348 states. [2019-09-10 06:45:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124348 to 111004. [2019-09-10 06:45:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111004 states. [2019-09-10 06:45:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111004 states to 111004 states and 134993 transitions. [2019-09-10 06:45:48,692 INFO L78 Accepts]: Start accepts. Automaton has 111004 states and 134993 transitions. Word has length 92 [2019-09-10 06:45:48,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:48,692 INFO L475 AbstractCegarLoop]: Abstraction has 111004 states and 134993 transitions. [2019-09-10 06:45:48,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:45:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 111004 states and 134993 transitions. [2019-09-10 06:45:48,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:45:48,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:48,698 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:45:48,698 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:48,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash -522631261, now seen corresponding path program 1 times [2019-09-10 06:45:48,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:48,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:48,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:48,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:45:48,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:48,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:45:48,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:48,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:45:48,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:45:48,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:48,760 INFO L87 Difference]: Start difference. First operand 111004 states and 134993 transitions. Second operand 3 states. [2019-09-10 06:45:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:49,109 INFO L93 Difference]: Finished difference Result 110911 states and 133386 transitions. [2019-09-10 06:45:49,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:45:49,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 06:45:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:49,241 INFO L225 Difference]: With dead ends: 110911 [2019-09-10 06:45:49,241 INFO L226 Difference]: Without dead ends: 110911 [2019-09-10 06:45:49,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:45:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110911 states. [2019-09-10 06:45:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110911 to 92129. [2019-09-10 06:45:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92129 states. [2019-09-10 06:45:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92129 states to 92129 states and 111171 transitions. [2019-09-10 06:45:50,236 INFO L78 Accepts]: Start accepts. Automaton has 92129 states and 111171 transitions. Word has length 94 [2019-09-10 06:45:50,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:50,236 INFO L475 AbstractCegarLoop]: Abstraction has 92129 states and 111171 transitions. [2019-09-10 06:45:50,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:45:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 92129 states and 111171 transitions. [2019-09-10 06:45:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:45:50,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:50,241 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] [2019-09-10 06:45:50,242 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:50,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:50,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2106461639, now seen corresponding path program 1 times [2019-09-10 06:45:50,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:50,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:50,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:50,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:50,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:45:50,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:50,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:45:50,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:50,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:45:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:45:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:45:50,326 INFO L87 Difference]: Start difference. First operand 92129 states and 111171 transitions. Second operand 5 states. [2019-09-10 06:45:50,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:50,766 INFO L93 Difference]: Finished difference Result 110819 states and 133520 transitions. [2019-09-10 06:45:50,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:45:50,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 06:45:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:50,903 INFO L225 Difference]: With dead ends: 110819 [2019-09-10 06:45:50,903 INFO L226 Difference]: Without dead ends: 110819 [2019-09-10 06:45:50,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:45:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110819 states. [2019-09-10 06:45:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110819 to 91221. [2019-09-10 06:45:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91221 states. [2019-09-10 06:45:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91221 states to 91221 states and 109965 transitions. [2019-09-10 06:45:52,258 INFO L78 Accepts]: Start accepts. Automaton has 91221 states and 109965 transitions. Word has length 95 [2019-09-10 06:45:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:52,258 INFO L475 AbstractCegarLoop]: Abstraction has 91221 states and 109965 transitions. [2019-09-10 06:45:52,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:45:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 91221 states and 109965 transitions. [2019-09-10 06:45:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:45:52,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:52,263 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] [2019-09-10 06:45:52,263 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1960434292, now seen corresponding path program 1 times [2019-09-10 06:45:52,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:52,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:52,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:52,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:52,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:52,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:52,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:45:52,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:52,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:45:52,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:45:52,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:45:52,351 INFO L87 Difference]: Start difference. First operand 91221 states and 109965 transitions. Second operand 5 states. [2019-09-10 06:45:52,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:52,870 INFO L93 Difference]: Finished difference Result 133718 states and 161335 transitions. [2019-09-10 06:45:52,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:45:52,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-10 06:45:52,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:53,025 INFO L225 Difference]: With dead ends: 133718 [2019-09-10 06:45:53,025 INFO L226 Difference]: Without dead ends: 133718 [2019-09-10 06:45:53,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:45:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133718 states. [2019-09-10 06:45:53,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133718 to 111153. [2019-09-10 06:45:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111153 states. [2019-09-10 06:45:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111153 states to 111153 states and 133773 transitions. [2019-09-10 06:45:54,108 INFO L78 Accepts]: Start accepts. Automaton has 111153 states and 133773 transitions. Word has length 96 [2019-09-10 06:45:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:54,109 INFO L475 AbstractCegarLoop]: Abstraction has 111153 states and 133773 transitions. [2019-09-10 06:45:54,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:45:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 111153 states and 133773 transitions. [2019-09-10 06:45:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:45:54,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:54,116 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] [2019-09-10 06:45:54,116 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash 537181902, now seen corresponding path program 1 times [2019-09-10 06:45:54,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:54,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:54,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:54,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:54,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:45:54,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:54,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:45:54,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:54,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:45:54,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:45:54,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:45:54,182 INFO L87 Difference]: Start difference. First operand 111153 states and 133773 transitions. Second operand 4 states. [2019-09-10 06:45:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:54,902 INFO L93 Difference]: Finished difference Result 133580 states and 160365 transitions. [2019-09-10 06:45:54,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:45:54,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-10 06:45:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:55,033 INFO L225 Difference]: With dead ends: 133580 [2019-09-10 06:45:55,033 INFO L226 Difference]: Without dead ends: 133580 [2019-09-10 06:45:55,033 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 06:45:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133580 states. [2019-09-10 06:45:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133580 to 111153. [2019-09-10 06:45:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111153 states. [2019-09-10 06:45:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111153 states to 111153 states and 133773 transitions. [2019-09-10 06:45:56,396 INFO L78 Accepts]: Start accepts. Automaton has 111153 states and 133773 transitions. Word has length 102 [2019-09-10 06:45:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:56,396 INFO L475 AbstractCegarLoop]: Abstraction has 111153 states and 133773 transitions. [2019-09-10 06:45:56,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:45:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 111153 states and 133773 transitions. [2019-09-10 06:45:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:45:56,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:56,405 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] [2019-09-10 06:45:56,406 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:56,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:56,406 INFO L82 PathProgramCache]: Analyzing trace with hash -381792721, now seen corresponding path program 1 times [2019-09-10 06:45:56,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:56,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:56,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:56,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:56,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:56,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:56,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:45:56,653 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2019-09-10 06:45:56,654 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [74], [77], [80], [84], [164], [167], [168], [170], [173], [178], [180], [183], [186], [191], [194], [203], [353], [453], [456], [459], [463], [466], [470], [474], [476], [479], [482], [485], [490], [493], [496], [499], [503], [916], [919], [922], [926], [930], [933], [936], [939], [947], [3325], [3328], [3349], [3351], [3354], [3357], [3360], [3363], [3371], [3373], [3636], [3639], [3660], [3662], [3664], [3667], [3670], [3680], [3682], [3684], [3703], [3705], [3708], [3711], [3714], [3722], [4485], [4486], [4490], [4491], [4492] [2019-09-10 06:45:56,661 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:45:56,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:45:56,708 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:45:57,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:45:57,020 INFO L272 AbstractInterpreter]: Visited 97 different actions 309 times. Merged at 38 different actions 191 times. Widened at 9 different actions 20 times. Performed 1324 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1324 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 17 fixpoints after 9 different actions. Largest state had 255 variables. [2019-09-10 06:45:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:57,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:45:57,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:57,021 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:45:57,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:57,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:45:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:57,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:45:57,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:45:57,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:57,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:58,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:45:58,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:58,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:58,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:58,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:58,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:45:58,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2019-09-10 06:45:58,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:45:58,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:45:58,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:45:58,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:45:58,330 INFO L87 Difference]: Start difference. First operand 111153 states and 133773 transitions. Second operand 19 states. [2019-09-10 06:46:03,049 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 06:46:03,525 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 06:46:03,848 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-09-10 06:46:04,222 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-09-10 06:46:05,123 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 06:46:06,350 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 06:46:07,061 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 06:46:07,359 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 06:46:08,176 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 06:46:08,776 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 06:46:09,564 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 06:46:10,327 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 06:46:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:11,024 INFO L93 Difference]: Finished difference Result 335381 states and 398818 transitions. [2019-09-10 06:46:11,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 06:46:11,025 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 102 [2019-09-10 06:46:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:11,396 INFO L225 Difference]: With dead ends: 335381 [2019-09-10 06:46:11,397 INFO L226 Difference]: Without dead ends: 335381 [2019-09-10 06:46:11,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 181 SyntacticMatches, 11 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1187, Invalid=3643, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 06:46:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335381 states. [2019-09-10 06:46:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335381 to 139419. [2019-09-10 06:46:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139419 states. [2019-09-10 06:46:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139419 states to 139419 states and 167169 transitions. [2019-09-10 06:46:14,160 INFO L78 Accepts]: Start accepts. Automaton has 139419 states and 167169 transitions. Word has length 102 [2019-09-10 06:46:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:14,160 INFO L475 AbstractCegarLoop]: Abstraction has 139419 states and 167169 transitions. [2019-09-10 06:46:14,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:46:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 139419 states and 167169 transitions. [2019-09-10 06:46:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:46:14,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:14,171 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] [2019-09-10 06:46:14,171 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:14,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1158856959, now seen corresponding path program 1 times [2019-09-10 06:46:14,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:14,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:14,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:14,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:14,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:14,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:14,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:14,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:14,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:14,232 INFO L87 Difference]: Start difference. First operand 139419 states and 167169 transitions. Second operand 3 states. [2019-09-10 06:46:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:14,378 INFO L93 Difference]: Finished difference Result 50480 states and 59091 transitions. [2019-09-10 06:46:14,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:14,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 06:46:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:14,432 INFO L225 Difference]: With dead ends: 50480 [2019-09-10 06:46:14,432 INFO L226 Difference]: Without dead ends: 50480 [2019-09-10 06:46:14,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50480 states. [2019-09-10 06:46:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50480 to 50478. [2019-09-10 06:46:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50478 states. [2019-09-10 06:46:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50478 states to 50478 states and 59090 transitions. [2019-09-10 06:46:14,836 INFO L78 Accepts]: Start accepts. Automaton has 50478 states and 59090 transitions. Word has length 103 [2019-09-10 06:46:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:14,836 INFO L475 AbstractCegarLoop]: Abstraction has 50478 states and 59090 transitions. [2019-09-10 06:46:14,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 50478 states and 59090 transitions. [2019-09-10 06:46:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:46:14,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:14,842 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] [2019-09-10 06:46:14,843 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:14,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:14,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1037867407, now seen corresponding path program 1 times [2019-09-10 06:46:14,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:14,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:14,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:14,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:14,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:46:14,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:14,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:46:14,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:14,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:46:14,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:46:14,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:46:14,975 INFO L87 Difference]: Start difference. First operand 50478 states and 59090 transitions. Second operand 8 states. [2019-09-10 06:46:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:16,123 INFO L93 Difference]: Finished difference Result 85490 states and 99535 transitions. [2019-09-10 06:46:16,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:46:16,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-09-10 06:46:16,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:16,199 INFO L225 Difference]: With dead ends: 85490 [2019-09-10 06:46:16,199 INFO L226 Difference]: Without dead ends: 85490 [2019-09-10 06:46:16,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:46:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85490 states. [2019-09-10 06:46:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85490 to 50478. [2019-09-10 06:46:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50478 states. [2019-09-10 06:46:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50478 states to 50478 states and 59089 transitions. [2019-09-10 06:46:17,020 INFO L78 Accepts]: Start accepts. Automaton has 50478 states and 59089 transitions. Word has length 103 [2019-09-10 06:46:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:17,021 INFO L475 AbstractCegarLoop]: Abstraction has 50478 states and 59089 transitions. [2019-09-10 06:46:17,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:46:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 50478 states and 59089 transitions. [2019-09-10 06:46:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:46:17,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:17,025 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] [2019-09-10 06:46:17,025 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:17,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1287656073, now seen corresponding path program 1 times [2019-09-10 06:46:17,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:17,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:17,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:17,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:17,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:17,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:17,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:46:17,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2019-09-10 06:46:17,234 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [74], [77], [80], [84], [164], [167], [168], [170], [173], [178], [180], [183], [186], [191], [194], [203], [353], [453], [456], [459], [463], [466], [470], [474], [476], [479], [482], [485], [490], [493], [496], [499], [503], [916], [919], [922], [926], [930], [933], [936], [939], [947], [3325], [3328], [3349], [3351], [3354], [3357], [3360], [3363], [3371], [3373], [3636], [3639], [3642], [3658], [3662], [3664], [3667], [3670], [3680], [3682], [3684], [3703], [3705], [3708], [3711], [3714], [3722], [4485], [4486], [4490], [4491], [4492] [2019-09-10 06:46:17,238 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:46:17,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:46:17,283 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:46:17,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:46:17,759 INFO L272 AbstractInterpreter]: Visited 98 different actions 441 times. Merged at 39 different actions 311 times. Widened at 15 different actions 51 times. Performed 1672 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1672 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 10 different actions. Largest state had 255 variables. [2019-09-10 06:46:17,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:17,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:46:17,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:17,759 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:46:17,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:17,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:46:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:18,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 1373 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:46:18,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:46:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:18,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:46:18,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:18,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:18,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:18,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:19,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:46:19,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:46:19,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 26 [2019-09-10 06:46:19,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:46:19,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:46:19,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:46:19,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:46:19,649 INFO L87 Difference]: Start difference. First operand 50478 states and 59089 transitions. Second operand 19 states. [2019-09-10 06:46:20,181 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 06:46:20,614 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:46:20,974 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:46:21,294 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 06:46:22,005 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:46:23,282 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 06:46:23,488 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:46:23,782 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 06:46:24,693 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:46:24,864 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 06:46:25,455 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-09-10 06:46:26,923 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:46:27,349 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 06:46:27,682 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 06:46:28,170 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-10 06:46:28,340 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:46:28,558 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-10 06:46:28,973 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 06:46:29,479 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:46:29,785 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 06:46:30,124 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 06:46:30,344 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 06:46:30,541 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 06:46:30,698 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:46:30,883 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 06:46:31,237 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 06:46:31,584 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 06:46:31,848 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:46:32,750 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:46:32,936 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:46:33,183 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:46:33,683 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 06:46:34,077 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 06:46:34,303 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:46:34,820 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 06:46:35,105 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 06:46:35,399 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:46:35,694 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:46:35,959 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:46:36,131 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:46:36,422 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:46:36,962 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:46:37,234 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 06:46:37,907 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 06:46:38,232 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:46:38,470 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:46:38,679 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:46:38,927 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:46:39,301 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:46:39,746 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:46:40,088 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:46:40,422 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:46:41,053 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 06:46:41,364 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:46:41,721 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:46:41,961 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:46:42,427 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 06:46:42,903 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 06:46:43,138 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:46:43,735 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 06:46:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:44,202 INFO L93 Difference]: Finished difference Result 130643 states and 152416 transitions. [2019-09-10 06:46:44,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 06:46:44,202 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 103 [2019-09-10 06:46:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:44,203 INFO L225 Difference]: With dead ends: 130643 [2019-09-10 06:46:44,203 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 06:46:44,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 223 SyntacticMatches, 16 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2475 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=1657, Invalid=6715, Unknown=0, NotChecked=0, Total=8372 [2019-09-10 06:46:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 06:46:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 06:46:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 06:46:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 06:46:44,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2019-09-10 06:46:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:44,206 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 06:46:44,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:46:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 06:46:44,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 06:46:44,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 06:46:44 BoogieIcfgContainer [2019-09-10 06:46:44,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 06:46:44,214 INFO L168 Benchmark]: Toolchain (without parser) took 150391.85 ms. Allocated memory was 133.2 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 83.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-10 06:46:44,214 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory is still 107.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 06:46:44,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1749.89 ms. Allocated memory was 133.2 MB in the beginning and 220.2 MB in the end (delta: 87.0 MB). Free memory was 83.4 MB in the beginning and 129.0 MB in the end (delta: -45.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 7.1 GB. [2019-09-10 06:46:44,215 INFO L168 Benchmark]: Boogie Preprocessor took 232.45 ms. Allocated memory is still 220.2 MB. Free memory was 129.0 MB in the beginning and 114.9 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-09-10 06:46:44,216 INFO L168 Benchmark]: RCFGBuilder took 3079.80 ms. Allocated memory was 220.2 MB in the beginning and 358.1 MB in the end (delta: 137.9 MB). Free memory was 114.9 MB in the beginning and 263.6 MB in the end (delta: -148.7 MB). Peak memory consumption was 95.7 MB. Max. memory is 7.1 GB. [2019-09-10 06:46:44,216 INFO L168 Benchmark]: TraceAbstraction took 145324.65 ms. Allocated memory was 358.1 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 263.6 MB in the beginning and 1.2 GB in the end (delta: -891.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-09-10 06:46:44,219 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory is still 107.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1749.89 ms. Allocated memory was 133.2 MB in the beginning and 220.2 MB in the end (delta: 87.0 MB). Free memory was 83.4 MB in the beginning and 129.0 MB in the end (delta: -45.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 232.45 ms. Allocated memory is still 220.2 MB. Free memory was 129.0 MB in the beginning and 114.9 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3079.80 ms. Allocated memory was 220.2 MB in the beginning and 358.1 MB in the end (delta: 137.9 MB). Free memory was 114.9 MB in the beginning and 263.6 MB in the end (delta: -148.7 MB). Peak memory consumption was 95.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 145324.65 ms. Allocated memory was 358.1 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 263.6 MB in the beginning and 1.2 GB in the end (delta: -891.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1288]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5192]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1795]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3360]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 1126 locations, 6 error locations. SAFE Result, 145.2s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 88.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22083 SDtfs, 69515 SDslu, 56822 SDs, 0 SdLazy, 38214 SolverSat, 2230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1391 GetRequests, 819 SyntacticMatches, 39 SemanticMatches, 533 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5216 ImplicationChecksByTransitivity, 33.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139419occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 39.5s AutomataMinimizationTime, 41 MinimizatonAttempts, 1085346 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 3518 NumberOfCodeBlocks, 3518 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3853 ConstructedInterpolants, 146 QuantifiedInterpolants, 2972132 SizeOfPredicates, 39 NumberOfNonLiveVariables, 5434 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 49 InterpolantComputations, 37 PerfectInterpolantSequences, 164/210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...